RE: [PrimeNumbers] factorial
- hello chris
i forgot to ask one more thing, from where hav u seen the theoirem
Chris Caldwell <caldwell@...> wrote:
Hello Rassel from Bangladesh.
> please send also Wilson theorem and its genarelized form.Yes. To be prime we must have no divisor less than the square root.
> is there is any theorem like p is prime iff p dose not divide
> (celieng of n/3)! ?
ceiling(n/3) is greater than the square root when n>6. So the theorem
n>6 is prime if it is relatively prime to ceiling(n/3)!
But of course trial division is faster. You need a higher restriction
to replace "relatively prime" with divides (consider 25) as you need
ceiling(n/3) >= 2*sqrt(n).
There is a similar theorem for ceiling(n/k)! for each k.
Use Photomail to share photos without annoying attachments.
[Non-text portions of this message have been removed]