Skip to main content

Primitive Divisors of Lucas Numbers

  • Chapter
Applications of Fibonacci Numbers
  • 241 Accesses

Abstract

Let \( R = \{ {R_n}\} _{n = 1}^\infty \) be a Lucas sequence defined by fixed rational integers A and B and by the recursion relation

$$ {R_n} = A \cdot {R_{n - 1}} + B \cdot {R_{n - 2}} $$

for n > 2, where the initial values are R1 = 1 and R2 = A. The terms of R are called Lucas numbers. We shall denote the roots of the characteristic polynomial

$$ f(x) = {x^2} - Ax - B $$

by α and β. We may assume that |α| ≥ |β| and the sequence is not degenerate, that is, AB ≠ 0, A2 + 4B ≠ 0 and α/ß is not a root of unity. In this case, as it is wellknown, the terms of the sequence R can be expressed as

$$ {R_n} = \frac{{{\alpha ^n} - {\beta ^n}}}{{\alpha - \beta }}\quad (n = 1,2,...) $$

.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apostol, T.M. ”Introduction to Analytic Number Theory.” New York-Heidelberg-Berlin: Springer Verlag, 1976.

    MATH  Google Scholar 

  2. Baker, A. ”The theory of linear forms in logarithms.” Transcedence theory: advances and applications (ed. By A. Baker and D. W. Masser), London - New York: Acad. Press, 1977.

    Google Scholar 

  3. Baker, A. and Stewart, C. L. ”Further aspect of transcedence theory.” Asterisque 41– 42 (1977): pp 153–163.

    MathSciNet  Google Scholar 

  4. Matiyasevich, Y. V., and Guy, R. K. ”A new formula for π.” Amer. Math. Monthly, 93 No. 8 (1986): pp 631–635.

    Article  MathSciNet  MATH  Google Scholar 

  5. Prachar, K. ”Primzahlverteilung.” Berlin-Göttingen-Heidelberg: Springer Verlag, 1957.

    MATH  Google Scholar 

  6. Schinzel, A. ”On primitive prime factors of Lehmer numbers I.” Acta Arlthm. 8 (1963): pp 213–223.

    MathSciNet  MATH  Google Scholar 

  7. Schinzel, A. ”Primitive divisors of the expression An — Bn in algebraic number fields.” J. reine angew. Math. 268/269 (1974): pp 27–33.

    MathSciNet  Google Scholar 

  8. Shorey, T. N. and Stewart, C. L. ”On divisors of Fermat, Fibonacci, Lucas and Lehmer numbers II.” J. London Math. Soc. (C2) 23 (1981): pp 17–23.

    Article  MathSciNet  MATH  Google Scholar 

  9. Stewart, C. L. ”Primitive divisors of Lucas and Lehmer numbers.” Transcendence theory: advances and applications (ed. by A. Baker and D. W. Masser), London - New York: Acad. Press, 1977.

    Google Scholar 

  10. Stewart, C. L. ”On divisors of Fermat, Fibonacci, Lucas and Lehmer numbers.” Proc. London Math. Soc. 35 (1977): pp 425–447.

    Article  MathSciNet  MATH  Google Scholar 

  11. Zsigmondy, K. ”Zur Theorie der Potenzreste.” Monatsh. Math. 3 (1982): pp 265–284.

    Article  MathSciNet  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kiss, P. (1988). Primitive Divisors of Lucas Numbers. In: Philippou, A.N., Horadam, A.F., Bergum, G.E. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7801-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-7801-1_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-8447-7

  • Online ISBN: 978-94-015-7801-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics