Number Theory – Solution Verification for RMO

contest-mathdivisibilityelementary-number-theorymodular arithmetic

Let N be the set of all positive integers and $S={(a,b,c,d)\in N^4: a^2+b^2+c^2=d^2}$. Find the largest positive integer m such that m
divides abcd for all (a,b,c,d) \in S (RMO Problem 1: 29 Oct, 2023)

For $a=b=2,c=1,d=3$:
$$a^2+b^2+c^2=2^2+2^2+1^2=9=3^2=d^2\Rightarrow abcd=12\Rightarrow m\leq12$$

abcd is divisible by 3 (working mod 3)
If $a^2,b^2,c^2,d^2$ are not divisible by 3, then each can only be 1 (a perfect square can only be 0 or 1)
$$RHS=d^2\equiv1, LHS=a^2+b^2+c^2\equiv1+1+1\equiv3\equiv0\Rightarrow contradiction$$

abcd is divisible by 4 (working mod 4)
If $a^2,b^2,c^2,d^2$ are not divisible by 4, then each can only be 1 (a perfect square can only be 0 or 1)
$$RHS=d^2\equiv1, LHS=a^2+b^2+c^2\equiv1+1+1\equiv3\equiv0\Rightarrow contradiction$$

Since abcd is divisible by 3 and also by 4, it is divisible by $LCM(3,4)=12$.Hence:
$$m\geq12$$

Combine $m\leq12$ and $m\geq12$ to get
$$m=12$$

Best Answer

Update: When considering the equation $a^2+b^2+c^2=d^2$ modulo $4$, you use the fact that squares are congruent to 0 or 1 modulo 4: every even number squares to be 0 modulo 4, and every odd number squares to be congruent to 1 modulo 4.

Showing $a^2,b^2,c^2$ and $d^2$ cannot all be 1 mod 4 thus only shows one of $a^2,b^2,c^2,d^2$ is divisible by $4$, or equivalently one of $a,b,c,d$ is even (i.e. divisible by $2$).

You need to argue that at least two of $a,b,c,d$ must be even. This just requires refining the analysis you have already done though!