Friday, May 7, 2010
Do you know, every prime number p > 3, satisfies the following:
p^2 = 24*k + 1, for some number k.
Also, every prime p > 30,
p^4 = 240*k + 1, for some number k.
Try proving them. Also, an extension of Eratoshenes sieve method gives the following approximation of ratio of first n numbers to primes in them:
Number of primes ~= n*(1 - 1/2)(1 - 1/3)(1 - 1/5)(1 - 1/7)(1 - 1/11).....(1 - 1/pk) where pk is the largest prime < sqrt(n).
Ratio is thus, approximately, (1 - 1/2)(1 - 1/3)(1 - 1/5)(1 - 1/7)(1 - 1/11).....(1 - 1/pk)
Also, a composite number (n) definitely has a prime factor <= sqrt(n). Do you know? Try proving it.
p^2 = 24*k + 1, for some number k.
Also, every prime p > 30,
p^4 = 240*k + 1, for some number k.
Try proving them. Also, an extension of Eratoshenes sieve method gives the following approximation of ratio of first n numbers to primes in them:
Number of primes ~= n*(1 - 1/2)(1 - 1/3)(1 - 1/5)(1 - 1/7)(1 - 1/11).....(1 - 1/pk) where pk is the largest prime < sqrt(n).
Ratio is thus, approximately, (1 - 1/2)(1 - 1/3)(1 - 1/5)(1 - 1/7)(1 - 1/11).....(1 - 1/pk)
Also, a composite number (n) definitely has a prime factor <= sqrt(n). Do you know? Try proving it.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment