|
Kloosterman Sums with Primes and Solvability of a Congruence with Inverse Residues
M. A. Korolev Steklov Mathematical Institute of Russian Academy of Sciences, ul. Gubkina 8, Moscow, 119991 Russia
Abstract:
The problem of the solvability of the congruence $g(p_1)+\dots +g(p_k)\equiv m\pmod {q}$ in primes $p_1,\dots ,p_k\leq N$, $N\leq q^{1-\gamma }$, $\gamma >0$, is addressed. Here $g(x)\equiv a\overline {x}+bx\pmod {q}$, $\overline {x}$ is the inverse of the residue $x$, i.e., $\overline {x}x\equiv 1\pmod {q}$, $q\geq 3$, and $a$, $b$, $m$, and $k\geq 3$ are arbitrary integers with $(ab,q)=1$. The analysis of this congruence is based on new estimates of the Kloosterman sums with primes. The main result of the study is an asymptotic formula for the number of solutions in the case when the modulus $q$ is divisible by neither $2$ nor $3$.
Received: June 2, 2020 Revised: October 19, 2020 Accepted: November 1, 2020
Citation:
M. A. Korolev, “Kloosterman Sums with Primes and Solvability of a Congruence with Inverse Residues”, Analytic and Combinatorial Number Theory, Collected papers. In commemoration of the 130th birth anniversary of Academician Ivan Matveevich Vinogradov, Trudy Mat. Inst. Steklova, 314, Steklov Math. Inst., Moscow, 2021, 103–133; Proc. Steklov Inst. Math., 314 (2021), 96–126
Linking options:
https://www.mathnet.ru/eng/tm4164https://doi.org/10.4213/tm4164 https://www.mathnet.ru/eng/tm/v314/p103
|
Statistics & downloads: |
Abstract page: | 241 | Full-text PDF : | 29 | References: | 43 | First page: | 4 |
|