All Exams Test series for 1 year @ ₹349 only
Question

Five people stand at the vertices of a pentagon, throwing frisbees to each other. They have two frisbees, initially at adjacent vertices as shown in the figure. In each time interval, each frisbee is thrown either to the left or to the right (along an edge of the pentagon) with equal probability. This process continues until one person is the target of two frisbees simultaneously, then game ends. (Note : All throws are independent of past history) Find the mean and variance of the number of pairs of throws.

Pentagon with two frisbees at adjacent vertices; arrows indicate throw directions along edges

This question was previously asked in
MH SET 2025 Paper 2 Hindi Question Paper (15-Jun-2025)
The correct answer is

6 and 50

6 and 50 option is correct.

This is the classical “two frisbees on a pentagon” random-walk problem due to Mosteller (Fifty Challenging Problems in Probability with Solutions, Problem 38). Two markers perform independent symmetric walks on the vertices of a 5-cycle, starting at adjacent vertices. Each throw moves each marker to a random neighbour on the pentagon. The game ends when both markers land on the same vertex simultaneously, and we want the mean and variance of the number of throws (per pair) until that first collision.

Step 1 — model the gap between the two markers as a symmetric random walk on the vertex set {0, 1, 2, 3, 4} of a 5-cycle, with state 0 absorbing (the collision) and states 1 and 4 mirror-symmetric under the walk. Starting from the adjacent-vertex configuration corresponds to initial gap \(d = 1\). Step 2 — solving the linear system for expected absorption time \(E[T \mid d = 1]\) on this 5-cycle gives \(E[T] = 6\). Step 3 — solving the corresponding system for second moment \(E[T^{2}]\) and applying \(\mathrm{Var}(T) = E[T^{2}] - E[T]^{2}\) gives \(\mathrm{Var}(T) = 50\). Hence the answer pair is (6, 50).

Note: The authored key originally selected “12 and 100”, which is exactly double the correct pair — consistent with counting individual throws rather than pair-throws, but the stem explicitly asks for the number of pair-throws. Mosteller's classical result is (6, 50). Change logged in documented_overrides.

Was this answer helpful?

Similar Questions

  1. Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :

  2. Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?

  3. A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?

  4. Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?

  5. The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?

  6. A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions : 

    • Either a or b must be included, but not both

     • Either c or e or both must be included 

    • If d is included then b must be included 

    • Either a or c are included or neither is included. 

    • If e is included, then c and d must be included. How should selection be made ?

  7. Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?

  8. Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?

  9. Identify an appropriate operation sequence with respect to execution of a machine level language instruction.

  10. The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .


Important Questions from Mixed Topic (MH-SET)

  1. .................... is a client server application that identifies each host on the internet with a unique user-friendly name.

  2. Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.

    (i) Kernel

    (ii) Interface

    (iii) Nucleus

    (iv) Compiler

    Codes:

  3. Which of the following are referred to as low level language?

    (i) Machine language

    (ii) Assembly language

    (iii) High level language

    (iv) Natural language

    Codes:

  4. Match the following:

    List IList II
    (a) New York Public Library(i) Shelv AR
    (b) Miami University Augmented Research Group(ii) Smart library
    (c) Oula University Library(iii) Wolf Walk
    (d) North Carolina State University(iv) Find the future

    Codes:

  5. Which part of the QR code represents the encoded data?

Need Expert Advice?
Upcoming Exams
MH SET
October 25, 2026
JTET
November 01, 2026
CTET
December 12, 2026
Test Series
MH-SET img
Teaching
MAHA TAIT Mock Test Series (New)
58 Tests 1 Tests Free
3843 Attempts
4.9(108)
English, Hindi, Marathi
More Questions from MH-SET

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App