On Sun, 04 March 2001, "�� ����" wrote:
> who can give me a twin primes table below 1024 bits,or an address, thank you!
Don't be fooled by the name, these only go up to 15 digits:
If you want anything larger, your best bet is to generate them yourself.
If you want twins in a particular contiguous range, and only need probable primes, then you probably ought to use OpenPFGW (see www.primeform.net) to probabilisticly test arbitrary numbers. You can follow up with a deterministic test using Titanix if you need them proved prime.
However, if you are prepared to limit yourself to only "easy to prove" numbers, then you can get a deterministic test out of OpenPFGW. Chose a known factored part just greater than a third of the size of the number you wish to achieve. Primorials are a very good way of generating this known factored part if looking at compound (e.g. twin) primes.
However, if you just need some twins fast, and are not using them for cryptographic purposes, your best bet is to chose a more restrictive range (i.e. far more of the number with known factors) and NewPGen as a prefilterer, using a 'primorial' search, and then use OpenPFGW to perform the probabilistic tests.
All the links to the programs I've mentioned are on the prime pages: http://www.primepages.org/
under the section "prime links"
Hmmm - is there a FAQ answer to this?
If not, shall we create one?
> Unsubscribe by an email to: firstname.lastname@example.org
> The Prime Pages : http://www.primepages.org
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
Mathematics should not have to involve martyrdom;
Support Eric Weisstein, see http://mathworld.wolfram.com
Find the best deals on the web at AltaVista Shopping!