Bounding the number of solutions of some congruences

MaRDI QIDQ2493334zbMATH OpenFDO

Authors Eric Levieil, Florian Luca, Igor E. Shparlinski

Publication date 12 June 2006

Published in Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

zbMATH Keywords

number of solutions of congruencessequences modulo primes

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Sequences (mod (m)) (11B50) Binomial coefficients; factorials; (q)-identities (11B65) Distribution of integers in special residue classes (11N69)

Review text

Let \(A(1),\dots,A(N)\) be a sequence of integers such that \(a(n)=A(N)/A(N-1)\) has certain prescribed arithmetic or algebraic properties. The authors estimate from above the number \(T(x,y;p,b)\) of solutions of integers \(n\) of the congruence \(A(n)\equiv b\pmod p\), \(y<n\leq x\leq N\), with \(p\) a prime. In particular, they consider the case where \(a(n)\) is polynomial in \(n\), the \(n\)th prime, a binomial or \(q\)-binomial coefficient or a middle binomial coefficient.

Recommendations

• scientific article; zbMATH DE number 991673
• On the roots of certain sequences of congruences
• О полиномиальных сравнениях
• The estimation of an upper bound for the number of solutions of a class of congruences
• On a linear homogeneous congruence

Cited in

(6)

• Numbers of solutions of congruences and rationality of generating functions
• The number of solutions of certain quintic congruences
• A note on the mean value of numbers of the solutions of \(x^\alpha\equiv 1\pmod n\)
• The estimation of an upper bound for the number of solutions of a class of congruences
• On the roots of certain sequences of congruences
• On the number of solutions of exponential congruences

This page was built for publication: Bounding the number of solutions of some congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493334)