self Maths Puzzle

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?

Read Solution (Total 1)

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)
8 years agoHelpfull: Yes(0) No(0)

self Other Question

Three business entities X Ltd, Y Ltd. and Z Ltd, with 4, 3 and 5 employees respectively, merged into XYZ Ltd in order to jointly raise the capital for setting up a new modern production plant in Jaipur. After two years, on the question of management decisions on the new venture at Jaipur, the employees started adopting differing viewpoints and began to quarrel among themselves. Given the fact that there is no quarrel among the employees of the erstwhile (i.e. former) X Ltd, Y Ltd and Z Ltd, what could be the maximum number of quarrels that can take place within XYZ Ltd?
Firoz has a certain amount of money in only Re 1 and Rs 10 notes. The number of Re 1 notes multiplied by the number of Rs 10 notes is equal to the total money (in Rs) that he has. The number of Rs 10 notes is less than ten. Which of the following is a possible figure for the total number of notes he can have?