MathDB
stubborn numbers

Source: Vietnam TST 2000

April 2, 2007
number theory proposednumber theory

Problem Statement

Let a,b,ca, b, c be pairwise coprime natural numbers. A positive integer nn is said to be stubborn if it cannot be written in the form n=bcx+cay+abzn = bcx+cay+abz, for some x,y,zāˆˆN.x, y, z \in\mathbb{ N}. Determine the number of stubborn numbers.
Back to ProblemsView on AoPS