Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.22831 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912209994514432 |
|---|---|
| author | Wojtkowski, Maciej P. |
| author_facet | Wojtkowski, Maciej P. |
| contents | We propose a new interpretation of the classical index of appearance for second order linear recursive sequences. It stems from the formula \[ C_{n}(t)-2 =\fracΔ{Q^{n}}\ L_n^2,\ \ \ \text{where} \ \ t= (T^2-2Q)/Q, \ Δ= T^2-4Q, \] connecting the Chebyshev polynomials of the first kind $C_n(x)$ with the Lucas sequence defined for integer $T,Q\neq 0$ by the recursion $L_{n+1}= TL_n-QL_{n-1}, L_0=0, L_1 = 1$. We build on the results of \cite{L-W}. We prove that for any prime $r\geq 2$ the sets $Π_j(t,r), j=1,2,\dots$, of primes $p$ such that $j$ is the highest power of $r$ dividing the index of appearance, have prime density equal to $\frac{1}{(r+1)r^{j-1}}$, for $r$-generic values of $t$. We give also complete enumeration of non-generic cases and the appropriate density formulas. It improves on the work of Lagarias, \cite{L}, and Ballot, \cite{B1},\cite{B2},\cite{B3}, on the sets of prime divisors of sequences of "finite order". Our methods are sufficient to prove that for any linear recursive sequence of second order (with some trivial exceptions) the set of primes not dividing any element contains a subset of positive density. We consider also some applications in arithmetic dynamics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22831 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The index and its prime divisors Wojtkowski, Maciej P. Number Theory 11B37, 11B39 We propose a new interpretation of the classical index of appearance for second order linear recursive sequences. It stems from the formula \[ C_{n}(t)-2 =\fracΔ{Q^{n}}\ L_n^2,\ \ \ \text{where} \ \ t= (T^2-2Q)/Q, \ Δ= T^2-4Q, \] connecting the Chebyshev polynomials of the first kind $C_n(x)$ with the Lucas sequence defined for integer $T,Q\neq 0$ by the recursion $L_{n+1}= TL_n-QL_{n-1}, L_0=0, L_1 = 1$. We build on the results of \cite{L-W}. We prove that for any prime $r\geq 2$ the sets $Π_j(t,r), j=1,2,\dots$, of primes $p$ such that $j$ is the highest power of $r$ dividing the index of appearance, have prime density equal to $\frac{1}{(r+1)r^{j-1}}$, for $r$-generic values of $t$. We give also complete enumeration of non-generic cases and the appropriate density formulas. It improves on the work of Lagarias, \cite{L}, and Ballot, \cite{B1},\cite{B2},\cite{B3}, on the sets of prime divisors of sequences of "finite order". Our methods are sufficient to prove that for any linear recursive sequence of second order (with some trivial exceptions) the set of primes not dividing any element contains a subset of positive density. We consider also some applications in arithmetic dynamics. |
| title | The index and its prime divisors |
| topic | Number Theory 11B37, 11B39 |
| url | https://arxiv.org/abs/2410.22831 |