On the number of solutions of an $n$th degree congruence with one unknown
Sbornik. Mathematics, Tome 37 (1980) no. 2, pp. 151-166
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We show that the number of solutions to the congruence $f(x)\equiv 0\pmod m$, where $f(x)$ is a polynomial of degree $n\geqslant2$ whose coefficients have greatest common divisor relatively prime to $m$, does not exceed $(n/e+O(\ln^2 n))m^{1-1/n}$, where $n/e+O(\ln^2n)$ cannot be replaced by $n/e$. Bibliography: 5 titles.
[1] I. M. Vinogradov, Osnovy teorii chisel, izd-vo “Nauka”, Moskva, 1972 | MR
[2] E. Kamke, “Zur Arithmetik der Polynome”, Math. Z., XIX (1924), 247–264 | DOI | MR
[3] V. I. Nechaev, “Otsenka polnoi ratsionalnoi trigonometricheskoi summy”, Matem. zametki, 17:6 (1975), 839–849 | MR | Zbl
[4] S. B. Stechkin, “Otsenka polnoi ratsionalnoi trigonometricheskoi summy”, Trudy matem. in-ta im. V. A. Steklova, CXLIII, 1977, 188–207 | MR | Zbl
[5] V. N. Chubarikov, Kratnye trigonometricheskie summy, Kandidatskaya dissertatsiya, Moskva, 1977