TY - JOUR

T1 - Bounding the number of solutions of some congruences

AU - Levieil, Eric

AU - Luca, Florian

AU - Shparlinski, Igor E.

PY - 2005/10

Y1 - 2005/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745637464&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33745637464

VL - 11

SP - 175

EP - 180

JO - Boletin de la Sociedad Matematica Mexicana

JF - Boletin de la Sociedad Matematica Mexicana

SN - 0037-8615

IS - 2

ER -