Maths Olympiad Prep

Library / /242 of 520

Number theory Difficulty 6.9 National olympiad Prove it

Let A={a2+13b2a,bZ,b0}A=\{a^2+13b^2 \mid a,b \in\mathbb{Z}, b\neq0\}. Prove that there
a) exist
b) exist infinitely many
x,yx,y integer pairs such that x13+y13Ax^{13}+y^{13} \in A and x+yAx+y \notin A.

(proposed by B. Bayarjargal)

Solution

To prove the existence of infinitely many integer pairs (x,y)(x, y) such that x13+y13Ax^{13} + y^{13} \in A and x+yAx + y \notin A, we will proceed as follows:

1. **Understanding the Set AA**:
The set AA is defined as A={a2+13b2a,bZ,b0}A = \{a^2 + 13b^2 \mid a, b \in \mathbb{Z}, b \neq 0\}. This means that any element in AA can be written as a2+13b2a^2 + 13b^2 for some integers aa and bb with b0b \neq 0.

2. Quadratic Residue Condition:
For xAx \in A, 13-13 must be a quadratic residue modulo xx. This can be expressed using the Legendre symbol (13x)=1\left(\frac{-13}{x}\right) = 1. Using quadratic reciprocity, we know that (13p)=1\left(\frac{13}{p}\right) = 1 if and only if p1,3,4,9,10,12(mod13)p \equiv 1, 3, 4, 9, 10, 12 \pmod{13} or p=2p = 2.

3. **Legendre Symbol for 13-13**:
Similarly, (13p)=1\left(\frac{-13}{p}\right) = 1 if and only if p1,7,9,11,15,17,19,29,31,35,47,49(mod52)p \equiv 1, 7, 9, 11, 15, 17, 19, 29, 31, 35, 47, 49 \pmod{52} or p=2p = 2.

4. **Finding xx and yy**:
We need to find xx and yy such that x+yx + y is not in the set of numbers where 13-13 is a quadratic residue modulo 5252, but x13+y13x^{13} + y^{13} is in AA.

5. **Choosing xx and yy**:
Let xx be odd and yy be even. This ensures that x+yx + y is odd. We need to ensure that x+yx + y is not one of the numbers where 13-13 is a quadratic residue modulo 5252.

6. **Checking x13mod52x^{13} \mod 52**:
For an odd xx, x13x(mod52)x^{13} \equiv x \pmod{52}. For an even yy, if 4y4 \nmid y, then y13≢y(mod52)y^{13} \not\equiv y \pmod{52}. For example, 21328(mod52)2^{13} \equiv 28 \pmod{52}.

7. Example:
Let x3(mod52)x \equiv 3 \pmod{52} and y2(mod52)y \equiv 2 \pmod{52}. Then:
x13+y13313+2133+2831(mod52) x^{13} + y^{13} \equiv 3^{13} + 2^{13} \equiv 3 + 28 \equiv 31 \pmod{52}
Since 3131 is in the set of numbers where 13-13 is a quadratic residue modulo 5252, x13+y13Ax^{13} + y^{13} \in A.

8. Ensuring Infinitely Many Pairs:
We can generalize this by considering x=3+52mx = 3 + 52m and y=2+52ny = 2 + 52n for integers mm and nn. This ensures that there are infinitely many such pairs (x,y)(x, y).

9. Conclusion:
Therefore, there exist infinitely many integer pairs (x,y)(x, y) such that x13+y13Ax^{13} + y^{13} \in A and x+yAx + y \notin A.

\blacksquare

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.