This page allows you to check if a number is prime. Enter a number in the following form, you will instantly know if the number is prime.

Check if

is prime.

29 is prime.

A prime number is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.

The JavaScript function to check if a number is prime in the above formula is given by:

```
// Return true if n is prime
function isPrime(n)
{
// Check if n is less than 2 => not prime
if (n<2) return false;
// Loop from 2 to square root of n
for (let i = 2; i <= Math.sqrt(n); i++)
// If i is a divisor of n, n is not prime
if (n % i == 0) return false;
return true;
}
```

- Calculating the transformation between two set of points
- Catmull-Rom splines
- Check if a point belongs on a line segment
- Cross product
- Common derivatives rules
- Common derivatives
- Dot product
- How to calculate the intersection points of two circles?
- How to check if four points are coplanar?
- Common integrals (primitive functions)
- Least square approximation with a second degree polynomial
- Least-squares fitting of circles
- Least-squares fitting of sphere
- The mathematics behind PCA
- Online square root simplifyer
- Sines, cosines and tangeantes of common angles
- Singular value decomposition (SVD) of a 2×2 matrix
- Tangent line segments to circles
- Understanding covariance matrices

Last update : 03/14/2021