# Jumpy, Patient Frog Named Sally And A Math Problem About Her Life-I

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 $$124356$$ moves?

Note: Sally is allowed to land on C during the intermediate steps.

As a little bonus, can you generalise for $$n$$ jumps?

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

×