Author: Vincent Lejeune
Date: 06:29:42 05/27/05
Go up one level in this thread
I modified a bit the programs to calculate the time to prove 1000 numbers : 58 sec CPU to prove prime (or not) the even numbers between 123456789012345678901234567890123456789012345678901 to 123456789012345678901234567890123456789012345680901 I really wonder what is the meaning of the message on chessbase.com "Approximately five minutes to calculate every prime number between 1 and 1x10^51 (a sexdicillion) " If it's 5 minutes to prove one number until 10^51 : it's slow. if it's 5 minutes to prove all numbers until 10^51 : it's impossible with Elliptic Curve Method (is there better algo to prove primilaty ?? I think not) thanks, Vincent
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.