Maths Olympiad Prep

Library / /1322 of 1394

, 2015

Number theory Difficulty 6.1 National Olympiad Prove it United States

Problem:
Find all ordered 4-tuples of integers (a,b,c,d)(a, b, c, d) (not necessarily distinct) satisfying the following system of equations:

a2b2c2d2=cb22ab=ad322ac=28ad2ad=b+c+31 \begin{aligned} a^{2}-b^{2}-c^{2}-d^{2} & = c-b-2 \\ 2 a b & = a-d-32 \\ 2 a c & = 28-a-d \\ 2 a d & = b+c+31 \end{aligned}

Solution

Solution:
Solution 1. Subtract the second equation from the third to get a(cb+1)=30a(c-b+1)=30. Add the second and third to get 2a(b+c)=42d2 a(b+c)=-4-2 d. Substitute into the fourth to get
2a(2ad31)=42da(312ad)=2+dd=31a22a2+1 2 a(2 a d-31)=-4-2 d \Longleftrightarrow a(31-2 a d)=2+d \Longleftrightarrow d=\frac{31 a-2}{2 a^{2}+1}
which in particular gives a≢1(mod3)a \not \equiv 1(\bmod 3). Then plugging in a factor of 30 for aa gives us the system of equations b+c=2ad31b+c=2 a d-31 and cb+1=30/ac-b+1=30 / a in b,cb, c. Here, observe that b+cb+c is odd, so cb+1c-b+1 is even. Thus aa must be odd (and from earlier a≢1(mod3)a \not \equiv 1(\bmod 3) ), so a{1,±3,5,±15}a \in\{-1, \pm 3,5, \pm 15\}. Manually checking these, we see that the only possibilities we need to check are (a,d)=(5,3),(1,11),(3,5)(a, d)=(5,3),(-1,-11),(-3,-5), corresponding to (b,c)=(3,2),(11,20),(5,6)(b, c)=(-3,2),(11,-20),(5,-6). Then check the three candidates against first condition a2b2c2d2=cb2a^{2}-b^{2}-c^{2}-d^{2}=c-b-2 to find our only solution (a,b,c,d)=(5,3,2,3)(a, b, c, d)=(5,-3,2,3).

Solution 2. Here's an alternative casework solution. From 2ad=b+c+312 a d=b+c+31, we have that b+cb+c is odd. So, bb and cc has different parity. Thus, b2+c21(mod4)b^{2}+c^{2} \equiv 1(\bmod 4). Plugging this into the first equation, we get that aa and dd also have the same parity.
So, a2b2c2d21(mod4)a^{2}-b^{2}-c^{2}-d^{2} \equiv-1(\bmod 4). Thus, cb21(mod4)c-b-2 \equiv-1(\bmod 4). So, cb+1(mod4)c \equiv b+1(\bmod 4).
From taking modulo aa in the second and third equation, we have ad+32a \mid d+32 and a28da \mid 28-d. So, a60a \mid 60.
Now, if aa is even, let a=2ka=2 k and d=2md=2 m. Plugging this in the second and third equation, we get 2kc=14km2 k c=14-k-m and 2kb=km162 k b=k-m-16. So, k(cb)=15kk(c-b)=15-k.
We can see that k0k \neq 0. Therefore, cb=15kk=15k1c-b=\frac{15-k}{k}=\frac{15}{k}-1.
But cb1(mod4)c-b \equiv 1(\bmod 4). So, 15k11(mod4)\frac{15}{k}-1 \equiv 1(\bmod 4), or 15k2(mod4)\frac{15}{k} \equiv 2(\bmod 4) which leads to a contradiction.
So, aa is odd. And we have a60a \mid 60. So, a15a \mid 15. This gives us 8 easy possibilities to check...

Solution 3. The left hand sides clue us in to the fact that this problem is secretly about quaternions. Indeed, we see that letting z=a+bi+cj+dkz=a+b i+c j+d k gives
(zi+j)z=232i+28j+31k (z-i+j) z=-2-32 i+28 j+31 k
Taking norms gives N(zi+j)N(z)=22+322+282+312=2773=4759N(z-i+j) N(z)=2^{2}+32^{2}+28^{2}+31^{2}=2773=47 \cdot 59. By the triangle inequality, N(z),N(zi+j)N(z), N(z-i+j) aren't too far apart, so they must be 47,59 (in some order).
Thus z,zi+jz, z-i+j are Hurwitz primes. We rely on the following foundational lemma in quaternion number theory:

Lemma. Let pZp \in \mathbb{Z} be an integer prime, and AA a Hurwitz quaternion. If pN(A)p \mid N(A), then the HA+Hp\mathbb{H} A+\mathbb{H} p (a left ideal, hence principal) has all element norms divisible by pp, hence is nontrivial. (So it's either Hp\mathbb{H} p or of the form HP\mathbb{H} P for some Hurwitz prime PP.)

In our case, it will suffice to apply the lemma for A=232i+28j+31kA=-2-32 i+28 j+31 k at primes p=47p=47 and q=59q=59 to get factorizations (unique up to suitable left/right unit multiplication) A=QPA=Q P and A=PQA=P' Q' (respectively), with P,PP, P' Hurwitz primes of norm pp, and Q,QQ, Q' Hurwitz primes of norm qq. Indeed, these factorizations come from HA+Hp=HP\mathbb{H} A+\mathbb{H} p=\mathbb{H} P and HA+Hq=HQ\mathbb{H} A+\mathbb{H} q=\mathbb{H} Q'.

We compute by the Euclidean algorithm:
HA+H(47)=H(232i+28j+31k)+H(47)=H(2+15i19j16k)+H(47)=[H(4718)+H(47)(215i+19j+16k)]2+15i19j16k4718=[H18+H(2+3i+j2k)]2+15i19j16k18=H(2+3i+j2k)2+15i19j16k18=H5490i+54j36k18=H(35i+3j2k). \begin{aligned} \mathbb{H} A+\mathbb{H}(47) & =\mathbb{H}(-2-32 i+28 j+31 k)+\mathbb{H}(47) \\ & =\mathbb{H}(-2+15 i-19 j-16 k)+\mathbb{H}(47) \\ & =[\mathbb{H}(47 \cdot 18)+\mathbb{H}(47)(-2-15 i+19 j+16 k)] \frac{-2+15 i-19 j-16 k}{47 \cdot 18} \\ & =[\mathbb{H} 18+\mathbb{H}(-2+3 i+j-2 k)] \frac{-2+15 i-19 j-16 k}{18} \\ & =\mathbb{H}(-2+3 i+j-2 k) \frac{-2+15 i-19 j-16 k}{18} \\ & =\mathbb{H} \frac{-54-90 i+54 j-36 k}{18} \\ & =\mathbb{H}(-3-5 i+3 j-2 k) . \end{aligned}
Thus, there's a unit ϵ\epsilon such that P=ϵ(35i+3j2k)P=\epsilon(-3-5 i+3 j-2 k).

Similarly, to get PP', we compute
AH+47H=(232i+28j+31k)H+47H=(2+15i19j16k)H+47H=2+15i19j16k4718[(4718)H+47(215i+19j+16k)H]=2+15i19j16k18[18H+(2+3i+j2k)H]=2+15i19j16k18(2+3i+j2k)H=54+18i+18j+108k18H=(3+i+j+6k)H, \begin{aligned} A \mathbb{H}+47 \mathbb{H} & =(-2-32 i+28 j+31 k) \mathbb{H}+47 \mathbb{H} \\ & =(-2+15 i-19 j-16 k) \mathbb{H}+47 \mathbb{H} \\ & =\frac{-2+15 i-19 j-16 k}{47 \cdot 18}[(47 \cdot 18) \mathbb{H}+47(-2-15 i+19 j+16 k) \mathbb{H}] \\ & =\frac{-2+15 i-19 j-16 k}{18}[18 \mathbb{H}+(-2+3 i+j-2 k) \mathbb{H}] \\ & =\frac{-2+15 i-19 j-16 k}{18}(-2+3 i+j-2 k) \mathbb{H} \\ & =\frac{-54+18 i+18 j+108 k}{18} \mathbb{H} \\ & =(-3+i+j+6 k) \mathbb{H}, \end{aligned}
so there's a unit ϵ\epsilon' with P=(3+i+j+6k)ϵP'=(-3+i+j+6 k) \epsilon'.

Finally, we have either z=ϵ(35i+3j2k)z=\epsilon(-3-5 i+3 j-2 k) for some ϵ\epsilon, or zi+j=(3+i+j+6k)ϵz-i+j=(-3+i+j+6 k) \epsilon' for some ϵ\epsilon'. Checking the 24+2424+24 cases (many of which don't have integer coefficients, and can be ruled out immediately) gives z=iP=53i+2j+3kz=i P=5-3 i+2 j+3 k as the only possibility.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.