14 citations · 69 across the 33 of their papers we have counts for
Showing 2005 · math.NTShow all
3 papers · 2 filters
math.NT2005★ 3 cited
Linear recurrence relations for binomial coefficients modulo a prime
Sandro Mattarei
We investigate when the sequence of binomial coefficients \binom{k}{i} modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree…
math.NT2005★ 5 cited
On a bound of Garcia and Voloch for the number of points of a Fermat curve over a prime field
Sandro Mattarei
In 1988 Garcia and Voloch proved the upper bound 4n^{4/3}(p-1)^{2/3} for the number of solutions over a prime finite field F_p of the Fermat equation x^n+y^n=a, where a \in F_p^* a…
math.NT2005★ 10 cited
Modular periodicity of binomial coefficients
Sandro Mattarei
We prove that if the signed binomial coefficient viewed modulo p is a periodic function of i with period h prime to p in the range , then k+1 is a…