A number n is divisible by another number x if and only if n modulus x=0.
In other words there is no remainder while dividing n by x.
All integers starting with 1 are divisible by themselves and 1
but usually they are divisible by other integers in between.
For example 15 is divisible by 1 and 15. 15 is also divisible by 3 and 5.
A prime number is an integer greater than 1 that is divisible by no number between 1 and itself exclusively.
For example, 5 is prime because it is not divisible by any of 2,3,4. 11 is also prime.
The list of prime numbers starts with 2,3,5,7,11,13,17,19,23,29 and continues infinitely.
The following inputs let you do various operations including checking if a specific number is prime,
getting the next prime number starting with one you specify, or getting a prime number at a specific index into its infinite list.
Is Prime
Check if a number is prime.
Get Next Prime Number
Get Nth Prime Number
Related Resources
Prime Numer Checking in c - a few code examples leading from least efficient/brute force to most optimized