一个素变数丢番图不等式

本文证明了如果1相似文献   

一个素变数丢番图不等式

本文证明了如果１＜ｃ＜２３７／２１４，则对于充分大的Ｎ和ε≥Ｎ－１／５（２３７／２１４－ｃ）＋ｖ（ｖ＞０）表达式Ｄ（Ｎ）：＝Σ｜ｐｃ１＋ｐｃ２＋ｐｃ３－Ｎ｜＜－εｌｏｇｐ１ｌｏｇｐ２ｌｏｇｐ３ 关于素变数ｐ１，ｐ２，ｐ３有渐近公式，改进了文献［１］的结果１＜Ｃ＜１．１．     

一个有关素数幂的三元丢番图不等式（英文）

令1 1~c+p₂~c+p₃~c-N|1,p₂,p₃是可解的.这个结果改进了蔡迎春[Int.J.Number Theory,2018,14(8):2257-2268]的结果.     

算术数列中的素变数丢番图逼近

证明了:设λ1,λ2,λ3是非零实数,并且不同一符号,η是实数,λ1/λ2是无理数,h是一个给定的正整数,l1,l2,l3是整数,如果广义黎曼猜想成立,那么有无穷多有序素数对p1,p2,p3(pj≡lj(mod h),j=1,2,3)使得|λ1p1 λ2p2 λ3p3 η|＜(max pj)-(1)(10)(log max pj)5.     

一个素变数丢番图方程

证明了如果 １＜ｃ＜２５８／２３５，则素变数丢番图方程对充分大的 Ｎ是可解的，改进了 Ｋｕｍｃｈｅｖ和 Ｎｅｄｅｖａ的结果 １＜ｃ＜１２／１１．     

混合幂的素变数丢番图逼近

证明了:如果λ_1,λ_2,λ_3,λ_4是正实数,λ_1/λ_2是无理数和代数数,V是well-spaced序列,δ0,那么对于v∈V,v≤X,ε0,使得|λ_(1p_1~2)+λ_(2p_2~2)+λ_(3p_3~3)+λ_(4p_4~3)-v|v~(-δ)没有素数解p1,p2,p3,p4的v的个数不超过O(X~(20/21+21δ+ε)).     

有关殆素数的二元丢番图不等式

Pr表示最多r个素因子的正整数.作者证明了,对于任一足够大的实数N和1＜c＜c0,不等式|pc+Pcr-N|＜N9/10(1-c0/c)对素数p和Pr是可解的.特别地,当1＜c＜c0=1.03074432…,有r=6.这个结果改进了翟文广和曹晓东的结果.     

混和幂的丢番图不等式（I）

本文证明了下面的定理设λ＿１，…，λ＿８为非零实数，其中至少有两个之比为无理数。ｋ＝４，５，…，１１。那么，对任意给定的实数ｋ及０＜σ＜σ＿ｋ，不等式有无穷多组整数解，这里（４ｋ１１）。     

非整指数的丢番图不等式

本文证明了如下结果：设非零实数λ１，…，λｓ不具有同样的符号、其中至少有两数之比为无理数．设ｋ＞１２且ｋ不是整数，则存在一个绝对常数ｃ＞０，使得如果ｓ≥ｃｋｌｏｇｋ，则对任意实数。及ε＞０，不等式有无穷多组正整数解ｘｉ，这里［ｙ］表示ｙ的整数部分．     

Systems of diagonal Diophantine inequalities

We treat systems of real diagonal forms of degree , in variables. We give a lower bound , which depends only on and , such that if holds, then, under certain conditions on the forms, and for any positive real number , there is a nonzero integral simultaneous solution of the system of Diophantine inequalities for . In particular, our result is one of the first to treat systems of inequalities of even degree. The result is an extension of earlier work by the author on quadratic forms. Also, a restriction in that work is removed, which enables us to now treat combined systems of Diophantine equations and inequalities.

     

Diophantine inequalities over Piatetski-Shapiro primes

Let c>1 and : We study the solubility of the Diophantine inequality in Piatetski-Shapiro primes p₁,p₂, .., p_s of the form p_j=[m^{\gamma }] for some m\in \mathbb{N}, and improve the previous results in the cases s = 2, 3, 4.     

Diophantine Equations and Bernoulli Polynomials

Given m, n 2, we prove that, for sufficiently large y, the sum 1 ⁿ +···+ y ⁿ is not a product of m consecutive integers. We also prove that for m n we have 1 ^m +···+ x ^m 1 ⁿ +···+ y ⁿ , provided x, y are sufficiently large. Among other auxiliary facts, we show that Bernoulli polynomials of odd index are indecomposable, and those of even index are almost indecomposable, a result of independent interest.     

一个二元丢番图不等式

本文证明了如果1相似文献   

混和幂的丢番图不等式(Ⅱ)

本文证明了下面的 定理设λ１，…，λ７为非零实数，其中至少有两个之比为无理数，则对任意实数κ及０＜σ＜１／３６不等式有无穷乡组整数解（ｘ１，…，ｘ７）．这是陆鸣皋教授的一个结果对丢番图不等式的类似．     

素变量混合幂丢番图逼近

设λ_1,λ_2,λ_3,λ_4是正实数,λ_1/λ_2是无理数和代数数,V是具有良好间隔的序列,δ0.证明了:对于任意的ε0及v∈ν,v≤X,使得λ_1p_1~2+λ_2p_2~2+λ_3p_3~3+λ_4p_4~3-v|v~(-δ)没有素数解p_1,p_2,p_3,p_4的v的个数不超过O(X~((67)/(72)+2δ+ε)).这改进了之前的结果.     

素变量混合幂丢番图逼近

设λ_1,λ_2,λ_3,λ_4为不全为负的非零实数,λ_1/λ_2是无理数和代数数.■是具有良好间隔的序列,δ>0.本文证明了:对于任意ε>0及v∈■,v≤X,使得不等式|λ_1p_1~2+λ_2p_2~2+λ_3p_3~3+λ_4p_4~3-v|相似文献   

关于两个素数和一个素数k次幂的丢番图不等式

令■设λ_1,λ_2,λ_3是不全同号的非零实数,且满足λ_1/λ_2为无理数,则对于任意实数η和ε 0,不等式■有无穷多组素数解p_1,p_2,p_3.该结果改进了Gambini,Languasco和Zaccagnini的结果.     

On the Waring-Goldbach Problem for Fourth and Fifth Powers

It is shown that every sufficiently large integer congruentto 14 modulo 240 may be written as the sum of 14 fourth powersof prime numbers, and that every sufficiently large odd integermay be written as the sum of 21 fifth powers of prime numbers.The respective implicit bounds 14 and 21 improve on the previousbounds 15 (following from work of Davenport) and 23 (due toThanigasalam). These conclusions are established through themedium of the Hardy-Littlewood method, the proofs being somewhatnovel in their use of estimates stemming directly from exponentialsums over prime numbers in combination with the linear sieve,rather than the conventional methods which ‘waste’a variable or two by throwing minor arc estimates down to anauxiliary mean value estimate based on variables not restrictedto be prime numbers. In the work on fifth powers, a switchingprinciple is applied to a cognate problem involving almost primesin order to obtain the desired conclusion involving prime numbersalone. 2000 Mathematics Subject Classification: 11P05, 11N36,11L15, 11P55.