Lehmer number

Lehmer number

In mathematics, a Lehmer number is a generalization of a Lucas sequence.

Algebraic relations

If a and b are complex numbers with

:a + b = sqrt{R}

:ab = Q

under the following conditions:

* "Q" and "R" are relatively prime nonzero integers

* frac{a}{b} is not a root of unity.

Then, the corresponding Lehmer numbers are:

:U_n(sqrt{R},Q) = frac{a^n-b^n}{a-b}

for "n" odd, and

:U_n(sqrt{R},Q) = frac{a^n-b^n}{a^2-b^2}for "n" even.

Their companion numbers are:

:V_n(sqrt{R},Q) = frac{a^n-b^n}{a+b}

for "n" odd and

:V_n(sqrt{R},Q) = a^n-b^n

for "n" even.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Lehmer sieve — Lehmer sieves are named for Derrick Norman Lehmer and his son Derrick Henry Lehmer. The father was a professor of mathematics at the University of California, Berkeley at the time, and his son was to follow in his footsteps, as a number theorist… …   Wikipedia

  • Lehmer's conjecture — 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,… …   Wikipedia

  • Lehmer mean — The Lehmer mean of a tuple x of positive real numbers is defined as::L p(x) = frac{sum {k=1}^{n} x k^p}{sum {k=1}^{n} x k^{p 1.The Weighted Lehmer mean with respect to a tuple w of positive weights is defined as::L {p,w}(x) = frac{sum {k=1}^{n} w …   Wikipedia

  • Lehmer-Schur algorithm — In mathematics, the Lehmer Schur algorithm is a root finding algorithm extending the one dimensional bracketing used by the bisection method to find the roots of a function of one complex variable inside any rectangular region of the function s… …   Wikipedia

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • Derrick Henry Lehmer — Born February 23, 1905(1905 02 23) Berkeley, California Died May 22, 1991(1991 05 22) (aged&# …   Wikipedia

  • Lucas–Lehmer test for Mersenne numbers — This article is about the Lucas–Lehmer test (LLT), that only applies to Mersenne numbers. There is also a Lucas Lehmer Riesel test for numbers of the form N=k 2^n 1, with 2^n > k, based on the LLT: see Lucas Lehmer Riesel test. There is also a… …   Wikipedia

  • Derrick Lehmer — Derrick Henry Lehmer (* 23. Februar 1905 in Berkeley (Kalifornien); † 22. Mai 1991 ebenda) war ein US amerikanischer Mathematiker, spezialisiert auf Zahlentheorie. Inhaltsverzeichnis 1 Leben 2 Werk 3 Schriften …   Deutsch Wikipedia

  • Derrick Norman Lehmer — Born July 27, 1867(1867 07 27) Somerset, Indiana, United States Died September 8, 1938(1938 09 08) Berkeley, California, United States Education …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”