Prime numbers - practice problems

A prime number is a natural number greater than 1 that has exactly two distinct divisors: 1 and itself. The first few primes are 2, 3, 5, 7, 11, 13, and they continue infinitely as proven by Euclid over 2000 years ago. The number 2 is the only even prime; all other primes are odd. The Fundamental Theorem of Arithmetic states that every integer greater than 1 is either prime or can be uniquely expressed as a product of primes. Prime numbers are central to number theory, cryptography (especially RSA encryption), and have applications in computer science and mathematics. Methods for identifying primes include trial division, the Sieve of Eratosthenes, and more advanced primality tests.

Number of problems found: 520


Do you have unsolved math question and you need help? Ask a question, and we will try to solve it. We solve math question.



Solved math problems are published at new problems.

Do not submit problems from ongoing competitions, including Mathematical Olympiads and correspondence seminars.