774 search results - page 1 / 155 » Factors of generalized Fermat numbers |
MOC
1998
13 years 10 months ago
1998
MOC
2002
13 years 10 months ago
2002
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
MOC
2000
13 years 10 months ago
2000
We report the discovery of a new factor for each of the Fermat numbers F13, F15, F16. These new factors have 27, 33 and 27 decimal digits respectively. Each factor was found by the...
ORL
1998
13 years 10 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...