Prime numbers are the atoms of arithmetic, and random samples of them are surprisingly useful — as practice material for factorisation, as the raw ingredients of public-key cryptography, and as the punchline of countless puzzles. But you cannot just pick them by hand: primality is invisible until you check, and checking dozens of numbers by trial division is slow and miserable.
Generate Random Prime Numbers samples verified primes from any interval up to five million. Set a minimum and maximum, choose how many you want, and every value returned has been proven prime by a complete sieve of Eratosthenes — no repeats, no composites, no probabilistic guesswork. The output is ready to copy or download for worksheets, cryptography exercises and experiments.