We investigate when the sequence of binomial coefficients ((k; i)) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2 h ≤ k < p - h. This hypothesis can be weakened to 2 h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relation does not have -1 as a root. We apply our results to recover a known bound for the number of points of a Fermat curve over a finite field.
Mattarei, S. (2008). Linear recurrence relations for binomial coefficients modulo a prime. JOURNAL OF NUMBER THEORY, 128(1), 49-58 [10.1016/j.jnt.2007.05.003].
Linear recurrence relations for binomial coefficients modulo a prime
Mattarei, S
2008
Abstract
We investigate when the sequence of binomial coefficients ((k; i)) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2 h ≤ k < p - h. This hypothesis can be weakened to 2 h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relation does not have -1 as a root. We apply our results to recover a known bound for the number of points of a Fermat curve over a finite field.File | Dimensione | Formato | |
---|---|---|---|
Mattarei-2008-J Numb Th-VoR.pdf
Solo gestori archivio
Descrizione: Research Article
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
140.07 kB
Formato
Adobe PDF
|
140.07 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.