Tool to search for primes numbers according to criteria. A prime number is a natural number whose divisors are 1 and itself (like 2, 3, 5, 7, 11, 13, 17, 19 ...)

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day! You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Tool to search for primes numbers according to criteria. A prime number is a natural number whose divisors are 1 and itself (like 2, 3, 5, 7, 11, 13, 17, 19 ...)

Answers to Questions

How to find prime numbers?

To know if a number is prime, it is necessary to pass primality test. A test that will verify mathematically and algorithmically, that the number is divisible by none other than itself.

Example: 10 is divisible by 2 so is not prime

Example: 11 is not divisible by 2, 3, 4, 5, 6, 7, 8, 9, or 10, so it's a prime.

There is no method (other than testing all numbers) to find a list of prime numbers exhaustively and quickly.

How do I find the next or previous prime number?

Again, it has no foolproof technique to detect the next prime or the previous prime, dCode will detect the first number (upper or lower) that will be a prime number.

Ask a new question

Source code

dCode retains ownership of the source code of the script Prime Numbers Search online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be given for free. To download the online Prime Numbers Search script for offline use on PC, iPhone or Android, ask for price quote on contact page !