A and B alternately throw a pair of dice. A wins if he throws a sum of 5 before B throws a sum of 8, and B wins if he throws a sum of 8 before A throws a sum of 5. The probability, that A wins if A makes the first throw, is :

Solution & Explanation

### Related Formula For alternating multi-stage games continuing indefinitely, the total probability of winning is modeled as an infinite geometric series summation: S_infty = fraca1 - r ### Core Logic First, analyze the total sample outcomes for a pair of standard dice (n(S) = 36): - Outcomes giving a sum of 5: (1,4), (2,3), (3,2), (4,1) implies 4 outcomes. p(A) = frac436 = frac19 implies p(A') = 1 - frac19 = frac89 - Outcomes giving a sum of 8: (2,6), (3,5), (4,4), (5,3), (6,2) implies 5 outcomes. p(B) = frac536 implies p(B') = 1 - frac536 = frac3136 ### Step 1: Setup Infinite Game Series Path For player A to win on the first throw, third throw, fifth throw, etc., the probability sequence expands as follows: P(textA wins) = p(A) + p(A') cdot p(B') cdot p(A) + [p(A') cdot p(B')]^2 cdot p(A) + dots infty This is a geometric progression where the first term a = p(A) = frac19 and the common ratio is: r = p(A') cdot p(B') = frac89 cdot frac3136 = frac6281 ### Step 2: Calculate Invariant Sum Apply the infinite GP sum formula directly: P(textA wins) = fracfrac191 - frac6281 = fracfrac19frac1981 = frac19 cdot frac8119 = frac919 ### Pattern Recognition In infinite alternating games, player A's net probability can always be abbreviated shortcut-style to fracp_11 - (1-p_1)(1-p_2), where p_1 is A's success probability and p_2 is B's success probability. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Probability

Reference Study Guides

More Probability Previous-Year Questions — Page 6

Q19 jee_main_2024_31_jan_morning Variance of Random Variable
Three rotten apples are accidently mixed with fifteen good apples. Assuming the random variable X to be the number of rotten apples in a draw of two apples, the variance of X is
  • A. frac37153
  • B. frac57153
  • C. frac47153
  • D. frac40153

Solution

### Core Logic Total apples = 18 (3 rotten, 15 good). Random variable X = \0, 1, 2\ representing the number of rotten apples. ### Step 1: Probability Distribution P(X = 0) = frac^15C_2^18C_2 = frac105153 P(X = 1) = frac^3C_1 times ^15C_1^18C_2 = frac45153 P(X = 2) = frac^3C_2^18C_2 = frac3153 ### Step 2: Expectation E(X) = 0 times frac105153 + 1 times frac45153 + 2 times frac3153 = frac51153 = frac13 ### Step 3: Variance E(X^2) = 0 times frac105153 + 1 times frac45153 + 4 times frac3153 = frac57153 Var(X) = E(X^2) - (E(X))^2 = frac57153 - left(frac13right)^2 = frac57153 - frac17153 = frac40153 ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Maths: Probability

More Probability Questions — jee_main_2025_24_jan_morning

Practice all Probability previous-year questions →

Rankbit System
JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%) | JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%)