Diophantine approximation with mixed powers of primes

Diophantine approximation with mixed powers of primes
复制标题

素数混合幂的丢番图近似

DOI:
10.1007/s11139-021-00489-6
复制
发表时间:
2019
影响因子:
0.4
通讯作者:
Jing Huang
Jing Huang
中科院分区:
数学4区
文献类型:
--
作者:
Huafeng Liu;Jing Huang

文献摘要

被引文献

相似文献

设k为整数,k >= 3。设(1)(2)(3)是非零实数,不全是负数。假设(1)/(2)是无理数和代数的。设是一个间隔良好的序列,> 0。在本文中,我们证明了,对于任意ε > 0,当v <= X时,v的个数是nu的一个元素,使得不等式成立。竖条(1)p(1)(2) + (2)p(2)(2) + (3)p(3)(k) - v竖条< v(-)在素数p(1), p(2), p(3)不超过O(X1-2/(7m2(k))+2 +)的情况下没有解,其中m(2)(k)依赖于k。这改进了最近的一个结果。此外,我们简要地描述了一种类似的方法如何改进具有两个素数的平方,一个素数的立方和一个素数的k次幂的丢番图问题的先前结果。
Let k be an integer with k >= 3. Let lambda(1), lambda(2), lambda(3) be non-zero real numbers, not all negative. Assume that lambda(1)/lambda(2) is irrational and algebraic. Let nu be a well-spaced sequence, and delta > 0. In this paper, we prove that, for any epsilon > 0, the number of v is an element of nu with v <= X such that the inequality.vertical bar lambda(1)p(1)(2) + lambda(2)p(2)(2) + lambda(3)p(3)(k) - v vertical bar < v(-delta).has no solution in primes p(1), p(2), p(3) does not exceed O(X1-2/(7m2(k))+2 delta+epsilon) where m(2)(k) relies on k. This refines a recent result. Furthermore, we briefly describe how a similar method can refine a previous result on a Diophantine problem with two squares of primes, one cube of primes and one k-th power of primes.