Hermite's problem
Hermite's problem
Call a sequence of natural numbers eventually periodic if there exist and such that for every . Call a real number algebraic of degree if is a root of an irreducible polynomial of degree with rational coefficients; thus is algebraic of degree exactly when , algebraic of degree exactly when is a quadratic irrational, and algebraic of degree exactly when is a cubic irrational.
There exists a map
computed by a single algorithm whose only input is the real number , such that:
- is injective, i.e. each sequence in the image of determines a unique real number; 2. for every , the sequence is eventually periodic if and only if is algebraic of degree .
More generally, for every integer there exists a map , computed by a single algorithm whose only input is , such that is injective and, for every , the sequence is eventually periodic if and only if is algebraic of degree .
(For the decimal expansion , with the integer part of and , has this property, since is rational precisely when its digit sequence is eventually periodic; for the simple continued fraction expansion has this property.)
A related two-dimensional formulation: for the multidimensional continued fraction algorithm that assigns to each pair of real numbers a sequence of natural numbers, this sequence is eventually periodic if and only if and lie in one and the same cubic number field.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Additional references
- Wikipedia, Hermite's problem, the article this problem comes from.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.