![]() |
![]() |
#1 |
41·61 Posts |
![]()
Hey,
just found this site, played around a bit. Decided to make my own formula to create prime numbers. I did so, and I can now create prime numbers with ease using a pen and paper (or even in my head) to almost any digit (so I think). I've tested my theory using prime number testing programs and it definitely works up to 20 digits. The thing is, I had to wait 10 minutes for the program to verify my result so I can only imagine how long it would take to prove a significantly large prime number. My question: am I on the right track if I can do this to 20 digits, or is this pretty damned commonplace? How many digits before most of the patterns start dissappearing? What would be a worthwhile digit place to give my formula the credit it would need for me to justify tying my computer up for 3 weeks testing a million digit prime number? thx! ![]() |
![]() |
#2 |
Mar 2003
Braunschweig, Germany
E216 Posts |
![]() |
![]() |
![]() |
#3 |
Feb 2003
2×59 Posts |
![]()
You can use Pfgw to test prime numbers of a certain form. For example n*a^m+1, n!+1, etc...
If your formula can be expressed like those quoted here, you definitely can test it up to very big numbers. If you can't download Pfgw or have questions about it, fell free to ask for assistance. |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Do you think you're special? | MooMoo2 | Lounge | 26 | 2016-05-06 20:35 |
Special for LaurV | schickel | Aliquot Sequences | 29 | 2012-07-24 19:24 |
Special Brew | davieddy | Soap Box | 2 | 2010-10-08 22:18 |
Special Circumstances | xilman | Soap Box | 5 | 2009-06-05 08:20 |
Special n | kar_bon | Riesel Prime Data Collecting (k*2^n-1) | 1 | 2009-02-19 04:28 |