2025/05/26 by Guo, Lingyu, Guo, Victor Zhenyu, Lu, Li
#FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2505.19833
One of the best approaches to the Goldbach conjectures is the Chen's theorem, showing that every large enough even integer can be represented by a sum of a prime and a 2-almost prime. In this article, we consider a thinner set than the set of 2-almost primes, which is ℙ(c)=(\lfloor pc \rfloor)p∈ ℙ (cgt;0,c∉ ℕ), where ℙ is the set of prime numbers and \lfloor ⋅ \rfloor is the floor function. We prove that for all c ∈ (0,(13)/(15)), any large enough integer N can be represented as N=\lfloor pc\rfloor+q, where p and q are primes. Moreover, for almost all c ∈ (0, M) and large enough N where M ≪ log N/ loglog N, we also prove that N ∈ ℙ(c) + ℙ. It is well known that the twin prime conjecture can be approached by a similar way to the Goldbach conjecture with a different form of the Chen's theorem. We also prove similar results due to the set ℙ(c) with both an unconditional case and an average case based on the Lebesgue measure, which also improve a theorem by Balog.