MathDB
Nice oNE

Source: IBEROAMERICAN 2004, Problem 3

September 22, 2004
modular arithmeticinductionquadraticsfunctionnumber theory unsolvednumber theory

Problem Statement

Let n n and k k be positive integers such as either n n is odd or both n n and k k are even. Prove that exists integers a a and b b such as GCD(a,n) \equal{} GCD(b,n) \equal{} 1 and k \equal{} a \plus{} b