7
10
%
10
3.32
7
10
%
10
3.32
The Random Name Picker Calculator provides a fair, seed-based method for selecting one entry from a group of any size. Whether you are choosing a raffle winner, assigning tasks, picking a volunteer, or making any selection from a numbered list, this tool ensures equal probability for every entry while maintaining full reproducibility through the seed mechanism.
Fair random selection is a cornerstone of experimental design, sampling theory, and everyday decision-making. When every participant must have an equal chance of being selected, pseudo-random number generation provides an objective, transparent, and repeatable selection process that eliminates human bias.
The calculator generates a pseudo-random number using a sinusoidal hash function and maps it to an entry index:
$$h = |\sin(\text{seed} \times 12.9898 + 78.233) \times 43758.5453| \mod 1$$
$$\text{Selected} = \lfloor h \times N \rfloor + 1$$
where $$N$$ is the total number of entries. Each entry has equal probability:
$$P(\text{entry}_i) = \frac{1}{N}$$
The selection entropy, measured in bits, quantifies the amount of uncertainty (information) in the selection:
$$H = \log_2(N)$$
For example, choosing from 8 entries has 3 bits of entropy (equivalent to 3 coin flips), while choosing from 1000 entries has about 9.97 bits of entropy. Higher entropy means more randomness is needed for the selection, and the outcome is harder to predict.
The Selected Entry Number tells you which numbered entry was chosen (1 through N). The Probability per Entry shows the theoretical chance each entry had of being selected. The Probability (1 in N) expresses this as a 'one in N' chance. The Selection Entropy in bits measures the information content of the selection; higher values indicate more uncertainty.
For verifiable fairness, share the seed publicly before making the selection. Anyone can reproduce the exact same result using the same seed and entry count, providing transparent proof of fair selection.
Inputs
Results
From 10 entries, entry #5 is selected. Each entry had a 10% chance (1 in 10). The selection entropy of 3.32 bits means roughly 3.3 binary choices worth of randomness.
Inputs
Results
From 100 entries, entry #73 is selected. Each entry had a 1% chance. The 6.64-bit entropy reflects the much larger selection space.
Yes, the hash function maps the seed value uniformly across the range $$[0, 1)$$, giving each of the $$N$$ entries equal probability $$1/N$$ of being selected. The fairness depends on the quality of the hash function's distribution, which is approximately uniform for the sinusoidal hash used here.
Number your participants from 1 to N. Enter N as the total entries. For verifiable fairness, choose the seed through a public process (e.g., use tomorrow's stock market closing value, or have someone pick a number). The selected index is the winner's number.
Shannon entropy $$H = \log_2(N)$$ measures the uncertainty of the outcome in bits. One bit equals one binary decision (like a coin flip). Selecting from 32 entries has 5 bits of entropy because $$\log_2(32) = 5$$, equivalent to the information in 5 coin flips.
For multiple selections, run the calculator multiple times with different seeds (e.g., seed, seed+1, seed+2). If you need selections without replacement (no repeats), re-pick if a duplicate occurs. For large groups, the probability of collision is low.
Seed-based selection is transparent, reproducible, and eliminates physical biases (uneven paper sizes, shuffling technique). Anyone can verify the result by entering the same seed and count. It is also scalable to any number of entries without physical materials.
Any positive integer works. For unbiased selection, choose a seed through a process you cannot control (current time, stock price, etc.). Avoid letting someone who benefits from the outcome choose the seed, as they could test seeds beforehand to find a favorable one.
Roboculator Team
The Roboculator Team explains calculations, planning tools, and practical formulas in clear language for real-life situations.
How helpful was this calculator?
Be the first to rate!
