The following theorem might help :
Fermat, a French mathematician, once proved that : "
If p is a prime number whilst GCD(p,a)==1 then ap-1 is congruous to 1 modulo p." But actually this theorem isn't enough, it helps you prove a number is not prime, not the other way round...
Lucas, another French dude, came up with yet another theorem which looks for
Mersenne's prime numbers :
Given p an odd number, the number M=2p-1 is prime if and only if 2p-1 divides S(p-1) where S(n+1)=S(n)2 - 2, and S(1) = 4.Further down the road, Indian scientists came up with a very interesting paper you may want to check out : they probably have an answer to your problem :
<a href=http://www.cse.iitk.ac.in/news/primality.pdf>primality.pdf</a>...
Hopefully, I've been of some help - maths are really interesting and I always enjoy digging into them...
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.