Advertisement

On the Monoid Generated by a Lucas Sequence

Chapter

Abstract

A Lucas sequence is a sequence of the general form \(v_{n} = (\phi ^{n} -\overline{\phi }^{n})/(\phi -\overline{\phi })\), where ϕ and \(\overline{\phi }\) are real algebraic integers such that \(\phi +\overline{\phi }\) and \(\phi \overline{\phi }\) are both rational. Famous examples include the Fibonacci numbers, the Pell numbers, and the Mersenne numbers. We study the monoid that is generated by such a sequence; as it turns out, it is almost freely generated. We provide an asymptotic formula for the number of positive integers ≤ x in this monoid, and also prove Erdős–Kac type theorems for the distribution of the number of factors, with and without multiplicity. While the limiting distribution is Gaussian if only distinct factors are counted, this is no longer the case when multiplicities are taken into account.

2010 Mathematics Subject Classification

11N37 11B39 

Notes

Acknowledgements

C. Heuberger is supported by the Austrian Science Fund (FWF): P 24644-N26. Parts of this paper have been written while he was a visitor at Stellenbosch University.

S. Wagner is supported by the National Research Foundation of South Africa, grant number 96236.

References

  1. 1.
    T.M. Apostol, Introduction to Analytic Number Theory. Undergraduate Texts in Mathematics (Springer, New York/Heidelberg, 1976)Google Scholar
  2. 2.
    Y. Bilu, G. Hanrot, P.M. Voutier, Existence of primitive divisors of Lucas and Lehmer numbers. J. Reine Angew. Math. 539, 75–122 (2001). With an appendix by M. Mignotte (2002j:11027)Google Scholar
  3. 3.
    R.D. Carmichael, On the numerical factors of the arithmetic forms α n ±β n. Ann. Math. 15, 30–70 (1913)MathSciNetCrossRefGoogle Scholar
  4. 4.
    J.H. Curtiss, A note on the theory of moment generating functions. Ann. Math. Stat. 13, 430–433 (1942)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    P.D.T.A. Elliott, Probabilistic Number Theory. II. Central Limit Theorems. Grundlehren der Mathematischen Wissenschaften, vol. 240 (Springer, Berlin/New York, 1980)Google Scholar
  6. 6.
    P. Erdős, M. Kac, The Gaussian law of errors in the theory of additive number theoretic functions. Am. J. Math. 62, 738–742 (1940)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    P. Erdős, J. Lehner, The distribution of the number of summands in the partitions of a positive integer. Duke Math. J. 8, 335–345 (1941)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    P. Flajolet, H. Prodinger, Register allocation for unary-binary trees. SIAM J. Comput. 15(3), 629–640 (1986) (87j:68052)Google Scholar
  9. 9.
    P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger, R.F. Tichy, Mellin transforms and asymptotics: digital sums. Theor. Comput. Sci. 123, 291–314 (1994)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: harmonic sums. Theor. Comput. Sci. 144, 3–58 (1995)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    W.M.Y. Goh, E. Schmutz, The number of distinct part sizes in a random integer partition. J. Comb. Theory Ser. A 69(1), 149–158 (1995)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    J. Knopfmacher, Abstract Analytic Number Theory (North-Holland/American Elsevier, Amsterdam/Oxford/New York, 1975)MATHGoogle Scholar
  13. 13.
    J. Knopfmacher, W.-B. Zhang, Number Theory Arising from Finite Fields. Monographs and Textbooks in Pure and Applied Mathematics, vol. 241 (Marcel Dekker, New York, 2001)Google Scholar
  14. 14.
    F. Luca, Š. Porubský, The multiplicative group generated by the Lehmer numbers. Fibonacci Quart. 41(2), 122–132 (2003)MathSciNetMATHGoogle Scholar
  15. 15.
    F. Luca, C. Pomerance, S. Wagner, Fibonacci integers. J. Number Theory 131(3), 440–457 (2011)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    NIST Digital library of mathematical functions, Release 1.0.10 of 2015-08-07 (2015). Online companion to [17]. http://dlmf.nist.gov/
  17. 17.
    F.W.J. Olver, D.W. Lozier, R.F. Boisvert, C.W. Clark (eds.), NIST Handbook of Mathematical Functions (Cambridge University Press, New York, 2010)MATHGoogle Scholar
  18. 18.
    The On-Line Encyclopedia of Integer Sequences (2016) http://oeis.org
  19. 19.
    S. Wehmeier, The Erdős-Kac theorem for additive arithmetical semigroups. Lith. Math. J. 47(3), 352–360 (2007)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    E.T. Whittaker, G.N. Watson, A Course of Modern Analysis (Cambridge University Press, Cambridge, 1996). Reprint of the fourth edition (1927)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institut für Mathematik, Alpen-Adria-Universität KlagenfurtKlagenfurtAustria
  2. 2.Department of Mathematical SciencesStellenbosch UniversityStellenboschSouth Africa

Personalised recommendations