Skip to content / Đến nội dung
ThichHocToan.com

VN TST 2000 Question 4

VMO · VN TST 2000

Question 4

Let $a,b,c$ be pairwise coprime positive integers. A positive integer $n$ is called “stubborn” if it cannot be written as $n=abx+bcy+caz$ with positive integers $x,y,z$. How many stubborn numbers are there?