A frog, namely, Sally, is jumping about the vertices of a hexagon, \(ABCDEF\) , each time jumping to an adjacent vertex. In how many ways can she get from \(A\) to \(C\) in \(212\) moves, assuming that there is some plutonium on \(D\) and Sally cannot jump there?

As a bonus, can you generalise for \(n\) jumps?

This problem is a part of my froggy, soggy set.

×

Problem Loading...

Note Loading...

Set Loading...