Bounding the number of solutions of some congruences (Q2493334)

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.