Related papers: Sums of even ascending powers

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…

Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

We investigate the existence of representations of every large positive integer as a sum of $k$-th powers of integers represented as certain diagonal forms. In particular, we consider a family of diagonal forms and discuss the problem of…

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

We show that every sufficiently large $x\equiv 3(4)$ can be written as the sum of three primes, each of which is a sum of a square and a prime square. The main tools are a transference version of the circle method and various sieve related…

We generalize two well-known enumerative facts. The first, due to Clebsch, says that a general binary sextic form is expressible as the sum of a cube and a square in 40 different ways. The second, due to Zariski and later Vakil, states that…

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is congruent to 2 mod 4. This result, together with a recent proof for 4|N, shows that the conjecture is true for all even N.

Using completely elementary methods, we find all powers of 3 that can be written as the sum of at most twenty-two distinct powers of 2, as well as all powers of 2 that can be written as the sum of at most twenty-five distinct powers of 3.…

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

In 1963, Graham proved that all integers greater than 77 (but not 77 itself) can be partitioned into distinct positive integers whose reciprocals sum to 1. He further conjectured that for any sufficiently large integer, it can be…

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A…

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…

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

We give a new proof of Vinogradov's three primes theorem, which asserts that all sufficiently large odd positive integers can be written as the sum of three primes. Existing proofs rely on the theory of L-functions, either explicitly or…

We present a common ground for infinite sums, unordered sums, Riemann/Lebesgue integrals, arc length and some generalized means. It is based on extending functions on finite sets using Hausdorff metric in a natural way.

For integer $g\ge 5$, we prove that any positive integer can be written as a sum of three palindromes in base $g$.