mersenneforum.org Have Found Principle to generate infinitive PRIME NUMBERS
 Register FAQ Search Today's Posts Mark Forums Read

 2003-12-06, 14:57 #12 andi314     Nov 2002 1128 Posts The exponent of a Mersenne Prime has itself to be a prime otherwise the number is composite!!!! andi314
 2003-12-06, 15:02 #13 Evgeny Dolgov   62558 Posts Game continue!!!!!!!!!!!!!!!!!! i found new method to generate prime numbers !!!! using this helpfull test tool! Great thanks to authors of this page MILLER-RABIN PRIMALITY TEST http://www.cryptomathic.com/labs/rab...alitytest.html i generated simple prime number 7 digit - test ok PRIME 7 digits - ok prime 11 digits - ok prime 15 digits - ok prime 17 digits - ok prime 25 digits - ok prime 35 digits - ok prime then i think next prime about 55 digits - but form field cannot input more than 50 digits ;((((( terrible who can help?
 2003-12-06, 15:08 #14 andi314     Nov 2002 2×37 Posts post the number in here please and i will test it for you!!
 2003-12-06, 15:13 #15 Evgeny Dolgov   24·32·11 Posts More detail this new method based on asymetric prime rule. (30 minutes i used it and then success) this new diffrent from last that i put in previous messages more details on testing # of digits | result 7 success 8 fail 9 fail 10 fail 11 success 12 fail 13 fail 14 fail 15 success 16 fail 17 success 18 fail 19 fail 20 fail 21 fail 22 fail 23 fail 24 fail 25 success 26 fail 27 fail 28 fail 29 fail 30 fail 31 fail 32 fail 33 fail 34 fail 35 success ... next ...... can't input more than 50 digits ithink i need 55 digits for next success test Evgeny Dolgov
 2003-12-06, 15:15 #16 andi314     Nov 2002 2·37 Posts you can use http://www.alpertron.com.ar/ECM.HTM to look if your number is prime
 2003-12-06, 15:25 #17 Evgeny Dolgov   23·1,117 Posts ok it's more complex than previos test page help me please what are the input fields i must use? for example lets start from known prime 127 And Andy tell me please about yourself are you programmer? i need to know who helps me thanks for reply
 2003-12-06, 15:43 #18 andi314     Nov 2002 2×37 Posts Paste your number you want to test in the first box and if this number is prime the box underneath wil show it to you. I'm a programmer ( dont know if im good) but i could help you
 2003-12-06, 15:53 #19 Evgeny Dolgov   18A416 Posts ok that prime 35 digits 10000000000000000100000000000000003 i'll try to find next
 2003-12-06, 15:57 #20 Evgeny Dolgov   23·3·59 Posts all this numbers are prime 1001003 10000100003 100000010000003 10000000100000003 1000000000001000000000003 10000000000000000100000000000000003
2003-12-06, 17:15   #21
M29

Dec 2003

22·41 Posts

Quote:
 Originally posted by Evgeny Dolgov that prime 35 digits
Does your algorithm work only in decimal (base-10) ?

Why?

 2003-12-06, 18:17 #22 nfortino     Nov 2003 3×5×11 Posts It is possible the algorithm will produce many primes in other bases, but only by a fluke. I assume the method was created using the well known divisability rules in decimal (i.e if the sum of the digits is divisible by 3, then the number is divisible by 3, if the number ends in 0 or 5 it is divisble by five...) These rules are base specific. It is worth noting that this type of number will never be prime in bases 6,9,12..., because the number will always be divisible by 3 (in these bases any number ending in 3 is), and in base six, they will also be divisible by 5.

 Similar Threads Thread Thread Starter Forum Replies Last Post ONeil ONeil 27 2018-12-03 01:52 Philly314 Aliquot Sequences 3 2014-11-16 14:58 James Heinrich Miscellaneous Math 10 2012-03-08 07:20 Xyzzy Miscellaneous Math 41 2008-11-08 17:57 Evgeny Dolgov Math 1 2003-12-08 09:25

All times are UTC. The time now is 09:05.

Mon May 10 09:05:26 UTC 2021 up 32 days, 3:46, 0 users, load averages: 3.10, 2.42, 2.12