edited by
660 views
0 votes
0 votes

ABCDEFGH is a regular octagon. A and E are opposite vertices of the octagon. A frog starts jumping from vertex to vertex, beginning from A. From any vertex of the octagon except E, it may jump to either of the two adjacent vertices. When it reaches E, the frog stops and stays there. Let an be the number of distinct paths of exactly n jumps ending in E. Then what is the value of $a_{2n – 1}$? 

  1. Zero 
  2. Four
  3. $2n – 1 $
  4. Cannot be determined
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
go_editor asked Mar 29, 2016
404 views
In the figure above, $\text{AB = BC = CD = DE = EF = FG = GA}.$ Then $\measuredangle \text{DAE}$ is approximately$15^{\circ}$ $20^{\circ}$$30^{\circ}$$25^{\circ}$
0 votes
0 votes
0 answers
3
go_editor asked Mar 29, 2016
394 views
If $a, b, c$ are the sides of a triangle, and $a^2 + b^2 + c^2 = bc + ca + ab$, then the triangle isequilateral isoscelesright angled obtuse angled
0 votes
0 votes
1 answer
5
go_editor asked Mar 29, 2016
1,293 views
$\text{ABCD}$ is a rhombus with the diagonals $\text{AC}$ and $\text{BD}$ intersecting at the origin on the $x-y$ plane. The equation of the straight line $\text{AD}$ is ...