ab+bc+ca=0, u^2+3v^2 integers
Source: French MO 2001
April 9, 2021
number theory3D geometryalgebracomplex numbers
Problem Statement
A trio is any triple of nonzero real numbers satisfying . A triple is said to be reduced if .[hide=Part 1]
We denote by the set of points in coordinate space for which is a trio, and by the set of those for which is a reduced trio. Let be the origin and be the plane given by .(a) Does there exist a trio such that ?
(b) Prove that is a union of lines passing through , with excluded.
(c) Prove that is the intersection of a plane and a sphere with center . Describe geometrically.
(d) Describe geometrically and sketch it.
(e) Let be a fixed point in . If and are arbitrary points on , prove that the volume of the tetrahedron is maximal when the lines are orthogonal, and express the coordinates of and in terms of those of .
(f) Prove that the product attains its maximum and minimum values on , and find the points at which those are attained.[hide=Part 2]
A trio is called rational if are rational, and integer if are integers. We say that an integer trio is primitive if the greatest common divisor of is .(a) Describe the set of points such that is a trio. Show that the point is the center of symmetry of . Find all points of with integer coordinates.
(b) For each nonzero integer , denote by the set of integer trios with . Determine for and
(c) Prove that is a finite set and find the number of its elements in terms of the number of divisors of in . Prove that divides .
(d) For every positive integer , denote by the number of integer trios such that at least one of is equal to . Express in terms of depending on the parity of .
(e) Prove that every integer trio can be assigned a triple of integers such that and are coprime, is nonnegative, and
State and verify the converse. For which trios is the triple not unique?
(f) Determine all triples that are assigned to some primitive trios. Deduce that if is a primitive trio, then , , and are perfect squares.
(g) For each positive integer , denote by the number of primitive trios with . Prove that is a power of . For which is ? Give a sequence of integers for which the sequence converges to zero.
(h) Let be a trio. Show that there exist sequence , and converging respectively to , and such that is a rational trio for all .
(i) Let be a reduced trio. Show that there exist sequence , and converging respectively to , and such that is a rational reduced trio for all .[hide=Part 3]
Denote . For each trio we define , and .(a) Express the modulus of as a function of . Can we have ? Compute the sine and the cosine of the argument of in terms of .
(b) Let be a given nonzero complex number. Find all trios such that .
(c) Given trios and , prove that there is a unique trio, to be denoted as , satisfying and . Compute in terms of and . What can be said about the argument of ? What can be said about ?
(d) If and are reduced trios, is ? The same question if the word ”reduced” is replaced by ”integer” and by ”primitive”.
(e) Compare the trios and ; and , and .
(f) Given trios and , solve the equation in .
(g) Given a trio , define the sequence of trios by and . Calculate . Given an integer , find all for which .[hide=Part 4]
Denote by the set of integers that are of the form , where are integers. Denote by the set of nonzero complex numbers , where are integers (note that ). Denote by the set of nonzero integers of the form , where are integers.(a) Prove that a product of two elements of belongs to , and that a product of two elements of belongs to .
(b) Show that if is a prime number, then or .
(c) Prove that (you may note that ).
(d) Prove that every even element of is divisible by and that its quarter belongs to ; then prove that each element of is the product of a power of and an odd element of .
(e) i. Suppose that there is an odd integer , where are coprime integers, and there exists a prime divisor of not belonging to . Prove that there exists the smallest positive integer such that is in , and that is odd.
ii. Verify the existence of integers less than in absolute value such that and are divisible by . Prove that divides the nonzero number and hence that .
iii. Verify the existence of coprime nonzero integers such that .
iv. Verify the existence of integers less than in absolute value such that and are divisible by . Prove that divides the nonzero integer which we’ll denote by .
v. Deduce that such an integer cannot exist (you may consider the number ).
(f) Prove that every element of can be written in the form , where is a positive integer and distinct prime factors of .
(g) i. Let be a prime number with , and the set of triples of integers with such that . Prove that has exactly elements and that the number of those with not equal is divisible by .
(h) Let be the set of integers for which there is an integer trio satisfying and . Prove, using question (e) of part , that every element of has a prime divisor in . Conversely, what can be said about the nonzero integers having a prime divisor in ?
(i) Find the elements of between and inclusive.