Results 61 to 70 of about 5,332 (130)
Consecutive Piatetski-Shapiro primes based on the Hardy-Littlewood conjecture
We add a new section also with more data analysis.
Guo, Victor Zhenyu, Yi, Yuan
openaire +2 more sources
The Hardy-Littlewood Prime K-Tuple Conjecture Is False
Using Jiang function we prove Jiang prime k -tuple theorem. We prove that the Hardy-Littlewood prime k -tuple conjecture is false. Jiang prime k -tuple theorem can replace the Hardy-Littlewood prime k -tuple conjecture. (A) Jiang prime k -tuple theorem [1, 2]. We define the prime k -tuple equation , i p p n + , (1) where 2 , 1, 1 i n i k = − L .
openaire +1 more source
The approximate functional equation of some Diophantine series. [PDF]
Chamizo F, Martin B.
europepmc +1 more source
Generalising the Hardy-Littlewood Method for Primes
The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der
Green, Ben
core +2 more sources
Simple Proof of the Hardy–littlewood Conjecture
The Hardy–Littlewood conjecture suggests that every odd integer 2n + 1 greater than or equal to 7 is the sum of three prime numbers, two of which are equal. In this paper, we present a simple approach that attempts to prove this conjecture.
openaire +1 more source
Extreme values of derivatives of the Riemann zeta function. [PDF]
Yang D.
europepmc +1 more source
Applying Discrete Fourier Transform to the Hardy-Littlewood Conjecture
We study the asymptotic behaviour of the prime pair counting function $ _{2k}(n)$ by the means of the discrete Fourier transform on $\mathbb{Z}/ n\mathbb{Z}$. The method we develop can be viewed as a discrete analog of the Hardy-Littlewood circle method.
openaire +2 more sources
A fractional version of Rivière's GL(n)-gauge. [PDF]
Da Lio F, Mazowiecka K, Schikorra A.
europepmc +1 more source

