Welcome to destall.com on July 11 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Lehmer's conjecture

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Lehmer's conjecture, also known as the Lehmer Mahler measure problem, is a problem in number theory. Derrick Henry Lehmer conjectured that the Mahler measure of any integral polynomial

P(x),

that is not a multiple of cyclotomic polynomials, is bounded below.

More specifically

M_1(P(x))\geq M_1(x^{10}-x^9+x^7-x^6+x^5-x^4+x^3-x+1)=1.17\dots\,.

Essentially, to disprove this conjecture, one would try to find a polynomial

P(x)=a_0 (x-\alpha_1)(x-\alpha_2)\cdots(x-\alpha_n)=a_0 x^n+a_1 x^{n-1}+\cdots+a_n

with a_i \in \mathbb{Z} (each coefficient is an integer), such that

a_0 \prod_{i=1}^{n} \max(1,|\alpha_i|)

is minimized, and where P(x) is not divisible by

x^m+x^{m-1}+\cdots+x+1\text{ for any }m>0.

This can also be stated in terms of the Mahler measure of an algebraic number, where the Mahler measure of an algebraic number is simply the Mahler measure of its minimal polynomial.

Some active research consists of computational techniques for searching through polynomials of some degree trying to find those with smallest Mahler measure.

[edit] External links


This number theory-related article is a stub. You can help Wikipedia by expanding it.
Personal tools

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs