All open problems
Source labels openChecked July 26, 2026

BooksNumber theory

Bugeaud Collection of Conjectures and Open Questions: Fractional Parts of Powers

Waldschmidt [Wal03] conjectured that a stronger result holds, namely that there exists a positive real number~cc such that en>nc\lVert e^n \rVert > n^{-c} for every~n2n \ge 2. This is supported by metrical results [Kok45].

Mathematical statement

Waldschmidt [Wal03] conjectured that a stronger result holds, namely that there exists a positive real number~cc such that en>nc\lVert e^n \rVert > n^{-c} for every~n2n \ge 2. This is supported by metrical results [Kok45].

Note: the bound ncn^{-c} equals 11 when n=1n = 1 for all cc, while the distance to the nearest integer is always at most 1/21/2, so the conjecture must start at n2n \ge 2.

Statement source: Books statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

waldschmidt

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem waldschmidt :     c : , 0 < c   n : , 2  n  (n : ) ^ (-c) < distToNearestInt (Real.exp n) := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References