A divisibility sequence is an integer sequence satisfying , with any conventions about zero terms stated. For example has this property because if , thenThe Fibonacci numbers also form a divisibility sequence. The stronger identity defines a strong divisibility property and does not follow from the basic implication alone. Such sequences organize common-factor questions by relationships among their indices.
A divisibility sequence associated with multiples of a point on an elliptic curve, using suitably normalized division polynomials. With and , its terms satisfy the Ward identity . Setting nearby indices gives doubling identities, enabling logarithmic-depth evaluation.
Articles by others on the same topic
A **divisibility sequence** is a sequence of integers \( (a_n) \) where each term divides the subsequent terms in the sequence according to specific criteria. More formally, a sequence \( (a_n) \) is called a divisibility sequence if for each pair of indices \( m < n \), the term \( a_m \) divides \( a_n \) (denoted as \( a_m \mid a_n \)).