ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Call a sequence (an)n≥0(a_n)_{n\ge 0} of natural numbers eventually periodic if there exist N≥0N\ge 0 and p≥1p\ge 1 such that an+p=ana_{n+p}=a_n for every n≥Nn\ge N. Call a real number xx algebraic of degree dd if xx is a root of an irreducible polynomial of degree dd with rational coefficients; thus xx is algebraic of degree 11 exactly when x∈Qx\in\mathbb{Q}, algebraic of degree 22 exactly when xx is a quadratic irrational, and algebraic of degree 33 exactly when xx is a cubic irrational.

There exists a map

Φ:R⟶NZ≥0,Φ(x)=(an(x))n≥0,\Phi:\mathbb{R}\longrightarrow \mathbb{N}^{\mathbb{Z}_{\ge 0}},\qquad \Phi(x)=(a_n(x))_{n\ge 0},

computed by a single algorithm whose only input is the real number xx, such that:

  1. Φ\Phi is injective, i.e. each sequence in the image of Φ\Phi determines a unique real number; 2. for every x∈Rx\in\mathbb{R}, the sequence Φ(x)\Phi(x) is eventually periodic if and only if xx is algebraic of degree 33.

More generally, for every integer d≥1d\ge 1 there exists a map Φd:R→NZ≥0\Phi_d:\mathbb{R}\to\mathbb{N}^{\mathbb{Z}_{\ge 0}}, computed by a single algorithm whose only input is xx, such that Φd\Phi_d is injective and, for every x∈Rx\in\mathbb{R}, the sequence Φd(x)\Phi_d(x) is eventually periodic if and only if xx is algebraic of degree dd.

(For d=1d=1 the decimal expansion x=a0.a1a2a3…x=a_0.a_1a_2a_3\ldots, with a0∈Za_0\in\mathbb{Z} the integer part of xx and a1,a2,…∈{0,1,…,9}a_1,a_2,\ldots\in\{0,1,\dots,9\}, has this property, since x=∑n≥0an/10nx=\sum_{n\ge 0}a_n/10^{n} is rational precisely when its digit sequence is eventually periodic; for d=2d=2 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 (x,y)(x,y) a sequence of natural numbers, this sequence is eventually periodic if and only if xx and yy lie in one and the same cubic number field.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.