Random Student Picker
This random student picker plans a fair rotation for calling on students. Enter your class size and how many students you pick per session to get the number of sessions needed to cover everyone exactly once, the size of the final session, and a rotation plan in the steps. It structures the fairness — draw the actual names from a hat, deck of cards, or shuffled list each session.
How many different students you call on each class.
Sessions to cover everyone
6
- Sessions neededCeiling of class ÷ picks.
- 6
- Picks per session
- 5
- Students in final sessionFinal session is full.
- 5
How it was calculated
- Rotation length: ceil(30 ÷ 5) = 6 sessions to call on everyone once.
- Sessions 1–5: pick 5 students who have not been picked yet this rotation.
- Session 6: the final 5 unpicked students, then start a fresh rotation.
- Draw method: shuffle name cards each session and set picked cards aside until the rotation completes.
How it works
Sessions to cover everyone = ceil(class size ÷ picks per session) — 28 students at 5 picks needs ceil(5.6) = 6 sessions.
The final session holds whatever is left: class size − (sessions − 1) × picks per session.
Removing picked names from the pool until everyone has been called guarantees exactly-once coverage — the classic "draw without replacement" rotation.
Once the pool empties, the rotation restarts, so every student is picked equally often over time.
Worked examples
30 students, 5 picks per class
Sessions = ceil(30 ÷ 5) = 6. Final session: 30 − 5 × 5 = 5 students — every session is full, and after 6 classes everyone has been picked exactly once.
28 students, 5 picks per class
Sessions = ceil(28 ÷ 5) = 6. Final session: 28 − 5 × 5 = 3 students. Five full rounds of 5, then a short final round of 3 before the rotation restarts.
How to measure
- Use the real attendance count, not enrollment — absent students should stay in the pool for next time.
- Pick a per-session number you can sustain; 3–5 keeps the pace lively without eating the lesson.
- Keep picked name-cards in a separate pile so the "without replacement" rule enforces itself.
- Announce the system once ("everyone gets picked before anyone repeats") — perceived fairness matters.
- Restart the rotation immediately after it completes; gaps let students game the order.
Assumptions & limitations
Planning estimate
- This tool plans the rotation structure; it does not select names — use cards, a shuffled list, or a draw app per session.
- Exactly-once coverage assumes no mid-rotation dropouts or additions; roster changes restart the math.
- It models one pick per student per rotation; volunteers and follow-ups are outside the rotation.
- Results are a classroom-organization aid, not a certified randomization method.
Frequently asked questions
Plan the rotation with this tool, then draw without replacement: put every name on a card, shuffle, draw your picks for the session, and set drawn cards aside. When the pile empties, everyone has been picked exactly once — reshuffle and start over.
Apps are convenient, but most pick with replacement, meaning the same eager (or unlucky) student can come up repeatedly. The rotation structure here fixes that: combine any random draw with the without-replacement rule for true fairness.
Return their card to the unpicked pile — they have not really been picked. Do not count the absence as their turn, or quiet students will systematically get fewer turns than the attendance record suggests.
Three to five is the sweet spot for most lessons: enough to keep everyone alert, few enough not to derail the plan. Cold-calling more than that per session tends to turn participation into an interrogation.