This tool uses JavaScript's Math.random() which produces pseudo-random numbers. For security-sensitive applications (passwords, cryptographic keys), use crypto.getRandomValues() instead. Math.random() is suitable for games, simulations, and sampling.
Pick a minimum, a maximum, and a batch size; the tool returns that many integers sampled uniformly between the two endpoints, inclusive on both ends. The standard inclusive formula Math.floor(rand × (max − min + 1)) + min is used, which gives every integer in the range exactly equal probability.
The underlying generator is the browser's Math.random(), a pseudo-random source seeded from the page environment. That is statistically uniform and perfectly fine for dice, simulations, raffle numbers, sample data, and anything else where a determined attacker is not in scope. For cryptographic randomness — passwords, tokens, audited lotteries — use a tool built on crypto.getRandomValues() instead.
It is a pseudo-random generator: deterministic given a hidden internal seed, but well-distributed and statistically random for everyday use. It is not cryptographic — never use it for keys, tokens, or audited draws. For those, use crypto.getRandomValues().
Yes. The conversion uses Math.floor(Math.random() × (max − min + 1)) + min, which is the standard inclusive-on-both-ends formula. Both min and max have exactly 1 / (max − min + 1) probability.
Yes. The formula is range-agnostic, so −10 to 10 returns every integer from −10 through 10 with equal probability.
No. Each draw is independent and the distribution is memoryless. A long run of small numbers is no more or less likely to be followed by a small number — that intuition (the gambler's fallacy) does not apply to a uniform RNG.
Explore the full suite of MATH tools and 290+ other free utilities at Chunky Munster.