Suites r\'ecurrentes lin\'eaires d'ordre 2 \`a divisibilit\'e forte
A. Bauval

TL;DR
This paper provides a simpler, elementary proof of a 1985 result characterizing certain second-order linear recurrence sequences of integers that satisfy a strong divisibility condition, expanding understanding of their properties.
Contribution
It offers a new, simplified proof of a known classification of integer recurrence sequences with strong divisibility, originally established by Horák and Skula.
Findings
Characterization of sequences satisfying strong divisibility
Simplified proof of the classification result
Reaffirmation of properties of second-order linear recurrences
Abstract
We reprove twice, in a simpler but as elementary way, a result by Hor\'ak and Skula (1985) who determined, among all sequences of integers defined by for some integers , those which satisfy the strong divisibility condition where denotes the greatest common divisor.
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 · Analytic Number Theory Research · graph theory and CDMA systems
