On the monoid generated by a Lucas sequence
From MaRDI portal
Abstract: A Lucas sequence is a sequence of the general form , where and are real algebraic integers such that and 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 in this monoid, and also prove ErdH{o}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.
Recommendations
Cites work
- A Note on the Theory of Moment Generating Functions
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- Fibonacci integers
- scientific article; zbMATH DE number 3670538 (Why is no real title available?)
- scientific article; zbMATH DE number 3503339 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 1995561 (Why is no real title available?)
- Mellin transforms and asymptotics: Digital sums
- Mellin transforms and asymptotics: Harmonic sums
- NIST handbook of mathematical functions
- Number theory arising from finite fields. Analytic and probabilistic theory
- Register Allocation for Unary–Binary Trees
- The distribution of the number of summands in the partitions of a positive integer
- The Erdös-Kac theorem for additive arithmetical semigroups
- The number of distinct part sizes in a random integer partition
Cited in
(4)
This page was built for publication: On the monoid generated by a Lucas sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581330)