For a linear recurrence sequence, the set of indices at which the sequence takes the value zero is, apart from finitely many exceptions, a union of full arithmetic progressions. Named for Thoralf Skolem, Kurt Mahler and Christer Lech, who each proved successive refinements.
Facts
StatementIf a sequence of numbers satisfies a linear recurrence with constant coefficients, then, with finitely many exceptions, the positions at which the sequence is zero form a finite union of arithmetic progressions. 1 Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
In Branch
Proved By
Source Skolem-Mahler-Lech Theorem (Wikipedia)
Source Skolem-Mahler-Lech Theorem (Wikipedia)
Sources
1. Skolem-Mahler-Lech Theorem (Wikipedia)
Wikimedia FoundationLead section
if a sequence of numbers satisfies a linear recurrence with constant coefficients, then with finitely many exceptions the positions at which the sequence is zero form a regularly repeating pattern.
Proved By: Thoralf Skolem, Lead paragraph
In algebraic number theory, the Skolem-Mahler-Lech theorem states that if a sequence of numbers satisfies a linear recurrence with constant coefficients, then
Proved By: Kurt Mahler, Lead paragraph
In algebraic number theory, the Skolem-Mahler-Lech theorem states that if a sequence of numbers satisfies a linear recurrence with constant coefficients, then with finitely
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.