Bounding the number of solutions of some congruences

Eric Levieil*, Florian Luca, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


We estimate from above the number of solutions in integers n of congruence equations A(n) = λ (mod p), y < n ≤ x for various sequences A(1), . . . , A(N). Here p is a prime, x, y are integers, and each of our sequences under consideration is such that a(n) = A(n)/A(n -1) has certain prescribed arithmetic or algebraic properties. In particular, we deal with the situations that a(n) is a polynomial function of re, the n-th prime, or that an has some combinatorial meaning.

Original languageEnglish
Pages (from-to)175-180
Number of pages6
JournalBoletin de la Sociedad Matematica Mexicana
Issue number2
Publication statusPublished - Oct 2005


Dive into the research topics of 'Bounding the number of solutions of some congruences'. Together they form a unique fingerprint.

Cite this