Primitive prime factors in second-order linear recurrence sequences

DOI10.4064/AA155-4-7MaRDI QIDQ4649922zbMATH OpenOpenAlexFDO

Authors Andrew Granville

Publication date 15 November 2012

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1212.6306

zbMATH Keywords

primitive prime factorsRecurrence sequencescharacteristic prime factors

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Recurrences (11B37) Higher degree equations; Fermat's equation (11D41)

Abstract: For a class of Lucas sequences $x_n$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n=1,2,3or6$. This has several desirable consequences.

Recommendations

• On Lucas sequence terms of the form \(kx^2\)
• Primitive divisors of Lucas and Lehmer sequences. II
• scientific article; zbMATH DE number 4063179
• scientific article; zbMATH DE number 1022824
• The square terms in Lucas sequences

Cited in

(5)

• scientific article; zbMATH DE number 1236755 (Why is no real title available?)
• On the zeros of the partial sums of the Fibonacci zeta function
• scientific article; zbMATH DE number 5989890 (Why is no real title available?)
• Quartic, octic residues and Lucas sequences
• scientific article; zbMATH DE number 6176023 (Why is no real title available?)

This page was built for publication: Primitive prime factors in second-order linear recurrence sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649922)