![]() |
|
|
#12 |
|
Feb 2003
25 Posts |
Yes you're right. Thanks.
I guess, this search for B is time consuming, as I estimate B to have about 5000 digits, and there isnt a sieving program that allows expressions. :( |
|
|
|
|
|
#13 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
1001010101102 Posts |
You might be able to make one using an "eval()" function (many languages have it).
Also, if p and p+2 are twin primes, then p+1 is always a multiple of 6! :) (Except for the case of 3 and 5.) |
|
|
|
|
|
#14 |
|
Feb 2003
25 Posts |
the eval() might work for small numbers,
like less than a hundred digits, but it wont do for a thousand digits. I guess, only WinPFGW will work here. Actually, all primes greater than three are either of the form 6k-1 or 6k+1 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Highest Prime is also a twin prime... NOT | hydeer | Lone Mersenne Hunters | 9 | 2018-04-03 22:54 |
| prime generator for f(n)=n^2+1 | bhelmes | Miscellaneous Math | 2 | 2016-03-17 17:50 |
| Twin Prime Days, Prime Day Clusters | cuBerBruce | Puzzles | 3 | 2014-12-01 18:15 |
| New prime test (or generator) | synergy | Miscellaneous Math | 39 | 2004-09-21 17:10 |
| Prime Number Generator | Unregistered | Programming | 6 | 2004-03-21 01:00 |