Skip to main content
Log in

Prime Divisors Of Some Recurrence Sequence

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

In this paper, we study various arithmetic properties of the sequence (an)n≥1 satisfying the recurrence relation an = nan–1 + 1, n = 2, 3,..., with the initial term a1 = 0. In particular, we estimate the number of solutions of various congruences with this sequence and the number of distinct prime divisors of its first N terms.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. W. D. Banks and I. E. Shparlinski, On values taken by the largest prime factor of shifted primes, J. Austral. Math. Soc., 82 (2007), 133–147.

    Article  MathSciNet  MATH  Google Scholar 

  2. P. Cutter, A. Granville and T. J. Tucker, The number of fields generated by the square root of values of a given polynomial, Canad. Math. Bull., 46 (2003), 71–79.

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Z. Garaev, F. Luca and I. E. Shparlinski, Character sums and congruences with n!, Trans. Amer. Math. Soc., 356 (2004), 5089–5102.

    Article  MathSciNet  MATH  Google Scholar 

  4. G. Everest, A. J. van der Poorten, I. E. Shparlinski and T. Ward, Recurrence sequences, Amer. Math. Soc., 2003.

    Google Scholar 

  5. H. Halberstam and H.-E. Richert, Sieve Methods, Academic Press, London, 1974.

    MATH  Google Scholar 

  6. F. Luca, Prime factors of Motzkin numbers, Ars Combin., 80 (2006), 87–96.

    MathSciNet  MATH  Google Scholar 

  7. F. Luca, Prime divisors of binary holonomic sequences, Adv. in Appl. Math., to appear.

  8. F. Luca and I. E. Shparlinski, Prime divisors of shifted factorials, Bull. London Math. Soc., 37 (2005), 809–817.

    Article  MathSciNet  MATH  Google Scholar 

  9. E. M. Matveev, An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers II, Izv. Ross. Akad. Nauk. Ser. Mat., 64 (2000), 125–180; English translation: Izv. Math., 64 (2000), 1217–1269.

    Article  MathSciNet  MATH  Google Scholar 

  10. T. Müller, Prime and composite terms in Sloane’s sequence A056542, J. Integer Seq., 8 (2005), Article 05.3.3.

    Google Scholar 

  11. I. E. Shparlinski and D. Sutantyo, On the set of the largest prime divisors, Publ. Math. Debrecen, to appear.

  12. I. E. Shparlinski and A. Winterhof, On the discrepancy and linear complexity of some counter-dependent recurrence sequences, Lecture Notes in Comp. Sci. 4086, Springer-Verlag, Berlin, 2006, 295–303.

    Google Scholar 

  13. N. J. A. Sloane, On-line encyclopedia of integer sequences, http://www.research.att.com/’njas/sequences.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sanka Balasuriya.

Additional information

Communicated by Attila Pethő

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Balasuriya, S., Luca, F. & Shparlinski, I.E. Prime Divisors Of Some Recurrence Sequence. Period Math Hung 54, 215–227 (2007). https://doi.org/10.1007/s-10998-007-2215-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s-10998-007-2215-z

Mathematics subject classification number

Key words and phrases

Navigation