“Hilbert’s problems today”
(April 6, 2001)
Open Diophantine Problems
by
Michel WALDSCHMIDT
Content
§ 1. Diophantine Equations
§ 2. Diophantine Approximation
§ 3. Transcendence
§ 4. Heights
http : //www.math.jussieu.fr/ ∼ miw/articles/ps/odp.ps
2
1. Diophantine Equations Hilbert’s tenth problem:
Given a Diophantine equation with any number of unknown quantities and with integral numeri- cal coefficients: To devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in ra- tional integers.
Open problem:
To answer Hilbert’s tenth problem for the special case of plane curve, which means to give an algorithm to decide whether a given Diophantine equation
f (x, y) = 0
has a solution (in Z , and the same problem for Q ).
Problem. Let f ∈ Z [X, Y ] be a polynomial such that
the equation f (x, y) = 0 has only finitely many so-
lutions (x, y) ∈ Z × Z . Give an upper bound for
max {| x | , | y |} when (x, y) is such a solution, in terms
of the degree of f and of the maximal absolute value
of the coefficients of f .
3
Lettre adress´ee `a l’´ Editeur par Monsieur E. Catalan, R´ep´etiteur `a l’´ecole polytechnique de Paris
ii, published in Crelle Journal (1844):
hh
Je vous prie, Monsieur, de bien vouloir ´enoncer, dans votre recueil, le th´eor`eme suivant, que je crois vrai, bien que je n’aie pas encore r´eussi ` a le d´emontrer compl`e- tement: d’autres seront peut-ˆetre plus heureux:
Deux nombres entiers cons´ecutifs, autres que 8 et
9 , ne peuvent ˆetre des puissances exactes; autrement dit:
l’´equation x m − y n = 1 , dans laquelle les inconnues sont enti`eres et positives, n’admet qu’une seule solution.
iiPerfect powers: 1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, . . . Conjecture (Catalan). The equation
x p − y q = 1,
where the unknowns x, y, p and q are integers all ≥ 2, has only one solution (x, y, p, q) = (3, 2, 2, 3).
R. Tijdeman (1976): only finitely many solutions.
Conjecture (Pillai). Let k be a positive integer. The equation
x p − y q = k,
where the unknowns x, y, p and q are integers all ≥ 2,
has only finitely many solutions (x, y, p, q).
4
The Diophantine equation
x p + y q = z r
has 10 known solutions (x, y, z, p, q, r) in positive inte- gers for which
1
p + 1
q + 1
r < 1
and such that x, y, z are relatively prime:
1 + 2 3 = 3 2 2 5 + 7 2 = 3 4 7 3 + 13 2 = 2 9 2 7 + 17 3 = 71 2 3 5 + 11 4 = 122 2
17 7 + 76271 3 = 21063928 2 1414 3 + 2213459 2 = 65 7 9262 3 + 15312283 2 = 113 7 43 8 + 96222 3 = 30042907 2 33 8 + 1549034 2 = 15613 3 .
R. Tijdeman and D. Zagier Conjecture : there is no
solution with the further restriction that each of p, q
and r is ≥ 3.
5
m
2+ m
21+ m
22= 3mm
1m
2(1, 1, 1)
| (2, 1, 1)
| (5, 1, 2)
|
|
|(29, 5, 2) (13, 5, 1)
| |
| | | |
(433, 29, 5) (169, 29, 2) (194, 13, 5) (34, 13, 1)
..
|. .. .
..
|. .. .
..
|. .. .
..
|. .. .
6
Markoff Spectrum x 2 + y 2 + z 2 = 3xyz Sequence:
1, 2, 5, 13, 29, 34, 89, 169, 194,
233, 433, 610, 985, 1325, 1597, . . .
Conjecture. Fix a positive integer m for which the equa- tion
m 2 + m 2 1 + m 2 2 = 3mm 1 m 2
has a solution in positive integers (m 1 , m 2 ) with 0 < m 1 ≤ m 2 ≤ m.
Then such a pair (m 1 , m 2 ) is unique.
True for m ≤ 10 105 .
Connection with Diophantine Approximation:
µ m = p
9m 2 − 4/m : Sequence:
√ 5, √
8, √
221/5, √
1517/13, . . . lim sup
q →∞
¯ ¯ q(qα m − p) ¯ ¯ = m
√ 9m 2 − 4 ·
7
2. Diophantine Approximation
abc Conjecture (D.W. Masser and J. Œsterl´e, 1987).
For a positive integer n, denote by R(n) = Y
p | n
p
the radical or squarefree part of n.
Conjecture (abc Conjecture). For each ² > 0 there exists a positive number κ(²) which has the following property: if a, b and c are three positive rational inte- gers which are relatively prime and satisfy a + b = c, then
c < κ(²)R(abc) 1+² .
8
Triples (a, b, c) with 0 < a < b < c, a + b = c and gcd(a, b) = 1.
− ◦ −
λ(a, b, c) = log c
log R(abc) ·
(?) Finitely many (a, b, c) with λ(a, b, c) > 1 + ².
Largest known value for λ (´ E. Reyssat):
2 + 3 10 · 109 = 23 5 , λ = 1.629912 . . . 140 known values of λ(a, b, c) which are ≥ 1.4.
− ◦ −
%(a, b, c) = log abc log R(abc) ·
(?) Finitely many (a, b, c) with %(a, b, c) > 3 + ².
Largest known value for % (A. Nitaj):
13 · 19 6 + 2 30 · 5 = 3 13 · 11 2 · 31, % = 4.41901 . . .
46 known triples (a, b, c) with 0 < a < b < c and
gcd(a, b) = 1 satisfying %(a, b, c) > 4.
9
Conjecture (Erd˝os-Woods). There exists a positive in- teger k such that, for m and n positive integers, the conditions
R(m + i) = R(n + i) (i = 0, . . . , k − 1) imply m = n.
Remark: k ≥ 3:
R(75) = 15 = R(1215), R(76) = 2 · 19 = R(1216).
Also m = 2 h − 2, n = 2 h m, n + 1 = (m + 1) 2 R(m) = R(n) and R(m + 1) = R(n + 1) Arithmetic progressions (T.N. Shorey):
(?) Does there exist a positive integer k such that, for any m, n, d and d 0 positive integers satisfying gcd(m, d) = gcd(n, d 0 ) = 1, the conditions
R(m + id) = R(n + id 0 ) (i = 0, . . . , k − 1) imply m = n and d = d 0 ?
Remark: k ≥ 4:
R(2) = R(4) = R(8),
R(2 + 79) = R(4 + 23) = R(9),
R(2 + 2 · 79) = R(4 + 2 · 23) = R(10).
10
Theorem (Thue-Siegel-Roth). For any ² > 0 and any irrational algebraic number α, there is a positive con- stant C (α, ²) > 0 such that, for any rational number
p/q, ¯
¯ ¯
¯ α − p q
¯ ¯
¯ ¯ > C (²) q 2+² ·
Consequence of abc (E. Bombieri, M. Langevin):
¯ ¯
¯ ¯ α − p q
¯ ¯
¯ ¯ > C (²) R(pq )q ² ·
Main Open Problem: Effectivity
(?) Does there exist an algebraic number of degree
≥ 3 with bounded partial quotients?
(?) Does there exist one with unbounded partial quo-
tients?
11
Let ψ (q) be a continuous positive real valued func- tion. Assume that the function qψ(q) is nonincreasing.
Conjecture. Let θ be real algebraic number of degree at least 3. Then inequality
¯ ¯
¯ ¯ θ − p q
¯ ¯
¯ ¯ > ψ(q) q ·
has infinitely many solutions in integers p and q with q > 0 if and only if the integral
Z ∞
1
ψ(x)dx diverges.
Schmidt’s Subspace Theorem
Consequence: finiteness of solutions of the equation x 1 + · · · + x n = 1
where the unknowns are integers (or S -integers) in a number field and no proper subsum vanishes.
Open problem: effective version for n ≥ 3?
12
Waring’s problem (1770):
“Every integer is a cube or the sum of two, three, . . . nine cubes; every integer is also the square of a square, or the sum of up to nineteen such; and so forth. Similar laws may be affirmed for the correspondingly defined numbers of quantities of any like de- gree.”
n = x k 1 + · · · + x k g(k) . I (k) = 2 k + [(3/2) k ] − 2.
Easy to check g(k) ≥ I (k):
3 k = 2 k q + r with 0 < r < 2 k , q = [(3/2) k ] N = 2 k q − 1 = (q − 1)2 k + (2 k − 1)1 k
I (k) = (q − 1) + (2 k − 1)
Known: g(k) = I (k) for 2 ≤ k ≤ 471 600 000.
(?)
° °
° °
° µ 3
2
¶ k °
° °
° ° ≥ 2 · µ 3
4
¶ k
13