MathDB

Let us consider a simle graph with vertex set

V

. All ordered pair

(a,b)

of integers with gcd(a,b) \equal{} 1, are elements of V.

(a,b)

is connected to (a,b \plus{} kab) by an edge and to (a \plus{} kab,b) by another edge for all integer k. Prove that for all

(a,b)\in V

, there exists a path fromm

(1,1)

(a,b)

Problem Statement