Skip to main content

Primes Having an Incomplete System of Residues for a Class of Second-Order Recurrences

  • Chapter

Abstract

Shah [4] and Bruckner [1] showed that if p is a prime and p > 7, then the Fibonacci sequence {Fn} has an incomplete system of residues modulo p. Shah established this result for the cases in which p = 1, 9, 11, or 19 modulo 20, while Bruckner proved the result true for the re ma ini n g c ases in which p = 3 or 7 modulo 10. Burr [2] extended these results by dete rmining all the positive integers m for which the Fibonacci sequence has an incomplete system of residues modulo m.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bruckner, G. “Fibonacci Sequence Modulo a Prime p 3 (mod 4).” The Fibonacci Quarterly 8, No. 2 (1970): pp 217–220.

    MathSciNet  MATH  Google Scholar 

  2. Burr, S. A. “On Moduli for Which the Fibonacci Sequence Contains a Complete System of Residues.” The Fibonacci Quarterly 9, No. 4 (1971): pp 497–504.

    MathSciNet  MATH  Google Scholar 

  3. Lehmer, D. H. “An Extended Theory of Lucas’ Functions.” Ann. Math. Second Series 31 (1930): pp 419–448.

    Article  MathSciNet  MATH  Google Scholar 

  4. Shah, A. P. “Fibonacci Sequence Modulo m.” The Fibonacci Quarterly 6, No. 1 (1968): pp 139–141.

    MathSciNet  MATH  Google Scholar 

  5. Somer, L. “The Fibonacci Ratios Fk+l/Fk Modulo p.” The Fibonacci Quarterly 13, No.4 (1975): pp 322–324.

    MathSciNet  MATH  Google Scholar 

  6. Somer, L. “Fibonacci-Like Groups and Periods of Fibonacci-Like Sequences.” The Fibonacci Quarterly 15, No. 1 (1977): pp 35–41.

    MathSciNet  MATH  Google Scholar 

  7. Somer, L. “The Divisibility Properties of Primary Lucas Recurrences with Respect to Primes.” The Fibonacci Quarterly 18, No. 4 (1980): pp 316–334.

    MathSciNet  MATH  Google Scholar 

  8. Somer, L. “Possible Periods of Primary Fibonacci-Like Sequences with Respect to a Fixed Odd Prime.” The Fibonacci Quarterly 20, No. 4 (1982): pp 311–333.

    MathSciNet  MATH  Google Scholar 

  9. Somer, L. “The Divisibility and Modular Properties of kth-order Linear Recurrences Over the Ring of Integers of an Algebraic Number Field with Respect to Prime Ideals”. Ph.D. Thesis. The University of Illinois at UrbanaChampalgn, 1985.

    Google Scholar 

  10. Wyler, O. “On Second-Order Recurrences.” Amer. Math. Monthly 72 (1965): pp 500–506.

    Article  MathSciNet  MATH  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

Somer, L. (1988). Primes Having an Incomplete System of Residues for a Class of Second-Order Recurrences. 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_12

Download citation

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

  • 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