Problem #PRU-61473

Problems Algebra Algebraic equations and systems of equations Higher order equations. Palindromic polynomial equations Equations of higher order (other) Calculus Real numbers Integer and fractional parts. Archimedean property

Problem

A frog jumps over the vertices of the triangle $A B C$ , moving each time to one of the neighbouring vertices.

How many ways can it get from $A$ to $A$ in $n$ jumps?

To see the solution register and get verified.