![]() |
|
|
#177 |
|
Aug 2006
135338 Posts |
Yes. If I saw code (even horribly inefficient code) of that sort, with at least one user-selectable variable (otherwise you could just preprogram a known prime!) of this sort then I'd agree that he has some sort of apparently-prime-generating algorithm, and then we could talk about whether it actually works and how to make it efficient enough to find million- or billion-digit primes. Until then this is all muh ado about nothing.
|
|
|
|
|
#178 | |
|
"Rashid Naimi"
Oct 2015
Remote to Here/There
3×5×137 Posts |
Quote:
* I had this idea of a formulaic approach to the EFF challenge where you would come up with a mathematical expression (which would probably fit in a single sheet of paper) which would be of`the form of a sum. * The sum could be evaluated in a truncated form (limited and manageable significant digits) which would be shown to be around 10^10^10 and to be less than the largest-factor-of-the-addends-of-the-sum^2, which would then be sufficient proof of primality * To do this you would need to have either a general or perhaps specific formula for a sum which would converge to such a value * I do not know how to get to such a formula which is the reason why, I registered and joined this delightful forum. to ask for assistance The only valid argument against such an approach was presented by one of the MODs on the Physics Forum which has since decided to lock that thread. I think his point is valid but not necessarily without solution. At this point I doubt very much any useful discussions can be generated in this thread. I suggest we let it sink or be locked so that we can get on with our lives. Thank you all for you patience, time and participation. I would specially like to thank danaj and schickel. |
|
|
|
|
|
#179 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
Quote:
|
|
|
|
|
|
#180 |
|
"Mike"
Aug 2002
200408 Posts |
We just wanted to add that we learned enough from this thread to make reading it worthwhile.
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Is CEMPLLA 1.5 "the only software in the world capable of discovering" something? Not really. | CRGreathouse | Number Theory Discussion Group | 51 | 2018-12-16 21:55 |
| Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" | wildrabbitt | Miscellaneous Math | 11 | 2015-03-06 08:17 |
| "Subproject" #10: 200k-300k to 110 digits | RobertS | Aliquot Sequences | 9 | 2011-05-07 15:30 |
| Would Minimizing "iterations between results file" may reveal "is not prime" earlier? | nitai1999 | Software | 7 | 2004-08-26 18:12 |
| Search for a number theoretic function related to "prime divisor sums" | juergen | Math | 2 | 2004-07-10 23:01 |