Spelling suggestions: "subject:"congruence"" "subject:"congruency""
31 |
Congruences with constant absolute invariantsOlson, Horace L. January 1900 (has links)
Thesis (Ph. D.)--University of Chicago, 1923. / Reprinted from the Transactions fo the American Mathematical Society, v. 27, no. 1 (Jan., 1925)
|
32 |
Conjugate nets of ruled surfaces in a congruence ...Magee, Gordon Richard, January 1931 (has links)
Thesis (Ph. D.)--University of Chicago, 1933. / Vita. Lithographed. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois."
|
33 |
Conjugate systems with indeterminate axis curves ... /Lane, Ernest Preston, January 1900 (has links)
Thesis (Ph. D.)--University of Chicago, 1918. / Vita. "Private edition, distributed by the University of Chicago Libraries, Chicago, Illinois." "Reprinted from the American journal of mathematics, vol. XLIII, no. 1, January, 1921." Includes bibliographical references. Also available on the Internet.
|
34 |
Congruences on regular semigroupsFriedrich, Linda J. January 1975 (has links)
Thesis (M.A.)--Kutztown State College. / Source: Masters Abstracts International, Volume: 45-06, page: 3170. Bibliography: leaves 60-61.
|
35 |
On certain relations between the projective theory of surfaces and the projective theory of congruences ...Wood, Frank Edwin, January 1900 (has links)
Thesis (Ph. D.)--University of Chicago, 1920. / Vita. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois." "Reprinted from the Transactions of the American mathematical society, vol. 23, no. 4, June 1922." Also available on the Internet.
|
36 |
The converse of Fermat's theoremUnknown Date (has links)
"Of considerable interest among mathematicians is the problem of the determination of primality of positive integers. For a small integer, N, we may say that N is prime or composite merely by trying to divide N by all primes less than or equal to the square root of N since if N is composite, one of its factors must be [less than or equal to] the square root of N. However, if N is large this test loses its practicality and we must resort to a more feasible method. It is the purpose of this paper to trace and show the development of such methods"--Introduction. / "June, 1959." / Typescript. / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Advisor: Paul J. McCarthy, Professor Directing Paper. / Includes bibliographical references (leaf 28).
|
37 |
Combinatorial Proofs of CongruencesRouse, Jeremy 01 May 2003 (has links)
Combinatorial techniques can frequently provide satisfying “explanations” of various mathematical phenomena. In this thesis, we seek to explain a number of well known number theoretic congruences using combinatorial methods. Many of the results we prove involve the Fibonacci sequence and its generalizations.
|
38 |
Contribution à la génération de vecteurs aléatoires et à la cryptographieBaya, Abalo. Van Cutsem, Bernard. Bertrandias, Jean-Paul. January 2008 (has links)
Reproduction de : Thèse de doctorat : Mathématiques appliquées : Grenoble 1 : 1990. / Titre provenant de l'écran-titre. Bibliogr. p. 210-208.
|
39 |
Conjugate systems characterized by special properties of their ray congruences ...Olson, Emma Julia, January 1934 (has links)
Thesis (Ph. D.)--University of Chicago, 1932. / Vita. Lithoprinted. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois." Bibliography: p. 55-56.
|
40 |
Arithmetische Studien über den "letzten" Fermatschen Satz, welcher aussagt, dass die Gleichung an̳ = bn̳ + cn̳ für n]2 in ganzen Zahlen nicht auflösbar istWendt, Ernst, January 1894 (has links)
Thesis (doctoral)--Friedrich-Wilhelms-Universität zu Berlin, 1894. / On t.p. "n̳" is superscript. "Sonderabdruck aus Heft 4, Bd. 113 des Journals für die reine und angewandte Mathematik"--P. 17. Vita.
|
Page generated in 0.0569 seconds