English
Related papers

Related papers: Sums of even ascending powers

200 papers

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…

Number Theory · Mathematics 2007-05-23 D. R. Heath-Brown , J. -C. Puchta

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,…

Number Theory · Mathematics 2026-03-09 Geovane Matheus Lemes Andrade

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,…

Number Theory · Mathematics 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

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…

Number Theory · Mathematics 2024-01-04 Yuhui Liu

We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.

Number Theory · Mathematics 2022-11-17 Matteo Bordignon , Valeriia Starichkova

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

Number Theory · Mathematics 2017-12-21 Fouad Bounebirat , Diffalah Laissaoui , Mourad Rahmani

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

Number Theory · Mathematics 2012-07-05 Terence Tao

By developing the method of Wooley on the quadratic Waring-Goldbach problem, we prove that all sufficiently large even integers can be expressed as a sum of four squares of primes and 46 powers of 2.

Number Theory · Mathematics 2013-08-27 Lilu Zhao

We prove that every integer greater than two may be written as the sum of a prime and a square-free number.

Number Theory · Mathematics 2014-10-29 Adrian Dudek

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

Number Theory · Mathematics 2020-10-30 Jorge Urroz

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.

General Mathematics · Mathematics 2010-12-30 Danilo Mauro

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…

Number Theory · Mathematics 2026-05-19 Daniel R. Johnston , Tim Trudgian

The Strong Goldbach conjecture dates back to 1742. It states that every even integer greater than four can be written as the sum of two prime numbers. Since then, no one has been able to prove the conjecture. The only best known result so…

General Mathematics · Mathematics 2013-09-06 Redha Bournas

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

Number Theory · Mathematics 2017-07-24 Vandita Patel

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…

Number Theory · Mathematics 2024-02-06 Min Zhang , Jinjiang Li , Fei Xue

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

Classical Analysis and ODEs · Mathematics 2011-10-26 Armen Bagdasaryan

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

Number Theory · Mathematics 2026-05-05 Ethan S. Lee , Rowan O'Clarey

Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.

Number Theory · Mathematics 2019-07-19 Helmut Prodinger

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

General Mathematics · Mathematics 2025-08-05 Julius Stricker

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

Combinatorics · Mathematics 2017-03-02 Andrei K. Svinin
‹ Prev 1 2 3 10 Next ›