A probability problem by A Former Brilliant Member
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?
The answer is 0.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!