AbstractThe asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D varies, is investigated. Quantitative estimates are obtained by means of exponential sums combined with sieve methods. As an application of the results it is shown that if an additive arithmetic function satisfies f(an + b) − f(cn + d) = O(1) for all positive integers n, ad ≠ bc, then f(n) = O((log n)3) must hold. This result is apparently the first bound of any kind in such a situation
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial s...
We obtain upper bounds on the number of solutions to congruences of the type (x1 + s)... (xv + s) ≡ ...
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial s...
AbstractThe asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D v...
Let p> 2 be a prime number. For each integer 0 < n < p, de¯ne n by the congruence nn ´ 1 (m...
For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through al...
AbstractFor any positive integer m we obtain the asymptotic formula,|B∩V′|=|B′|ϕ(m)+O(8ν(m)τ(m)(logm...
A regularity in the distribution of the solutions of the congruence f(X1,..., Xn) 0 (modp) is shown
AbstractA regularity in the distribution of the solutions of the congruence f(X1 ,…, Xn) 0 (modp) ...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
For a fixed integer s ≥ 1, we estimate exponential sums with harmonic sums [equation omitted for for...
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modu...
AbstractLetn>2 be an integer, and for each integer 0<a<nwith (a, n)=1, defineāby the congruenceaā≡1 ...
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modu...
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modu...
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial s...
We obtain upper bounds on the number of solutions to congruences of the type (x1 + s)... (xv + s) ≡ ...
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial s...
AbstractThe asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D v...
Let p> 2 be a prime number. For each integer 0 < n < p, de¯ne n by the congruence nn ´ 1 (m...
For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through al...
AbstractFor any positive integer m we obtain the asymptotic formula,|B∩V′|=|B′|ϕ(m)+O(8ν(m)τ(m)(logm...
A regularity in the distribution of the solutions of the congruence f(X1,..., Xn) 0 (modp) is shown
AbstractA regularity in the distribution of the solutions of the congruence f(X1 ,…, Xn) 0 (modp) ...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
For a fixed integer s ≥ 1, we estimate exponential sums with harmonic sums [equation omitted for for...
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modu...
AbstractLetn>2 be an integer, and for each integer 0<a<nwith (a, n)=1, defineāby the congruenceaā≡1 ...
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modu...
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modu...
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial s...
We obtain upper bounds on the number of solutions to congruences of the type (x1 + s)... (xv + s) ≡ ...
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial s...