20200620, 22:04  #34 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2×3^{2}×7×67 Posts 
My guess is that you are only testing the 'p' in 2^{p}1. We are talking in the forum about the whole number.
So your number 156635789 is a small prime. But the number 2^{156635789}1 is a number 47,152,071 digits long (~47 megabytes just to right all of the digits). If you wrote neo3, how does it test such a number to see if it is prime? If you do it only by division, then you are only testing the smaller number. 
20200620, 22:14  #35  
Jun 2020
2^{2}×3 Posts 
Quote:
Yes, I agree with you. I try millions of numbers every day. 369.452.123 I will try with the programs you said Thank you... 

20200620, 22:22  #36 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
20FA_{16} Posts 
Any number that is below 100,000,000,000,000,000 that is prime is already known. We don't even need to keep the list, because it is easier to check it than to look it up in a list.
It took the ECM website less than 1 second to show that 100040000300000203 is prime. Last fiddled with by Uncwilly on 20200620 at 22:25 
20200620, 23:13  #37 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2^{3}×3^{2}×59 Posts 
I invite you to post a link to your source code, or post the code itself as an attachment if it is not on github, sourceforge, etc and not too large for the forum file limits. There are some very talented people on this forum. They may have suggestions for you.
Last fiddled with by kriesel on 20200620 at 23:19 
20200621, 04:18  #38 
Oct 2019
5·19 Posts 
There is no need to explain "how you found the factor", it's easy to verify that it's indeed a factor.
Last fiddled with by Fan Ming on 20200621 at 04:22 
20200621, 15:29  #39 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2^{3}·3^{2}·59 Posts 
156635789 P1 factoring done to PrimeNet bounds, no factors found, via gpuowlv6.11292 on RX480 gpu.
Start reading. New participant reference thread Available software Concepts in GIMPS trial factoring Predictions and dubious claims Continue with the GIMPS reference blog or elsewhere. Knuth's Algorithms for example. If you haven't read and understood the relevant parts of this classic, Riesel's Prime Numbers and Computer Methods for Factorization, or other well written equivalent, it's probably too soon to be writing much in the way of code. Last fiddled with by kriesel on 20200621 at 15:42 
20200621, 15:50  #40  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2^{3}×3^{2}×59 Posts 
Quote:


20200621, 19:42  #41 
Mar 2019
45_{16} Posts 
That is certainly true from a mathematical standpoint. However, for those new to the forum (presumably including the OP) it's helpful to provide links and instructions to trial factoring software, so they can reproduce results if desired.

20200623, 22:18  #42 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2×3^{2}×7×67 Posts 
I am working up a form (maybe a google based form) that we should require folks to fill out before we answer them. If anyone wants to give input, contact me.

20200624, 00:42  #43 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2×2,819 Posts 
Please stop with all the Google forms and Google sheets and Google whatever. Those things are 100% JS and require annoying CAPTCHAs and all sorts of other Google nonsense.

20200624, 00:49  #44  
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2·3^{2}·7·67 Posts 
Quote:
What platform would you suggest? Perhaps a PDF fill in form? 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
How does one prove that a mersenne prime found with CUDALucas is really prime?  ICWiener  Software  38  20180609 13:59 
Something cool I found in number freak  science_man_88  Miscellaneous Math  24  20101123 13:43 
New largest prime number found  Prime95  Miscellaneous Math  20  20080729 16:58 
Help Us Keep Our Lead By Number of Found Primes  Kosmaj  15k Search  117  20051207 02:22 
How long before you found your first composite number?  Bundu  Data  3  20040814 12:21 