Random Number Generator

Generate a Random Integer Within Any Range

Set a minimum and maximum, click generate, and get a random integer within that range — inclusive on both ends. Each result is uniformly distributed, meaning every integer in the range has an equal probability of being selected. The tool uses your browser's cryptographic random number source for results that are genuinely unpredictable.

The use cases for random number generation are surprisingly broad: selecting a random winner from a numbered list, assigning random groups in a classroom, generating test data, making random decisions when options feel equivalent, sampling from a dataset, running probability experiments, and anywhere else an unbiased random integer within a defined range is useful.

True Randomness vs. Pseudo-Randomness

Not all random number generators are created equal. The most important distinction is between pseudo-random number generators (PRNGs) and cryptographically secure random number generators (CSPRNGs).

A pseudo-random number generator like JavaScript's Math.random() produces a sequence of numbers that appears random but is actually determined by an initial seed value. If you know the seed and the algorithm, you can predict every future output. For most applications — generating game events, shuffling a playlist, picking a random item from a list — this is entirely acceptable. The sequence looks random and behaves statistically like randomness for most purposes.

A cryptographically secure generator like crypto.getRandomValues() uses genuine entropy sources from the operating system (hardware noise, timing variations, user input timing) that cannot be predicted. This is necessary for security applications — generating encryption keys, session tokens, authentication codes — where an attacker who predicted the output could compromise the system.

Our generator uses the cryptographically secure source. For a random number between 1 and 100 used to pick a raffle winner, the distinction doesn't matter much. But it means you can use this generator for any purpose, including security-relevant ones, without concern about predictability.

Uniform Distribution: Every Number Has an Equal Chance

Our generator produces uniformly distributed integers — each value in your range has exactly the same probability of appearing. If you generate numbers between 1 and 10, each individual number should appear approximately 10% of the time over a large number of trials. No number is "due" to appear more often, and recent results don't affect future ones.

One subtle point about converting random bits to integers within a range: naive implementations using modulo arithmetic (random_bits % range_size) can introduce a slight bias toward lower numbers when the range size doesn't divide evenly into the number of possible random values. Our implementation uses rejection sampling — if a generated value would fall in the biased range, it's discarded and a new value is generated — ensuring perfectly uniform distribution across your entire range.

Common Practical Uses

Random Sampling and Selection

Assign a number to each item in a list, generate a random number, and select the corresponding item. This is the simplest implementation of random sampling without a dedicated list randomizer. For a raffle with 47 entries, generate a number between 1 and 47 and announce the winner. For assigning 30 students to 3 groups, generate numbers between 1 and 3 for each student. For choosing which of 15 tasks to tackle next, generate a number between 1 and 15.

Game Mechanics

Dice-based games use specific random integer ranges, but many game mechanics require arbitrary ranges that don't correspond to standard dice. A game mechanic that resolves with a random number between 1 and 47, or between 12 and 85, can't be served by a physical die. Custom ranges are also useful for game testing — simulating the outcomes of thousands of game events to evaluate whether a mechanic's probability distribution produces the intended gameplay balance.

Statistics and Probability Education

Generating large numbers of random values and observing how they distribute is one of the most intuitive ways to understand probability concepts. The law of large numbers — that actual frequencies approach theoretical probabilities as the number of trials increases — becomes concrete when you can generate 1,000 numbers between 1 and 6 and observe that each appears roughly 167 times. Generating random numbers and tallying results by hand, even for just 50–100 trials, produces distributions that visually demonstrate probability concepts more effectively than abstract formulas alone.

Database Seeding and Test Data

When seeding a database with test data, random integers within defined ranges populate numeric fields with realistic variation. An age field seeded with values between 18 and 75, a score field seeded between 0 and 100, an order quantity field seeded between 1 and 50 — all make test data more representative of real-world distributions than constant or sequential values. Combined with other random generators for names, dates, and other fields, random integers are a key ingredient in synthetic test datasets.

Range Considerations

The generator supports any integer range where the minimum is less than or equal to the maximum. Ranges can include negative numbers — minimum -100 to maximum -1 generates a negative integer, minimum -50 to maximum 50 generates positive and negative integers. Both endpoints are inclusive, meaning the minimum and maximum values themselves can appear in the output.

For very large ranges (millions or billions of possible values), the generator works correctly but each individual value becomes statistically unlikely to appear in any small set of trials. For generating large unique identifiers, our UUID generator may be more appropriate since it's specifically designed for that use case with a much larger identifier space.