Main menu

Number Theory Linear Algebra Polynomial Equation

Number theory

Primality test

An integer is prime if and only if is greater than 1 and has exactly two divisors 1 and itself.

e.g 2, 3, 5, 7, 11, 13, ..., 31,...


There are infinite prime numbers.

A primality test is an algorithm that, given a nonnegative integer, answers whether it is prime or not.

Calculator

number: