On 26 Apr 2001, at 6:34, Hans Riesel wrote:
Hi everybody,
If 2^p-1 is known to be composite with no factor known, then so is
2^(2^p-1)-1.
Much as I hate to nitpick a far better mathematician than myself,
this is seems to be an overstatement.
It is certainly true that, for composite c,
Hi:
George Woltman wrote:
I just completed my first 512K FFT using the new SSE2 instructions!
The 512K FFT handles exponents up to 10.3 million.
Timings are as follows:
1.4GHz P4, old code:0.126 sec.
1.4GHz P4, new code:0.048 sec.
At 08:07 PM 4/26/01 +0200, you wrote:
[sniped]
1.4GHz P4, old code:0.126 sec.
1.4GHz P4, new code:0.048 sec.
1.2GHz Athlon, 133MHz DDR: 0.084 sec.
I have a few more optimizations up my sleeve. I think my goal
of 0.040
Hi again,
At 07:52 PM 4/26/2001 +, Brian J. Beesley wrote:
As opposed to 10.32 million with the 8087 code? If so, that's pretty
good - I thought you might have lost more precision than that.
I haven't figured out the upper limits yet. I expect the limits to be roughly
what Ernst Mayer's
