On prime factors of terms of binary recurrence sequences
C.L.Stewart
TL;DR
This paper provides lower bound estimates for the greatest prime factor of the n-th term in binary recurrence sequences, contributing to understanding their prime factorization properties.
Contribution
It introduces new lower bound estimates for prime factors of binary recurrence sequence terms, advancing previous results in the field.
Findings
Established lower bounds for prime factors of sequence terms
Improved understanding of prime factor distribution in recurrence sequences
Applicable to a wide class of binary recurrence sequences
Abstract
We give estimates from below for the greatest prime factor of the n-th term of a binary recurrence sequence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Advanced Mathematical Theories and Applications