- **Miscellaneous Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=56*)

- - **Have Found Principle to generate infinitive PRIME NUMBERS**
(*https://www.mersenneforum.org/showthread.php?t=1589*)

Have Found Principle to generate infinitive PRIME NUMBERSGreetings!
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 |

How can you test number which have about 10-50 million digits for primility????
A LL-Test 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!!==>:spam: andi314 |

[quote]
It’s no joke. I have found principle to generate very huge PRIME NUMBERS ... [/quote] If you have truly done so, your discovery is potentially quite valuable. 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. |

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 2p-1 i know that Mathematical society have to test my principle of generation infinitive prime numbers. But results i think about 95-100% 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 |

Re: Have Found Principle to generate infinitive PRIME NUMBERS[QUOTE][i]Originally posted by Evgeny Dolgov [/i]
[B]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 [/B][/QUOTE] You should describe your principle here or - even better - below in the "Math"-section so we can discuss it there in detail. Of course there exist algorithms that find primes of 10,000,000 decimal digits - testing all the mersenne prime-candidates 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 prime-producing 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 [URL=http://www.cryptomathic.com/labs/rabinprimalitytest.html]Miller-Rabin test[/URL]. If you want, please calculate ten 40-digit numbers with your idea, punch them in using the link above and let us know how many of them are prime. |

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 |

Thanks for reply
now i'm using this Miller-Rabin test very helpfull tool big thanks later i'l send reply Evgeny Dolgov |

Can you please briefly describe how your algorithm works. ( please dont mention any details!!!)
andi314 |

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+7-1=11 5+7+1=13 3+3+1 5+5+1 7+7-1 7+7+1 X 11+11+1 23+23+1 1+1+1 2+2+1 3+3+1 5+5+1 7+7-1 11+11+1 13+13+1-1 X 17+17-1 +1 X 19+19-1 +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 |

13
113 113*2+1 = 227 is Prime 11113 111111113 111111113*2+1 = 222222227 is Prime then 111111113*2+1 MILLER-RABIN PRIMALITY TEST 222222227 = 222222227 is Prime ... strange 2*prime+1 - high probability its prime! |

(2^20,996,011)-1 - last known Mersenn prime number
20,996,011 - also PRIME NUMBER intresting |

All times are UTC. The time now is 07:23. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.