mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2003-08-10, 11:46   #12
1260
 
Feb 2003

25 Posts
Default

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. :(
1260 is offline   Reply With Quote
Old 2003-09-19, 20:31   #13
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

1001010101102 Posts
Default

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.)
ixfd64 is offline   Reply With Quote
Old 2003-10-12, 09:48   #14
1260
 
Feb 2003

25 Posts
Default

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
1260 is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 17:42.


Fri Jul 16 17:42:06 UTC 2021 up 49 days, 15:29, 1 user, load averages: 1.67, 1.47, 1.49

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.