20031206, 14:57  #12 
Nov 2002
112_{8} Posts 
The exponent of a Mersenne Prime has itself to be a prime otherwise the number is composite!!!!
andi314 
20031206, 15:02  #13 
6255_{8} Posts 
Game continue!!!!!!!!!!!!!!!!!!
i found new method to generate prime numbers !!!!
using this helpfull test tool! Great thanks to authors of this page MILLERRABIN 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? 
20031206, 15:08  #14 
Nov 2002
2×37 Posts 
post the number in here please and i will test it for you!!

20031206, 15:13  #15 
2^{4}·3^{2}·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 
20031206, 15:15  #16 
Nov 2002
2·37 Posts 
you can use http://www.alpertron.com.ar/ECM.HTM to look if your number is prime

20031206, 15:25  #17 
2^{3}·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 
20031206, 15:43  #18 
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 
20031206, 15:53  #19 
18A4_{16} Posts 
ok
that prime 35 digits 10000000000000000100000000000000003 i'll try to find next 
20031206, 15:57  #20 
2^{3}·3·59 Posts 
all this numbers are prime
1001003 10000100003 100000010000003 10000000100000003 1000000000001000000000003 10000000000000000100000000000000003 
20031206, 17:15  #21  
Dec 2003
2^{2}·41 Posts 
Quote:
Why? 

20031206, 18:17  #22 
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.

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 