• Placement Papers
• /
• self

self Question Papers:

(#M40020521) SELF question Keep an EYE

PQRSTU is a regular hexagon drawn on the ground. Prashant stands at P and he starts jumping from vertex to vertex beginning from P. From any vertex of the hexagon except S, which is opposite to A, he may jump to any adjacent vertices. When he reaches S, he stops. Let Sn be the number of distinct paths of exactly n jumps ending at S. What is the value of S2k, where k is an integer?

(10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (1)   (2) Submit Your Solution

Read Solution (1) :

RAHUL AGARWAL  (8 years ago)

The least number of jumps required to reach S without any backtracking is 3. if there is back tracking, the number of jumps required to reach S is always odd.
Whenever the number of jumps is even, there is no paths to reach S.
Since '2k' is even . S2k=0 (ans)

Is this solution Helpfull? Yes | No   

Please Login to Read Solution.