MathDB
gcd (number theory)

Source: Romanian TST 1978, Day 1, P2

September 28, 2018
number theorygreatest common divisorGCDmodular arithmetic

Problem Statement

Suppose that k,l k,l are natural numbers such that gcd⁡(11m−1,k)=gcd⁡(11m−1,l), \gcd (11m-1,k)=\gcd (11m-1, l) , for any natural number m. m. Prove that there exists an integer n n such that k=11nl. k=11^nl.
Back to ProblemsView on AoPS