       What's the largest index-known prime? On odd-prime-position-constant.

• To: mathgroup at smc.vnet.net
• Subject: [mg130789] What's the largest index-known prime? On odd-prime-position-constant.
• From: a boy <avvboy at gmail.com>
• Date: Wed, 15 May 2013 02:53:51 -0400 (EDT)
• Delivered-to: l-mathgroup@mail-archive0.wolfram.com
• Delivered-to: l-mathgroup@wolfram.com
• Delivered-to: mathgroup-outx@smc.vnet.net
• Delivered-to: mathgroup-newsendx@smc.vnet.net

```I'm going to build some projects to do primes fast computing.

This code generate part of odd-prime-position-constant:

pr = 0;
x = 2*pr*2^32 - 1;
For[k = 0, k < 4096, k++,
t = Table[x += 2; If[PrimeQ[x], 1, 0], {n, 0, 2^20 - 1}];
1mbitx4096-", ToString[pr], "/1MbX4096-", ToString[pr], "--",
ToString[k], ".oppc"}], t, "Bit"];
]

Q:
1. Now! What's the largest index-known prime?
2. How to generate odd-prime-position-constant and storage&access it on cloud?fast,high-capacity...
Can you give some advice or some Mathematica code sample for this?
3. I think HTML5 WebWorker can do a good work on prime constant. Is there ex Js framework on primes?

```

• Prev by Date: Re: Work on Basic Mathematica Stephen!
• Next by Date: Re: Work on Basic Mathematica Stephen!
• Previous by thread: Re: Data interpolation
• Next by thread: How do you control evaluation when using apply?