Math 2.0

Number theory Conjecture

Lehmer's conjecture

Builds on Mahler measureCyclotomic polynomial

Statement

For a nonzero polynomial f∈ℤ[x]f \in \Z[x], let M(f)M(f) be its Mahler measure. There is a constant c>1c > 1 such that M(f)≥cM(f) \ge c for every f∈ℤ[x]f \in \Z[x] with M(f)>1M(f) > 1.

Remarks

The condition M(f)>1M(f) > 1 excludes exactly the polynomials ±xkΦn1⋯Φnr\pm x^k \Phi_{n_1} \cdots \Phi_{n_r} built from cyclotomic polynomials, which have M(f)=1M(f) = 1. The problem goes back to D. H. Lehmer, who asked it in 1933. The conjecture is open. The smallest known value of M(f)>1M(f) > 1 is that of Lehmer's polynomial x10+x9−x7−x6−x5−x4−x3+x+1x^{10} + x^9 - x^7 - x^6 - x^5 - x^4 - x^3 + x + 1, about 1.176281.17628. Smyth proved the conjecture for nonreciprocal polynomials. If f∈ℤ[x]f \in \Z[x] is irreducible of degree dd, f≠±xf \ne \pm x, and xdf(1/x)≠±f(x)x^d f(1/x) \ne \pm f(x), then M(f)≥M(x3−x−1)≈1.3247M(f) \ge M(x^3 - x - 1) \approx 1.3247. Dobrowolski proved a lower bound of the form M(f)≥1+c(log⁡log⁡dlog⁡d)3M(f) \ge 1 + c \left( \frac{\log \log d}{\log d} \right)^3 for an irreducible noncyclotomic ff of degree dd, with an absolute constant c>0c > 0.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cyclotomic polynomial concept
  2. Mahler measure concept
  3. Lehmer's conjecture conjecture

Further reading

  1. Web https://en.wikipedia.org/wiki/Lehmer%27s_conjecture
About this page
TagNDRRH2YD2C
URIm2://NDRRH2YD2C
Kindconjecture
WritingW0 stub
MSC11R06, 11C08
StatusThis copy of the site has no build data. Run m2 status NDRRH2YD2C.
AboutMahler measure
UsesMahler measure, Cyclotomic polynomial
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.