mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Closed Thread
 
Thread Tools
Old 2015-11-11, 17:37   #177
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

172C16 Posts
Default

Quote:
Originally Posted by danaj View Post
We need to see it properly working then, with a single PrimeQ at the end that asserts "I have failed, something has gone terribly wrong, do not use this code!" if it ever fails.
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.
CRGreathouse is offline  
Old 2015-11-11, 23:03   #178
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

3·643 Posts
Default

Quote:
Originally Posted by danaj View Post

This is all way too complicated, with too many things floating around (e.g. are we still talking about 1000M digit primes?
Yes, but only in the following capacity:

* 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.
a1call is offline  
Old 2015-11-12, 05:33   #179
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

216508 Posts
Default

Quote:
Originally Posted by a1call View Post
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.
Amen.
Batalov is offline  
Old 2015-11-12, 14:59   #180
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

13·593 Posts
Default

We just wanted to add that we learned enough from this thread to make reading it worthwhile.

Xyzzy is offline  
Closed Thread

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

All times are UTC. The time now is 13:47.

Thu Oct 29 13:47:20 UTC 2020 up 49 days, 10:58, 2 users, load averages: 1.77, 1.74, 1.67

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.