English
Related papers

Related papers: Almost-primes in Sun's $x^2+ny^2$ conjecture

200 papers

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2017-07-31 Angel Kumchev , Huafeng Liu

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Number Theory · Mathematics 2017-10-24 Kummari Mallesham

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

In this paper, we study partitions of positive integers with restrictions involving squares. We mainly establish the following two results (which were conjectured by Sun in 2013): (i) Each positive integer $n$ can be written as $n=x+y+z$…

Number Theory · Mathematics 2021-05-27 Chao Huang , Zhi-Wei Sun

We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…

Number Theory · Mathematics 2024-02-15 Jared Duker Lichtman

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

General Mathematics · Mathematics 2025-08-12 Kenneth A. Watanabe

In this paper, we used the principle of sieve function transformation to improve sieve method and the prime number theorem in the arithmetic sequence.For this, we proved General Riemann Hypothesis and Riemann Hypothesis to be true. further,…

General Mathematics · Mathematics 2025-06-09 Jinzhu Han

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

Number Theory · Mathematics 2025-02-28 Kunjakanan Nath , Likun Xie

We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…

Number Theory · Mathematics 2026-05-12 Adrian Dudek , Lachlan Dunn

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…

Number Theory · Mathematics 2025-04-15 Takafumi Miyazaki , István Pink

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Number Theory · Mathematics 2026-03-03 Tigran Hakobyan

Recently, Z.-W. Sun made the following conjecture: for any odd prime $p$ and odd integer $m$, $$ \frac{1}{m^2{m-1\choose (m-1)/2}}\Bigg(\sum_{k=0}^{(pm-1)/2}\frac{{2k\choose k}}{8^k}…

Number Theory · Mathematics 2019-12-18 Victor J. W. Guo

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

Number Theory · Mathematics 2016-03-17 Yan Kun , Li Hou Biao

All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…

General Mathematics · Mathematics 2008-01-08 Fu-Gao Song

We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erd\"os and Renyi.

Number Theory · Mathematics 2011-05-09 Jan-Christoph Schlage-Puchta

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

Number Theory · Mathematics 2025-06-24 Chen Wang , Sheng-Jie Wang

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

General Mathematics · Mathematics 2017-10-24 N. A. Carella

In this paper, we mainly prove the following conjectures of Z.-W. Sun \cite{S13}: Let $p>2$ be a prime. If $p=x^2+3y^2$ with $x,y\in\mathbb{Z}$ and $x\equiv1\pmod 3$, then $$x\equiv\frac14\sum_{k=0}^{p-1}(3k+4)\frac{f_k}…

Number Theory · Mathematics 2024-09-20 Guo-Shuai Mao , Yan Liu

We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…

Number Theory · Mathematics 2015-11-03 Andrew Granville , Dimitris Koukoulopoulos , Kaisa Matomäki