scientific article; zbMATH DE number 3918457
Applying Vinogradov's method the following theorem is proved. Let \(k,n,X\) be natural numbers, \(1\leq k<n\); \(f(x)=\alpha_kx^k+\ldots+\alpha_1x\) a polynomial with real coefficients, \(\alpha_k\neq 0\); \(\varepsilon >0\) a real number \[ \varepsilon_1=\varepsilon k/n(n+\varepsilon);\quad \delta_1=| \alpha_k^{1/n}| X^{-k/(n+\varepsilon)+\varepsilon_1};\quad \delta_2=| \alpha_k^{1/n}| X^{- 1+k/(n+\varepsilon)+2\varepsilon_ 1}, \] \[ X\geq \max \left((6 | \alpha_ k^{1/n}|)^{n(1+2\varepsilon)/k}, (6 | \alpha_ k^{1/n}|)^{1+k/(n(1-\varepsilon)-k)}\right). \] Let \(N\) and \(N_ 1\) denote the number of solutions \[ \| f(x)^{1/n}\| \leq 3\delta_ 1,\quad if\quad 1\leq k\leq n/2,\quad \| f(x)^{1/n}\| \leq 3\delta_ 2,\quad if\quad n/2<k<n, \] respectively, in integers \(X\leq x<X+X^{1- k/(n+\varepsilon)}\), where \(\| z\|\) denotes the distance of z to the nearest integer. Then \[ N=6 | \alpha_ k^{1/n}| X^{1- 2k/(n+\varepsilon)+\varepsilon_ 1}+O(X^{1-2k/(n+\varepsilon)} \log X),\quad N_ 1=6 | \alpha_ k^{1/n}| X^{2\varepsilon_ 1}+O(X^{\varepsilon_ 1} \log X), \] but the second equality is true only if \((k-1)\max_{1\leq j\leq k-1}| \alpha_ j\alpha_ k^{-1}| \leq 1\).
- scientific article; zbMATH DE number 4069010
- Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations
- AN ASYMPTOTIC FORMULA FOR THE NUMBER OF SOLUTIONS OF A DIOPHANTINE EQUATION
- scientific article; zbMATH DE number 3335214
- Asymptotic behavior of the number of solutions for non-archimedean Diophantine approximations with restricted denominators
- Weak asymptotics for the numbers of solutions of Diophantine problems
- scientific article; zbMATH DE number 3741487
- scientific article; zbMATH DE number 3981276
- On the number of solutions of certain linear Diophantine equations
- Explicit estimates of solutions of some Diophantine equations
- Une estimation asymptotique du nombre de solutions approchées d'une équation p-adique. (Asymptotic estimation of the number of approximate solutions of a p-adic equation)
- The asymptotic number of solutions of a diophantine equation from coding theory
- Asymptotic aspects of the Diophantine equation $p^{k}x^{nk} - z^{k} = l$
- AN ASYMPTOTIC FORMULA FOR THE NUMBER OF SOLUTIONS OF A DIOPHANTINE EQUATION
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3695331)