One great problem, three kinds of immersion
From a story to your own conjecture
Problem stories open curiosity. The problem workshop is the next place, where curiosity becomes a testable idea.
- 1 · DiscoverMeet the questionLearn when it appeared and why it still holds people’s attention.
- 2 · ChallengeTest one caseMake your first observation in five minutes with a drawing, calculation, or colors.
- 3 · DevelopYou are hereBuild on ideasPublish an observation and grow it through comparisons, conjectures, and counterexamples.
Lehmer's Mahler Measure Problem — The Smallest Value Above 1
Problem
For an integer polynomial , the Mahler measure is . Kronecker's theorem says that an integer polynomial of measure 1 is, up to sign and monomial factors, a product of cyclotomic polynomials. Lehmer (1933) asked whether measures above 1 are uniformly separated from 1.
Why it matters
Lehmer's own candidate (1933) is with . For 90 years no smaller value has been found. A positive gap would tie integer-polynomial roots into a spectrum with deep connections to number theory and dynamics.
Progress so far
Smyth (1971) proved for non-reciprocal polynomials. Dobrowolski (1979) proved the general asymptotic bound . Because it still tends to zero with the degree, it does not supply Lehmer's uniform gap. Mahler measure has deep links to short geodesics in arithmetic hyperbolic manifolds, but not the simple equivalence previously claimed here.
Further reading
💡 Explore together, one line at a time(0 contributions)
Contributions are not ranked by popularity. Curator feedback names what is clear or reproducible, and peer signals mean someone understood or actually reproduced it.
What did you notice?
You do not need a complete proof. A small observation can open the next path.
moderation policy. Sign in after submitting if you want to edit or delete this attempt from another device.