Skip to main content
OlympiadHQ

Browse · MathNet

Print

IRL_ABooklet_2023

Ireland 2023 number theory

Problem

For any two numbers , we denote .

a. Prove the product formula .

b. Show that the equation has at least 16 distinct solution triples with integers .
Solution
a. The formula in part (a) can be checked by direct calculation Alternatively, we may let be the complex roots of the quadratic , so that , as well as , and . Then obtained by multiplying the first and third brackets, and second with fourth brackets. Now using and we get

b. To solve (b) we note that , hence, for any solution triple we have and so . If then . Thus . Writing and , we would like to solve It is easy to find the following four non-negative solutions, see Problem 21: (u, v) = (1, 3), (2, 3), (3, 1), (3, 2), giving rise to *(x, y) = (3, 9), (6, 9), (9, 3), (9, 6).

If then . We first solve , , , and then use the formula from part (a) to construct solutions to . Because the numbers are small, we easily find positive solutions: is equivalent to which has solutions ; is equivalent to which has solutions ; is equivalent to which has solutions . Applying the formula from part (a) we obtain, for example, By symmetry we have , hence . Applying the formula from part (a) again, we find Using symmetry, we get eight solutions with : Finally, if then and we can look for solutions . This leads us to solve for which we earlier found four solutions and their symmetric counterparts. This leads to four solutions with : Altogether we found 16 different solution triples, as required.
Final answer
Part (a): N(a, b) N(x, y) = N(ax − by, ay + bx − by). Part (b): Sixteen distinct nonnegative integer solutions (x, y, z) include: - z = 2: (3, 9, 2), (6, 9, 2), (9, 3, 2), (9, 6, 2) - z = 1: (4, 41, 1), (41, 4, 1), (31, 44, 1), (44, 31, 1), (44, 13, 1), (13, 44, 1), (37, 41, 1), (41, 37, 1) - z = 0: (17, 51, 0), (51, 17, 0), (34, 51, 0), (51, 34, 0)

Techniques

Quadratic fieldsTechniques: modulo, size analysis, order analysis, inequalitiesComplex numbers