---
title: "Expected tosses until a six"
subject: "Probability and Statistics"
chapter: 2
key: "semester_5/probability_and_statistics:fair-die-expected-tosses-six"
source: https://www.bctengineer.com/q/semester_5/probability_and_statistics/fair-die-expected-tosses-six
site: BCT Engineering
---

# Expected tosses until a six

Probability and Statistics · Chapter 2: Discrete Probability Distribution

- Asked in: 2075 Chaitra, 5 marks
- Video: [How many times must you roll a die  to get a six?](https://www.youtube.com/watch?v=xH89DaEI35w) — Visually Explained
- Answer checked by Claude Sonnet 5.5 on 2026-10-14
- Page: https://www.bctengineer.com/q/semester_5/probability_and_statistics/fair-die-expected-tosses-six
- Whole chapter: https://www.bctengineer.com/md/semester_5/probability_and_statistics/chapter-2

## Question

A fair dice was rolled until one gets a Six; find the expected number of toss required?

## Short answer

The number of tosses until a six follows a geometric distribution with p=1/6, so expected value = 1/p = 6 tosses.

## Answer

Let X be the number of tosses needed to get the first six. Each toss is an independent trial with success probability p = 1/6, so X follows a **geometric distribution**:

P(X = x) = q^(x−1) p = (5/6)^(x−1) (1/6), x = 1, 2, 3, …

#### Expected value
E(X) = Σ x · q^(x−1) p = p (1 + 2q + 3q² + …) = p · 1/(1 − q)² = p / p² = 1/p

E(X) = 1 / (1/6) = **6**

Variance (for reference) = q/p² = (5/6)/(1/36) = 30.

**Answer: on average 6 tosses are required to get a six.**

## Check yourself

The answer's key points as multiple-choice questions, with the correct option and why.

1. Which distribution models tosses until the first six?
   A. Binomial
   B. Geometric
   C. Poisson
   D. Hypergeometric
   Answer: B. Independent trials, p = 1/6, count until first success. (Key point: Distribution)

2. What is E(X) for geometric?
   A. 1/p
   B. q/p
   C. np
   D. p
   Answer: A. E(X) = 1/p = 6. (Key point: Expected value)

3. Expected tosses to get a six?
   A. 5
   B. 6
   C. 1/6
   D. 36
   Answer: B. 1/(1/6) = 6. (Key point: Answer)

## Related in Probability and Statistics

- [Hypergeometric: 3 batteries from 24](https://www.bctengineer.com/question.md?key=semester_5%2Fprobability_and_statistics%3Abatteries-3-of-24-defect) — Probability and Statistics, chapter 2, asked 4×
- [Distribution of defectives drawn from ten](https://www.bctengineer.com/question.md?key=semester_5%2Fprobability_and_statistics%3Adefective-items-three-drawn-distribution) — Probability and Statistics, chapter 2
- [ANOVA: thiamin content of four cereals](https://www.bctengineer.com/question.md?key=semester_5%2Fprobability_and_statistics%3Aanova-cereal-thiamin) — Probability and Statistics, chapter 6
- [Twists regression; CI for slope](https://www.bctengineer.com/question.md?key=semester_5%2Fprobability_and_statistics%3Atwists-regression-with-ci-slope) — Probability and Statistics, chapter 5, asked 3×
- [Twists regression; predict at 20%](https://www.bctengineer.com/question.md?key=semester_5%2Fprobability_and_statistics%3Atwists-regression-predict-20) — Probability and Statistics, chapter 5, asked 3×
- [Bus ticket counter: mean, SD, CV, CI](https://www.bctengineer.com/question.md?key=semester_5%2Fprobability_and_statistics%3Abus-ticket-passengers-mean-cv-ci) — Probability and Statistics, chapter 6

## Related in other subjects

- [Number of additional rain gauges required](https://www.bctengineer.com/question.md?key=semester_5%2Fengineering_hydrology%3Aoptimum-raingauges-7stn) — Engineering Hydrology, chapter 2
- [Sum of digits until single digit](https://www.bctengineer.com/question.md?key=semester_1%2Fcomputer_programming%3Adigit-sum-single-digit) — Computer Programming, chapter 5, asked 2×
- [Read records until end; show nth record](https://www.bctengineer.com/question.md?key=semester_1%2Fcomputer_programming%3Afile-worker-nth-record) — Computer Programming, chapter 10, asked 2×
- [Count even and odd until -1](https://www.bctengineer.com/question.md?key=semester_1%2Fcomputer_programming%3Acount-even-odd-until-minus1) — Computer Programming, chapter 5
