WorksMathematics
On Primitive Divisor Multiplicities of Lucas Sequences
Abstract
Let be a nondegenerate Lucas sequence with coprime integer parameters. Assuming the rational conjecture, we prove that almost every index has a primitive prime divisor of 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 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.
Introduction
Let be coprime integers, , and let be the roots of . We assume throughout that is not a root of unity. In particular, and . Define the Lucas sequences of the first and second kinds by
Equivalently, both satisfy
with initial values and respectively. Put . For a prime , let denote its rank of apparition, the least positive with , and write , where is the -adic valuation, with . Such a rank always exists (see Proposition 2.3). We call a primitive divisor at index if , and simple if additionally . The usual Lucas primitive-divisor convention excludes primes dividing ; our first-occurrence convention includes them. This affects only finitely many indices for any fixed sequence.
The classical primitive-divisor theorem ensures that, for , has a primitive divisor in the usual sense [4]; for real roots, Carmichael’s earlier theorem gives a stronger threshold [6]. For a comprehensive account of Lucas sequences, see Ballot and Williams [3]. These existence results do not control the multiplicity of a primitive divisor. For the Fibonacci sequence , the assertion that every primitive divisor is simple is equivalent to the nonexistence of Wall–Sun–Sun primes. In general it is false: even within , one can construct Lucas sequences in which a prescribed odd prime has initial multiplicity at least two (Proposition 6.11).
We investigate two aspects of initial multiplicity: its global distribution over the indices, conditional on , and its local description as a function of the recurrence parameter. For the first, write
Thus . Empty products are 1. Throughout, denotes Euler’s totient function, the Möbius function, and the number of distinct prime factors of . By the rational conjecture we mean that, for each , coprime positive integers satisfy , where for nonzero .
Theorem 1.1 (Conditional abundance of simple primitive divisors). Assume the rational conjecture. For every fixed nondegenerate Lucas sequence with coprime integer parameters the following hold.
For every , uniformly over indices with ,
In particular, along any unbounded family of such indices.
Put if , and otherwise. Then
The indices with have natural density one. Moreover, for every fixed prime , all sufficiently large indices have .
These conclusions also hold if primitive divisors are required to be coprime to the discriminant.
This result refines the conditional method of extracting non-Wieferich primes from cyclotomic factors. Ribenboim and Walsh [17] obtained bounds on powerful parts of binary recurrent sequences of positive discriminant; see also Yabuta [25] for negative discriminant and Ribenboim [16] for conditional infinitude of Lucas non-Wieferich primes. Peng [11] treats a generalization of Fibonacci–Wieferich primes. Most directly related to our argument is the work of Anitha, Fathima and Vijayalakshmi [2], who, using the number-field conjecture, obtain logarithmic lower bounds for Lucas non-Wieferich primes in the residue classes modulo a fixed integer. Their cyclotomic extraction uses a positive-proportion family of indices with bounded below. We use the rational Lucas identity to work with rational and obtain a density-one statement for ranks themselves, without a restriction on the sign of the discriminant. The powerful-part bound and cyclotomic estimates are established tools; the focus of Theorem 1.1 is their consequence for the distribution of simple primitive divisors.
Corollary 1.2 (Conditional rank distribution). Assume rational . For and (mod ), let count primes , , with and (mod ). Then
In particular, for the same lower bound holds for the count of Lucas non-Wieferich primes with (mod ).
Here a prime is Lucas non-Wieferich if , equivalently by the rank and lifting formulas, where is the Legendre symbol. The conclusion for arbitrary restricts the rank rather than just the prime’s residue class.
Our second result concerns variation of at fixed . Write for the Lucas polynomials obtained by replacing by in (1.1). They are Dickson polynomials of the second and first kinds, respectively (with index in the second-kind case); see [8]. At an odd prime , set
The normalization ensures and (mod ), so that the iteration preserves the norm parameter and the residue class of .
Theorem 1.3 (Local multiplicity and normalized iteration). Let be prime, and . There is a unique with . For ,
In particular, is the unique fixed point of in this disk. Setting , for every one has
Consequently , and the exceptional parameter modulo is uniquely determined for every .
For , the normalization is trivial, and the iteration consists of the usual trace polynomials. In particular, for Fibonacci numbers and . Bragman and Rowland [5 Theorem 10] express the Fibonacci Wall exponent using the principal-unit part of the golden ratio. The local description here is consistent with theirs: its focus is the recurrence parameter, the norm-preserving normalization for arbitrary , and the exact valuation of each iteration step. McIntosh and Roettger [9 Theorem 1(v)] already give a congruence characterization of Lucas–Wieferich primes in terms of for . Our valuation identity refines this characterization to all exponents and also allows . The underlying Dickson composition and power-map dynamics are classical [8, 7]. For related congruences and derivative identities for Lucas polynomials, see Yamagishi [26]; Müller [10] studies the distribution of ranks when a recurrence parameter varies over a finite field.
The proofs are organized as follows. § 2 records the lifting and rank results needed below, including the discriminant-prime case. § 3 establishes the primitive-factor estimates, including the prime 2. § 4 proves Theorem 1.1 and Corollary 1.2; § 5 proves Theorem 1.3. Finally, § 6 gives Fibonacci applications, drawing on the author’s earlier notes [12, 13, 14, 15].
Lifting in rings of algebraic integers
Throughout, is the usual -adic valuation on integers, with . We also use for the valuation on normalized by . For a number field we use congruence modulo in to mean congruence modulo the ideal . In particular, an integer in belongs to , since .
Theorem 2.1 (Algebraic lifting). Let be an odd rational prime, and let be units modulo . Put
Suppose . For every positive integer and prime ideal ,
where and is the normalized ideal valuation. In particular, if is integral over and rational for every , then
Proof. The polynomial identity holds with , and . Since , we have . If , then is a unit modulo . For , write , where . The binomial theorem gives
Here the intermediate terms are in , and so is the last term because . Hence with a unit modulo . Replacing by their th powers preserves their congruence and unit properties. Factor with and apply the two calculations successively. The factors prime to every have valuation zero, and each factor has valuation . This proves (2.1); for rational integers it implies (2.2). □
Remark 2.2. No unramifiedness hypothesis is required. For the same step is valid if , since . It need not hold when only ; for instance, but .
Ranks of apparition
Proposition 2.3. The sequence satisfies for positive . For every coprime to , the least positive index with exists, and
For an odd prime , put . Then
If , then . A prime dividing divides no with .
Proof. The identity follows from the recurrence (1.1). Every prime dividing is coprime to each positive-index , since modulo that prime. The recurrence then shows by descending induction. The addition identity implies , so the Euclidean algorithm proves strong divisibility. The recurrence state evolves by an invertible matrix modulo if . It returns to , giving existence; strong divisibility and minimality yield the equivalence.
Modulo , if is a nonzero square, the two nonzero roots lie in and have st powers equal to . If is a nonsquare, the roots lie in and Frobenius interchanges them, so their st powers are both . In either case the Binet expression gives and modulo . In the remaining case the polynomial has a double root in ; the polynomial sum defining reduces to . This gives and . □
Corollary 2.4. Let be an odd prime not dividing , and . Then for every positive and ,
Proof. Apply Theorem 2.1 to the roots of (both are units modulo because their product is ) and use Proposition 2.3. The smallest multiplier with valuation at least gives (14).
Primes dividing the discriminant
Proposition 2.5. For odd primes one has if and only if . If and , then
Moreover if and only if .
Proof. For the first assertion follows from Proposition 2.3; if , then by coprimality. The symmetric expansion is
If and , every term except is divisible by , including the last term since . Since , Fermat’s little theorem gives (15). Finally . If then , and . Conversely implies ; the displayed identity proves the equivalence.
Remark 2.6. This corrects the one-sided binomial expansion in [15 Lemma 4.1]: does not in general imply . The symmetric expansion avoids that issue. The valuation formulas agree with the general results of Sanna [21]. In particular, for dividing ; for and it is .
Cyclotomic factors and their primitive parts
For let
where is the homogeneous cyclotomic polynomial. The identity follows by Möbius inversion from the cyclotomic factorization of . The polynomial is symmetric for , so its value is a rational algebraic integer and is a positive integer. Moreover . These factors, also known as Lucas atoms or Möbius duals, have been studied in [20, 1, 19]. We record their valuations to control the nonprimitive contribution, with a short proof from Theorem 2.1.
Proposition 3.1 ([1, 19]). Let , let be prime, and write , . If is odd, then
If , then is odd, for even and for odd , and
A prime dividing divides no .
Proof. For odd , insert (2.4) into the Möbius transform in (3.1). If , all terms vanish. If , the transform is
The constant contributes only at . The transform of is precisely at for . This also covers primes dividing , with their own initial value .
For , the ranks follow from the recurrence (1.1) modulo 2. If , the roots , are congruent modulo 2 in their ring of integers and are units modulo 2, so the quotient is odd for odd by the geometric-sum identity. Since , is even. The identities
show that the first doubling increases the valuation by , and each subsequent doubling increases it by one, since whenever is even and is odd. Thus for odd , and for even $t. Its Möbius transform gives (3.3). Finally, implies for every positive by Proposition 2.3, hence . ∎
Corollary 3.2. For , write . The odd part of is either or the largest prime factor of , occurring to exponent one. In particular,
Proof. By Proposition 3.1, a nonprimitive odd divisor requires for . If , then ; otherwise , whose prime factors are all smaller than (also for , which is even). Thus and its exponent is one. The contribution of 2 is bounded by if is odd, and is absent otherwise. This proves the bound. ∎
Lemma 3.3 (Growth of the primitive part). For every fixed nondegenerate Lucas sequence with coprime integer parameters,
If , the sharper estimate holds.
Proof. Choose . Since is a nonzero integer, . Equality would force both absolute values to be one; if the roots are real their quotient is then a root of unity, and if complex, and , again giving a root of unity. Hence . By (16),
For real roots, by nondegeneracy. The absolute sum of the error terms over all converges, so .
For complex conjugate roots the ratio has modulus one but is not a root of unity. The standard bound for a linear form in logarithms, in the form of [23 Lemma 3], gives that the logarithm is at least for some positive constant; it is at most . Therefore the error in (21) is . The elementary estimates and show this is . For completeness, for each the inequalities and hold for all sufficiently large primes ; the remaining primes contribute a fixed constant to the two products. Combining with (19) proves both assertions.
Conditional density of simple primitive divisors
We use the rational Lucas identity to bound the entire powerful part, and then remove the nonprimitive factors. The estimate below is a version of the powerful-part bounds of Ribenboim and Walsh [17]; the proof also works for negative discriminant, as in the setting of Yabuta [25].
Lemma 4.1 (Conditional powerful-part bound). Assume rational abc. For , define the powerful part
For each , it satisfies . In particular, .
Proof. The identity
has three nonzero terms: nondegeneracy excludes and for . If , then and , so neither is divisible by . It follows that the common divisor of the three terms in (22) divides (if is even then is odd and the common divisor is ). Dividing by gives pairwise coprime integers, and moving the negative terms to the other side gives an equation of the form with .
The maximum of the absolute values of the original terms is . For real roots, this follows from ; for complex roots, use . Also . The radical of is fixed, so the conjecture implies, for every ,
The radical is thus . On the other hand,
Combining gives . Taking sufficiently small proves the claim. Since , the final assertion follows.
Proof of Theorem 1.1. By Lemma 3.3, for sufficiently large we have . In particular, if , apply Lemma 4.1 with exponent to obtain . The bound for follows. The finitely many small indices can be absorbed in the constants. Taking arbitrary proves the logarithmic limiting assertion.
For the mean-value assertion, observe that
Indeed, the identity follows by multiplicativity, and the product converges by comparison with . By Lemma 4.1, for each , for all sufficiently large . Hence for such ,
The finite initial portion contributes to the mean. By (4.2) the limsup of the mean is at most , for every , and is therefore zero.
By Lemma 3.3, for all sufficiently large . When and we have . The mean-value conclusion therefore shows that the set of such indices has density zero. For we have , so the first assertion with any and Lemma 3.3 show that for all sufficiently large . Finally, removing the primes dividing alters only the finitely many indices at which such a prime first appears; the estimates and limits remain valid after a change of constants.
Proof of Corollary 1.2. By Theorem 1.1, the number of indices in the class with is . Excluding the finitely many ranks of primes dividing , choose a simple primitive divisor of each such . The primes are distinct because the ranks are distinct. Since , taking proves (1.4). Finally, when the rank bound in Proposition 2.3 gives , so . The equivalence of simplicity with the stated Lucas non-Wieferich condition follows from (2.4) because is coprime to the index .
Remark 4.2. These statements concern the distribution of ranks and not a prime-density asymptotic. They neither assert that every sufficiently large index has a simple primitive divisor nor exclude repeated primitive divisors. The argument uses the unspecified constants of the rational conjecture and gives no explicit rate for its exceptional set.
Local multiplicity in recurrence-parameter space
We prove Theorem 1.3. In this section is held fixed. The Binet expressions for the Lucas polynomials give the derivative identities (the second is also [26 Lemma 2.1]
Indeed, if are the roots of over , then and . Differentiating the Binet expressions gives (5.1). We also have as polynomials by the Frobenius identity for the trace; see also [26 Lemma 3.1].
Proof of Theorem 1.3. The rank bound yields and . By (4.1), because and . The first identity in (5.1) gives . Hensel’s lemma supplies a unique in . On that disk the polynomial divided difference of at any two points is congruent to modulo , hence a unit. Taking one point to be proves (1.6).
Euler’s criterion implies ; the normalization also gives . Consequently for all . For in the disk, the derivative has valuation one, by (2.3) applied at the residue of . To obtain the exact contraction, write , , and expand the polynomial . Its coefficient of has valuation one. The coefficients of for are in , since ; the coefficient of is a unit. All these higher terms have valuation strictly greater than (here ). The linear term therefore gives (1.7). If , both sides have the usual infinite-valuation interpretation.
Let . The roots at parameter are and . This follows by induction, as their product is and the next iteration scales their th powers by . It proves (1.8). The Binet expression gives
Here is a -adic unit and the denominator is a unit, since and . By (2.4), the valuation of the numerator is . Applying (1.6) yields . Thus , and continuity gives . The two successive distances to have unequal valuations, so . Finally, (7) rules out two distinct fixed points. This proves the theorem.
Corollary 5.1. Under the hypotheses of Theorem 1.3, for each there is exactly one residue class modulo in on which . Of its lifts modulo , exactly have valuation and one has higher valuation. In particular,
Proof. The class is by (6); the remaining statements are immediate from (9).
To compare the valuation identity with [9 Theorem 1(v)], put . Since , we have . Thus , and is precisely their trace congruence. The exceptional class at precision has relative frequency as the parameter varies in the disk. This exact statement about a variable parameter does not imply equidistribution over primes for a fixed integer .
For example, take and . Here , , , , and . Hence and , as predicted. The first iterate satisfies , the unique lift of modulo solving .
The Dickson normalization in (5) allows any fixed nonzero norm parameter, rather than just . The iteration itself is a rescaled power map, with classical Dickson composition; our application records the rank exponent as its exact initial distance and step size. For , , so no rescaling is needed.
Fibonacci applications
Ranks and periods
Specialize to , writing , , , and . Write for the rank of apparition modulo and for the Pisano period modulo . Put for each prime , and for odd . The quantities , , , , in this section are their Fibonacci specializations. A prime is Wall–Sun–Sun when . Since and otherwise, the assertion that every first-occurring prime is simple is equivalent to the nonexistence of Wall–Sun–Sun primes. The problem goes back to Wall [24]; see also Sun and Sun [22]. No such prime is known; the customary heuristic instead predicts infinitely many [9, 5].
In the identity
follows by induction. The ring is the ring of integers of . The period is exactly the order of in , by (25) and the independence of as a -basis. This interpretation uses ideal congruence and does not depend on whether a prime dividing splits, ramifies or remains inert in .
Proposition 6.1. For , divides . If is an odd prime, then
Proof. Let . Equation (25) implies . Taking norms gives . Thus is a unit of order dividing . The powers of that are rational scalars modulo occur exactly at multiples of , by strong divisibility. Hence equals the order of modulo and divides .
The kernel of reduction has order a power of (it is ). Therefore is a power of . On the other hand is a power of by (14), and the ratios of period to rank are powers of . Since is odd, these latter ratios are equal at and . This gives (26). □
Corollary 6.2. For an odd prime , the following are equivalent: is Wall–Sun–Sun; ; ; .
Proof. Use from (12), so , and apply (13), (14) and (26). □
Theorem 6.3 (Odd-rank congruences). Let be prime with odd rank . Then and
In particular, .
Proof. As in Proposition 6.1, ; for odd its order is . Thus . In the split case in , giving . In the inert case Frobenius sends to , so . Since , we have . This proves the stated congruences. □
Corollary 6.4. If is prime and is a prime divisor of , then , , and (27) holds with . If , then for every . In particular, implies that is a Wall–Sun–Sun prime.
Proof. The rank divides and exceeds . Also since their ranks are . Apply Theorem 6.3 and Corollary 6.2. □
Remark 6.5. This extends the prime-index classification of [13 Proposition 2] to all odd ranks. It does not imply that a hypothetical Wall–Sun–Sun prime has prime, or even odd, rank. In particular, squarefreeness of every prime-index Fibonacci number is only a necessary consequence of nonexistence of Wall–Sun–Sun primes.
Cyclotomic factors and splitting
For Fibonacci numbers, , , and . Thus (18) has the exceptional value 2 at and is at most one elsewhere. The odd part of is either 1 or the largest prime factor of , as in Corollary 3.2. We recall the squarefreeness characterization of Ross, Shen and Cai.
Corollary 6.6 ([19 Corollary 5.1]). The following assertions are equivalent:
No Wall–Sun–Sun prime exists.
is squarefree for every .
The odd part of is squarefree for every .
Proof. The first two are equivalent by definition and . For an odd prime , (17) shows that if and only if and . This proves the third equivalence. By (18), the third condition is also equivalent to squarefreeness of at every . This is exactly the characterization of Ross, Shen and Cai [19 Corollary 5.1]. □
Splitting and parity of primitive multiplicities
The valuation formula above is a specialization of [1 Theorems 14–15] and [19 Theorem 2.2]. Ross, Shen and Cai [18 Corollaries 2.5–2.6] establish the parity of primitive multiplicities for general regular Lucas sequences and explicitly for Fibonacci numbers. In particular, their Corollary 2.6(b), (e) includes the inert prime-power existence result below. We provide a direct proof using the character modulo 5 and combine it with the odd-rank congruences to obtain the modulus . Their Corollary 2.4(b) also includes the prime-power quotient congruence modulo . We next restrict to with , so every prime dividing is odd and different from 5. This restriction is convenient rather than essential. For odd one has
Indeed, the polynomial has a double root 3 modulo 5. Its divided difference reduces to , and is a square when is odd. (The first congruence holds also for even .)
Theorem 6.7 (Character of the primitive part). Let and . Define
Then
In particular, the parity of the total multiplicity of inert primitive divisors of is determined by and .
Proof. By (3.1) and (6.4),
The integer inside the symbol in the final expression equals for and otherwise, by taking the valuation at each prime and using the same Möbius transform as in the proof of Proposition 3.1. This proves (6.5), and the identity proves (6.6).
If , Theorem 6.3 implies that or modulo according as splits or is inert. The latter residue is an involution since . Consequently is congruent to the latter residue precisely when the sum of the multiplicities of inert factors is odd. By quadratic reciprocity, , so that parity is measured by . This proves (6.7).
Corollary 6.8 (Prime-power indices). Let be prime and . Put . Then
If , then has an inert primitive divisor of odd multiplicity. Such a satisfies and or .
Proof. For , (3.1) reduces to the quotient in the statement. If , Corollary 3.2 would give for . But and , a contradiction. Thus and (6.8) follows from Theorem 6.7. When , the total inert multiplicity is odd and at least one such prime has odd multiplicity. The congruences follow from Theorem 6.3 and quadratic reciprocity.
Remark 6.9. For a fixed inert prime , Corollary 6.8 gives infinitely many distinct inert primes, one of odd primitive multiplicity at each rank . Each such multiplicity is either one or at least three; the character argument cannot distinguish the two possibilities. For example, with , , one has
The prime 97 is inert, has rank 49, and occurs exactly once. This is an illustration, not a general proof of simple primitive divisibility.
The local Wall exponent
For Fibonacci numbers, by (5), so Theorem 1.3 gives an exact description in terms of Lucas numbers.
Corollary 6.10. For every odd prime ,
Moreover, in as , and for every . In particular, is Wall–Sun–Sun if and only if .
Proof. Set in Theorem 1.3 and apply (13).
The congruence characterization at exponent two is classical [9 Theorem 1(v)]. The fixed point is also explicit. In the unramified local extension containing , let be its Teichmüller representative. Then the representative of is and
The sum belongs to (in the inert case Frobenius interchanges the two summands); their quotient has order , and their difference is a unit as . Thus , and Hensel uniqueness proves (34). In fact
where the second factor is a unit, as it reduces to modulo . This recovers the local Wall exponent of Bragman and Rowland [5 Theorem 10].
Proposition 6.11. Let . If is a prime and , then
Independently, for every odd prime , the Lucas sequence has discriminant coprime to , norm parameter , and first occurrence of at with multiplicity .
Proof. The first quotient is the th term of the sequence , whose parameters are , , and . Thus Proposition 2.5 applies. For the second assertion use the same construction with index . Now by Proposition 2.3, and . Hence if and only if . Its initial valuation is by (13).
This example shows that a general multiplicity-one theorem for Lucas sequences is false, even within the field and with norm parameter . Any proof for Fibonacci numbers must use additional information about their fixed recurrence parameter.
Further questions
The conditional density result allows repeated primitive divisors. For Fibonacci numbers it does not imply that at every index, which would exclude all Wall–Sun–Sun primes. An unconditional result establishing for infinitely many for a single fixed prime would already prove the infinitude of non-Wall–Sun–Sun primes with prescribed prime-power ranks. A related question, suggested by Corollary 6.8, is whether for some inert prime infinitely many have an inert simple primitive divisor. The quadratic-character constraint alone only guarantees an inert divisor of odd multiplicity, not of multiplicity one.
Locally, the multiplicity-one conjecture for Fibonacci numbers is the assertion for every . The exact contraction of Theorem 1.3 controls all further lifts but not that initial distance. The subsequence construction of Proposition 6.11 illustrates the obstruction to a parameter-independent multiplicity-one assertion. Neither the conditional global estimate nor the local reformulation resolves this open problem.
Declaration of generative AI use
The author used ChatGPT (OpenAI, GPT-6) to assist in the consolidation and presentation of previously developed mathematical results, the exploration of further mathematical consequences, literature searches, proof refinement, and manuscript preparation. The research builds on the author’s earlier independent work on Fibonacci and Lucas sequences. The author takes full responsibility for the originality, accuracy, and integrity of the contents.
MSC2020: 11B39, 11A07, 11A41, 11D75, 11S05
References
- [1]G. Alecci, P. Miska, N. Murru, and G. Romeo. On alternative definition of Lucas atoms and their p-adic valuations. Monatsh. Math., 207:175–196, 2025.arxiv.org/abs/2308.10216
- [2]K. Anitha, I. Mumtaj Fathima, and A. R. Vijayalakshmi. Lucas non-Wieferich primes in arithmetic progressions and the abc conjecture. Open Math., 21:20220563, 2023.arxiv.org/abs/2101.04901
- [3]C. J.-C. Ballot and H. C. Williams. The Lucas Sequences: Theory and Applications, volume 8 of CMS/CAIMS Books in Mathematics. Springer, Cham, 2023.
- [4]Yu Bilu, G. Hanrot, and P. M. Voutier. Existence of primitive divisors of Lucas and Lehmer numbers. J. Reine Angew. Math., 539:75–122, 2001.DOI
- [5]N. Bragman and E. Rowland. Limiting density of the Fibonacci sequence modulo powers of a prime. Res. Number Theory, 11:88, 2025.arxiv.org/abs/2202.00704
- [6]R. D. Carmichael. On the numerical factors of the arithmetic forms αⁿ ± βⁿ. Ann. of Math. (2), 15:30–70, 1913.
- [7]B. Diarra and D. Sylla. p-adic dynamical systems of Chebyshev polynomials. p-Adic Numbers Ultrametric Anal. Appl., 6(1):21–32, 2014.DOI
- [8]R. Lidl, G. L. Mullen, and G. Turnwald. Dickson Polynomials, volume 65 of Pitman Monographs and Surveys in Pure and Applied Mathematics. Longman, 1993.
- [9]R. J. McIntosh and E. L. Roettger. A search for Fibonacci-Wieferich and Wolstenholme primes. Math. Comp., 76:2087–2094, 2007.DOI
- [10]S. Müller. On the rank of appearance and the number of zeros of the Lucas sequences over F_q. In D. Jungnickel and H. Niederreiter, editors, Finite Fields and Applications, pages 390–408. Springer, 2001.DOI
- [11]W. Peng. ABC implies there are infinitely many non-Fibonacci-Wieferich primes. J. Number Theory, 212:354–375, 2020.
- [12]S. Riasat. Z/[φ] and the Fibonacci sequence modulo n. Mathematical Reflections, pages 1–7, 2011. Issue 1. Author’s online version.
- [13]S. Riasat. On Fibonacci numbers with prime index. Note, 2012. Author’s online version.
- [14]S. Riasat. A generalisation of ‘lifting the exponent’. Note, 2013. Author’s online version.
- [15]S. Riasat. Generalising ‘LTE’ and application to Fibonacci-type sequences. Note, 2014. Author’s online version.
- [16]P. Ribenboim. On square factors of terms of binary recurring sequences and the ABC conjecture. Publ. Math. Debrecen, 59:459–469, 2001.DOI
- [17]P. Ribenboim and G. Walsh. The ABC conjecture and the powerful part of terms in binary recurring sequences. J. Number Theory, 74:134–147, 1999.DOI
- [18]T. Ross, Z. Shen, and T. Cai. Cyclotomic congruences and Lucas sequences. Preprint, 2026. arXiv:2512.03468v2 (8 January 2026).arxiv.org/abs/2512.03468
- [19]T. Ross, Z. Shen, and T. Cai. The p-adic valuations of Möbius duals of Lucas sequences. Fibonacci Quart., pages 1–10, 2026.DOI
- [20]B. E. Sagan and J. Tirrell. Lucas atoms. Adv. Math., 374:107387, 2020.
- [21]C. Sanna. The p-adic valuation of Lucas sequences. Fibonacci Quart., 54:118–124, 2016.
- [22]Z. H. Sun and Z. W. Sun. Fibonacci numbers and Fermat’s last theorem. Acta Arith., 60:371–388, 1992.DOI
- [23]P. M. Voutier. Primitive divisors of Lucas and Lehmer sequences, II. J. Théorie des Nombres Bordeaux, 8:251–274, 1996. Online version.DOI
- [24]D. D. Wall. Fibonacci series modulo m. Amer. Math. Monthly, 67:525–532, 1960.
- [25]M. Yabuta. The ABC-conjecture and the powerful numbers in Lucas sequences. Fibonacci Quart., 45:362–365, 2007.DOI
- [26]M. Yamagishi. A short proof of congruences for Lucas sequences. Fibonacci Quart., 57:260–264, 2019.DOI