中文
相关论文

相关论文: Four squares of primes and powers of 2

200 篇论文

We prove that every sufficiently large odd integer can be expressed as a sum of one square and fourteen fifth powers, all of primes. In addition, we establish that every sufficiently large even integer can be written as a sum of one square,…

数论 · 数学 2026-03-09 Geovane Matheus Lemes Andrade

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

数论 · 数学 2024-01-04 Yuhui Liu

In this paper, we show that every pair of large even integers satisfying certain necessary conditions can be expressed as a pair of one prime, one prime square, two prime cubes and 56 powers of 2.

数论 · 数学 2024-08-27 Liqun Hu , Siqi Liu

In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even number is the sum of two primes and at most $K$ powers of 2. Since then, this style of approximation has been considered for problems similar to…

数论 · 数学 2022-11-14 Shehzad Hathi

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

数论 · 数学 2024-02-06 Min Zhang , Jinjiang Li , Fei Xue

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

数论 · 数学 2007-05-23 D. R. Heath-Brown , J. -C. Puchta

In this paper, we prove that every pair of sufficiently large odd integers can be represented in the form of a pair of one prime, four prime cubes and $48$ powers of $2$.

数论 · 数学 2024-01-23 Xue Han , Huafeng Liu

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we…

数论 · 数学 2026-05-19 Daniel R. Johnston , Tim Trudgian

In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.

综合数学 · 数学 2010-12-30 Danilo Mauro

In this note, we try to understand the recent development on the Waring-Goldbach problem involving cubes of primes. Especially, we want to determine whether integers that are either primes, squares of primes, cubes of primes, or a cube of…

综合数学 · 数学 2022-01-20 Zhichun Zhai

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

数论 · 数学 2016-10-19 Dave Platt , Tim Trudgian

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

We examine the problem of writing every sufficiently large even number as the sum of two primes and at most $K$ powers of 2. We outline an approach that only just falls short of improving the current bounds on $K$. Finally, we improve the…

数论 · 数学 2015-07-02 Dave Platt , Tim Trudgian

In the present work we demonstrate that the so called Goldbach conjecture from 1742, All positive even numbers greater than two can be expressed as a sum of two primes, due to Leonhard Euler, is a true statement. This result is partially…

综合数学 · 数学 2007-05-23 P. H. Pereyra , B. E. J. Bodmann

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

数论 · 数学 2022-03-07 Xin Chen

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

数论 · 数学 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*}…

数论 · 数学 2018-01-03 Jinjiang Li , Min Zhang

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation…

数论 · 数学 2017-08-16 Jinjiang Li , Min Zhang

In this paper, it is proved that, for any $\gamma_1,\gamma_2,\gamma_3,\gamma_4,\gamma_5\in(\frac{28}{29},1)$, every sufficiently large integer $n$ subject to $n\equiv5\pmod{24}$ can be represented as the sum of five squares of primes, i.e.,…

数论 · 数学 2026-03-03 Meng Gao , Jinjiang Li , Linji Long , Min Zhang

We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$

综合数学 · 数学 2007-05-23 Shouyu Du , Zhanle Du
‹ 上一页 1 2 3 10 下一页 ›