The converse of Fermat's theorem
"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, on...
Other Authors: | Saliba, Michael S. (authoraut) |
---|---|
Format: | Others |
Language: | English English |
Published: |
Florida State University
|
Subjects: | |
Online Access: | http://purl.flvc.org/fsu/fd/FSU_historic_AKP4926 |
Similar Items
-
The proof of Fermat's last theorem
by: Trad, Mohamad
Published: (2000) -
Solving some specific tasks by Euler's and Fermat's Little theorem
by: Viliam Ďuriš
Published: (2019-12-01) -
Multiplicative polynomials and Fermat's little theorem for non-primes
by: Paul Milnes, et al.
Published: (1997-01-01) -
The Proof of the Fermat’s Conjecture in the Correct Domain
by: Saimir A. Lolja
Published: (2018-12-01) -
An exploration of Fermat numbers
by: Curci, Allison Storm
Published: (2011)