UPSC Prelims 2023 CSAT Q54 · Reasoning
40 children are standing in a circle and one of them (say child-1) has a ring. The ring is passed clockwise. Child-1 passes on to child-2, child-2 passes on to child-4, child-4 passes on to child-7 and so on. After how many such changes (including child-1) will the ring be in the hands of child-1 again?
- a14
- b15
- c16
- d17
Show answer & explanationHide answer
After 15 changes, the total number of steps moved is 15 × 16 / 2 = 120, which is an exact multiple of 40 (3 full rounds), bringing the ring back to child-1.
Statement-by-statement analysis
- After 14 changes, total steps moved = 14 × 15 / 2 = 105.
- Dividing 105 by 40 gives a remainder of 25.
- The ring reaches child-26 (1 + 25), not child-1.
- After 15 changes, total steps moved = 15 × 16 / 2 = 120.
- Dividing 120 by 40 gives a remainder of 0.
- Since the remainder is 0, the ring returns exactly to child-1.
- After 16 changes, total steps moved = 16 × 17 / 2 = 136.
- Dividing 136 by 40 gives a remainder of 16.
- The ring reaches child-17 (1 + 16), not child-1.
- After 17 changes, total steps moved = 17 × 18 / 2 = 153.
- Dividing 153 by 40 gives a remainder of 33.
- The ring reaches child-34 (1 + 33), not child-1.
Concept to know
- The step sizes form a simple arithmetic sequence: 1 step, 2 steps, 3 steps, up to n steps for n changes.
- The cumulative total number of steps moved after n changes is given by the formula S = n × (n + 1) / 2.
- In a circle of 40 children, the ring returns to child-1 whenever the total steps moved S is an exact multiple of 40.
- The mathematical condition is n × (n + 1) / 2 = 40 × k, which simplifies to n × (n + 1) = 80 × k, where k is a positive integer.
- To find the minimum n, we test values such that n × (n + 1) is divisible by 80; for n = 15, 15 × 16 = 240, which is 80 × 3.
Related facts for revision
- Circular motion and modular arithmetic (clock math) problems.
- Sum of first n natural numbers and triangular number sequences.
- Least Common Multiple (LCM) application in periodic cyclic events.
- Pattern recognition in progressive step sequence problems.
Mathematical modeling of circular step sequences using modular arithmetic and divisibility rules.
Trap: Candidates often try to write out all steps manually one by one, which is time-consuming and error-prone; using the formula n(n+1)/2 = 40k saves crucial time.
More Reasoning PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.