Raanan Chermoni continues running my program and has just discovered second 17-digit AP23: 489357377433019 + 2701556*23#*n, for n = 0 to 22. It has the largest...
Hello all, I wish to share with you a couple of formulas that I have been "working" with for some time. Let J(n) = the number of ways of writing n as the sum...
Hello, anyone know if it is possible to arrange more than 1 abc2 format tasks in a file. I am searching on record breaking generalized woodall primes. It would...
Will you be searching one base for many n or many bases for a few n or many bases and many n? --Mark ... [Non-text portions of this message have been removed]...
Hello, I would like to know if there is anyway to put these lines/tasks in 1 file. ABC2 $a*$b^$a-1 a:from 16318 to 16318 b:from 15498 to 16319 a:from 16319 to...
In that case I would recommend MultiSieve since it supports multiple bases. It willl knock out any candidates with small divisors and will produce an output...
... One easy way to do that is put the 3 ranges in 3 different ABC2 files, say range1.dat range2.dat & range3.dat and make a batch file to call them in...
Hi, I would suggest: ABC2 $a*$b^$a-1 a:from 16318 to 16320 b:from 15480 to 16321 If you use Multisieve, it will automatically generate ABC2 files for you. ...
I am working on repunits. I tried to apply a small modification---taking into account repunit property of 1 remainder for the same lenght.....ex: 10^2 mod...
Hi, congrats to "Scott" for the find: http://primes.utm.edu/primes/page.php?id=84401 24518^262144+1 with 1150678 decimal digits coming in at 13th largest known...
... Very nice success indeed! I cannot wait for the verification! Many congrats to the discoverer! For a while, Yves Gallot told me that Generalized Fermat...
... What for a while? I have not heard from Yves for a very long time. Please: When did Yves tell you anything for the last time? (Please send your answer, if...
Hi, here's a short, but effective program... written in PHP4/5 it's deterministic when considering primality of a number. can someone go to www.php.net and...
Hello, I am new in prime testing and I have some questions which you might be able to help me answer. When I implemented a Rabin-Miller test in C (for school...
Hi ... The Woltman FFT has nothing to do with the exponentiation algorithm. The FFT is simply used to quickly multiply large numbers. My FFT has lots of...
... This is because it only does squarings, no multiplications. This is especially fast since an FFT multiplication requires two forward FFTs and an inverse...
... It is not so bad, to verify such a monster... ... Yes, I agree with that ; Do you know how the duration of this test using Proth.exe compares (on the same...
... Hi, Thanks for the congrats. My name is Steve Scott and I have been involved in prime number hunting for about 10 years. I was an IT person by trade,...
... PARI/GP finds this factor and proves it prime in less than a second on my laptop: gettime(); r=factorint(subst(factor(x^77+1)[4,1],x,13))[2,1]; print(r); ...
... That's cute, but anyone can completely factor that integer in a few seconds on any decent CAS. Decio:~ decio$ gp GP /PARI CALCULATOR Version 2.3.2...
Raanan Chermoni continues running my program and has just discovered third 17-digit AP23: 3465600168789197 + 3405459*23#*n, for n = 0 to 22. It has the largest...
Raanan Chermoni continues running my program and has just discovered the third known AP24 (the first with 17 digits): 1606021011322579 + 3490622*23#*n, for n =...
I need (a lot of) help proving the following assumption: None of the prime factors of the repunit R(p)=(10^p-1)/9, where p is prime, will have a form...
... Let us reason together... Suppose the prime q divide (10^p-1)/9. It is clearly odd and (because p is prime) is not 3. Now focus on q dividing 10^p-1. ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
