Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re: Finding Primes

by Abigail-II (Bishop)
on Aug 14, 2003 at 11:03 UTC ( [id://283830]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Finding Primes
in thread Finding Primes

The only thing you can say about n! + 1 is that it will only contain prime factors that are larger than n. And that the series (n! + 2) .. (n! + n) will not contain a prime number.

Abigail

Replies are listed 'Best First'.
Re: Re: Finding Primes : Fermat's "small" theorem
by Foggy Bottoms (Monk) on Aug 14, 2003 at 13:17 UTC
    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...

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://283830]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (5)
As of 2024-03-29 08:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found