![]() |
|
|
#1 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
2·5·239 Posts |
...but ya can't hide.
Seriously, though... Anyone notice the huge gap between the discovery of Fermat divisors? I mean, it's been almost 7 months since the last Fermat divisor was discovered. Is the project even running? Well, on the bright side, a longer gap can sometimes mean a bigger surprise! :) --- *makes funny face at next poster*
|
|
|
|
|
|
#2 | |
|
Banned
"Luigi"
Aug 2002
Team Italia
32·5·107 Posts |
Quote:
I received many updates from Fermat's factors searchers :-) Luigi |
|
|
|
|
|
|
#3 |
|
"Phil"
Sep 2002
Tracktown, U.S.A.
3·373 Posts |
Quite a few large Proth primes have been discovered in the past six months, but as luck would have it, none of them proved to be a Fermat number divisor. But sooner or later...
|
|
|
|
|
|
#4 |
|
Dec 2003
Hopefully Near M48
2·3·293 Posts |
What is the smallest Fermat number whose primality status is unknown?
|
|
|
|
|
|
#5 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
45268 Posts |
I believe it's F33.
|
|
|
|
|
|
#6 |
|
"Nancy"
Aug 2002
Alexandria
2,467 Posts |
It is, according to Wilfrid Keller's status page.
|
|
|
|
|
|
#7 | |
|
∂2ω=0
Sep 2002
República de California
103×113 Posts |
Quote:
|
|
|
|
|
|
|
#8 |
|
Dec 2003
Hopefully Near M48
2·3·293 Posts |
"Composite but no factor known m = 14, 20, 22, 24"
So there is a primality test for Fermat numbers that doesn't require finding a factor? |
|
|
|
|
|
#9 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
2×5×239 Posts |
Well, there's Pepin's test, but the numbers quickly grow too large for it.
|
|
|
|
|
|
#10 |
|
Dec 2003
Hopefully Near M48
2×3×293 Posts |
Hmm. F25 already has over 10.1M digits.
No wonder... Mersenne Numbers grow exponentially while Fermat Numbers grow "double exponentially". Last fiddled with by jinydu on 2004-05-27 at 05:43 |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Pari gp Command divisors() ? | Godzilla | PARI/GP | 30 | 2018-03-03 18:15 |
| Finding all divisors kn + 1 of P(n) for various polynomials P | Drdmitry | Computer Science & Computational Number Theory | 0 | 2014-11-28 14:51 |
| Looking for fermat divisors, n=90-120 | firejuggler | Prime Sierpinski Project | 2 | 2012-01-10 17:14 |
| Fermat number and Modulo for searching divisors | CyD | Factoring | 4 | 2011-05-31 11:24 |
| Number of divisors of n? | Citrix | Math | 10 | 2006-02-08 04:09 |