Number Theory

From Example Problems
Revision as of 05:31, 14 March 2009 by Todd (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Prime Numbers

solution Prove that there are infinitely many primes.

solution Prove that there are infinitely many primes of the form .

solution Prove that the number of primes less than is bounded below by .

solution Prove that there are consecutive composite numbers, for any .

solution Prove that any number can be represented by the sum of Fibonacci numbers.


There are many problems available under Project PEN.

Divisibility

solution Find the remainder when is divided by 29.

solution Find the remainder when is divided by 31.

solution Find the remainder when is divided by 18.

solution Prove that is divisible by 6.


Main Page