20031206, 10:55  #1 
9701_{10} Posts 
Have Found Principle to generate infinitive PRIME NUMBERS
Greetings!
It’s no joke. I have found principle to generate very huge PRIME NUMBERS (any (infinitive) length) special two kind It’s easy to generate prime number that weighs in at a whopping 10,000,000 decimal digits! 50 000 000 and more and more – it’s infinitive And of course I want to get money prize using this principle. (50 000 $) or not. It’s very simple. It's not PRIME NUMBERS of Mersenne!!!! Question : What i must to do right (official)  to get prize and to make this principle  public to all community? Evgeny Dolgov 
20031206, 12:06  #2 
Nov 2002
1001010_{2} Posts 
How can you test number which have about 1050 million digits for primility????
A LLTest takes more than a month on the todays fastest computer( exept supercomputers)!!! And all other numbers that have no special form are impossible to test for primility! So I cant believe in your statement!!==> andi314 
20031206, 12:38  #3  
Jun 2003
The Texas Hill Country
3^{2}·11^{2} Posts 
Quote:
The first thing that you should do is to establish proof of whatever it is. Write up a COMPLETE description of the idea, sign and date the document, and mail it to yourself. When you get it back, DO NOT OPEN the letter, but keep it in a safe place. Then you need to generate a prime large enough to qualify for the prize and establish how it can be proven to be prime in a "reasonable" time. (I presume that there is some property of the generating scheme that can be used to accelerate the proof). At that point, you should find a professional to review your idea. Start with a faculty advisor who should be able to assist you in finding someone who is both qualified and willing to review your work. If it passes the first review, I'm sure that they will be excited and quite willing to help you proceed from there. 

20031206, 12:41  #4 
5·11·79 Posts 
Thanks for replay
Ok i reply Infinity is based on elemental properties of two kind of Prime numbers. So you can generate any huge prime number using very simple rule without any computer machines. and easy to verify that numbers. (probably) ok. of course i know that hard to believe because during centuries there is no any rules only like Mersenne or other. But i say the prime numbers using my very simple principle cannot be obtained or computed using rule of mersenne. it's not numbers like 2p1 i know that Mathematical society have to test my principle of generation infinitive prime numbers. But results i think about 95100% of success. So i need to say all this official and to right people or math organization, i need help to tell this right and may be win the money prize. In which organization i have to turn to? Thanks for any help Evgeny Dolgov 
20031206, 12:48  #5  
Mar 2003
Braunschweig, Germany
226_{10} Posts 
Re: Have Found Principle to generate infinitive PRIME NUMBERS
Quote:
Of course there exist algorithms that find primes of 10,000,000 decimal digits  testing all the mersenne primecandidates is one of the more efficient. You have to show us how your algorithm needs less time to do the same. If you believe, that you have invented a primeproducing formula without the need of testing the generated numbers for primality, but do not want to share the details with us, just let your formula produce a bunch of primes with  let's say  40 decimal digits and check them for primality online with the MillerRabin test. If you want, please calculate ten 40digit numbers with your idea, punch them in using the link above and let us know how many of them are prime. Last fiddled with by TauCeti on 20031206 at 12:56 

20031206, 12:55  #6 
2^{5}·11·19 Posts 
thanks for reply Wacky!
ok So i told about all idea to people who works with me. Some of them are have mathematical education  they found this intresting. ok I'll send a letter to my mail boxes at first with detail description. Evgeny Dolgov (of course i may be mistaken  i understand  that must be strong proof ) OF COURSE I CAN TEST numbers with lenght up to 50 digits on my computer and some amount of time. to help to proof more huge  it's must be initiative of math society to use GRID computing 
20031206, 12:58  #7 
2^{4}×197 Posts 
Thanks for reply
now i'm using this MillerRabin test very helpfull tool big thanks later i'l send reply Evgeny Dolgov 
20031206, 12:58  #8 
Nov 2002
2·37 Posts 
Can you please briefly describe how your algorithm works. ( please dont mention any details!!!)
andi314 
20031206, 13:39  #9 
8,969 Posts 
it's not working with large numbers
so the end of test but i'll search more . i think on the right way ok i tell details at first i wrote 5+71=11 5+7+1=13 3+3+1 5+5+1 7+71 7+7+1 X 11+11+1 23+23+1 1+1+1 2+2+1 3+3+1 5+5+1 7+71 11+11+1 13+13+11 X 17+171 +1 X 19+191 +1 X 23+23+1 ... then.. the last digit must not be .... 4,6,8,5,2 then... 13, 113, 11113, 111111113, ... and i thought it can continue then count of digit (1) 11111  is even(numbered) but it's not work .... ;) but intresting to search more in this direction who can tell next prime number 1.............................11113 (must be even digit of "1") thanks all too sorry for mistake 
20031206, 13:59  #10 
2×13×43 Posts 
13
113 113*2+1 = 227 is Prime 11113 111111113 111111113*2+1 = 222222227 is Prime then 111111113*2+1 MILLERRABIN PRIMALITY TEST 222222227 = 222222227 is Prime ... strange 2*prime+1  high probability its prime! 
20031206, 14:18  #11 
5511_{8} Posts 
(2^20,996,011)1  last known Mersenn prime number
20,996,011  also PRIME NUMBER intresting 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Unique Groupings found in the first 49 mersenne numbers  ONeil  ONeil  27  20181203 01:52 
I think I found proof that no odd perfect numbers exist!  Philly314  Aliquot Sequences  3  20141116 14:58 
How to generate base10 representation of Mersenneprime perfect numbers?  James Heinrich  Miscellaneous Math  10  20120308 07:20 
Shortest sequence of numbers not found in M43  Xyzzy  Miscellaneous Math  41  20081108 17:57 
Effective way to generate prime numbers (infinitive)  Evgeny Dolgov  Math  1  20031208 09:25 