in Quantitative Aptitude edited by
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
in Quantitative Aptitude edited by
13.4k points

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true