On Primitive Divisor Multiplicities of Lucas Sequences

Let $(U_{n})$ be a nondegenerate Lucas sequence with coprime integer parameters. Assuming the rational $abc$ conjecture, we prove that almost every index $n$ has a primitive prime divisor of $U_{n}$ of multiplicity one. More quantitatively, the logarithmic contribution of repeated primitive prime factors tends to zero relative to the primitive part along any family with $ϕ(n) / n$ bounded below, and also in Cesàro mean over all indices. We derive explicit logarithmic lower bounds for Lucas non-Wieferich primes with ranks in prescribed residue classes. Both signs of the discriminant are allowed. Independently, we describe initial multiplicities at good odd primes by a unique Hensel root in the recurrence-parameter disk and by the exact contraction rate of a normalized Dickson-polynomial iteration. Applications include rank and period lifting for Fibonacci numbers and the Wall-Sun-Sun condition.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20650
Primary Topic
Algebraic Geometry and Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On Primitive Divisor Multiplicities of Lucas Sequences

Samin Riasat
arXiv (Cornell University)
Algebraic Geometry and Number Theory
preprint

On Primitive Divisor Multiplicities of Lucas Sequences

Samin Riasat
preprint en

Abstract

Let $(U_{n})$ be a nondegenerate Lucas sequence with coprime integer parameters. Assuming the rational $abc$ conjecture, we prove that almost every index $n$ has a primitive prime divisor of $U_{n}$ of multiplicity one. More quantitatively, the logarithmic contribution of repeated primitive prime factors tends to zero relative to the primitive part along any family with $ϕ(n) / n$ bounded below, and also in Cesàro mean over all indices. We derive explicit logarithmic lower bounds for Lucas non-Wieferich primes with ranks in prescribed residue classes. Both signs of the discriminant are allowed. Independently, we describe initial multiplicities at good odd primes by a unique Hensel root in the recurrence-parameter disk and by the exact contraction rate of a normalized Dickson-polynomial iteration. Applications include rank and period lifting for Fibonacci numbers and the Wall-Sun-Sun condition.

arXiv (Cornell University)
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon