MathDB
Spring 2020 Team Round Problem 2

Source:

January 3, 2021

Problem Statement

In tetrahedron ABCD,ABCD, as shown below, compute the number of ways to start at A,A, walk along some path of edges, and arrive back at AA without walking over the same edge twice. [Insert Diagram] Proposed by Richard Chen
Back to ProblemsView on AoPS