English

On the monoid generated by a Lucas sequence

Number Theory 2017-08-30 v2

Abstract

A Lucas sequence is a sequence of the general form vn=(ϕnϕˉn)/(ϕϕˉ)v_n = (\phi^n - \bar{\phi}^n)/(\phi-\bar{\phi}), where ϕ\phi and ϕˉ\bar{\phi} are real algebraic integers such that ϕ+ϕˉ\phi+\bar{\phi} and ϕϕˉ\phi\bar{\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\leq x in this monoid, and also prove Erd\H{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.

Keywords

Cite

@article{arxiv.1606.02639,
  title  = {On the monoid generated by a Lucas sequence},
  author = {Clemens Heuberger and Stephan Wagner},
  journal= {arXiv preprint arXiv:1606.02639},
  year   = {2017}
}
R2 v1 2026-06-22T14:20:45.381Z