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 a(n) be the number of distinct paths of exactly n jumps ending in E. Then what is the value of a(2n – 1)?
1
Expert's answer
2011-08-19T14:59:02-0400
Firstly, notice that the shortest path from A to E involves exactly 4 jumps. 4 is even number. We can prove that the frog always makes even number of jumps to reach vertex E. Assume we have some path from A to E. If at some vertex our path turns back then later it must turn back again, so this vertex is visited twice. Such way the evenness of length of the path can't be corrupted. Thus, any possible path has even length. Since (2n-1) is odd, there is no path from A to E that frog can follow for (2n-1) jumps. Thus, a(2n-1) = 0 ANSWER A(2n-1) = 0
Numbers and figures are an essential part of our world, necessary for almost everything we do every day. As important…
APPROVED BY CLIENTS
Finding a professional expert in "partial differential equations" in the advanced level is difficult.
You can find this expert in "Assignmentexpert.com" with confidence.
Exceptional experts! I appreciate your help. God bless you!
Comments
You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!
nice and simple way of explanation.... thanx
Leave a comment