Related papers: Sums of even ascending powers
Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and…
Suppose that some harmonic analysis arguments have been invoked to show that the indicator function of a set of residue classes modulo some integer has a large Fourier coefficient. To get information about the structure of the set of…
Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…
In this note we consider the theorem established in arXiv:1912.07171 concerning the sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and show that it can be used to demonstrate the classical theorem of…
We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…
What is a general expression for the sum of the first n integers, each raised to the mth power, where m is a positive integer? Answering this question will be the aim of the paper....We will take the unorthodox approach of presenting the…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
In $1963$ Graham proved that every positive integer $n \ge 78$ can be written as a sum of distinct positive integers $a_1, a_2, \ldots, a_r$ for which $\frac{1}{a_1} + \frac{1}{a_2} + \ldots + \frac{1}{a_r}$ is equal to $1$. In the same…
The aim of this note is to show that any even perfect number, other than $6$, can be written as the sum of 5 cubes of natural numbers. We also conjecture that any even perfect number, other than $6$, can be written as the sum of only 3…
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…
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…
This paper presents a combinatorial study of sums of integer powers of the cotangent which is a popular theme in classical calculus. Our main tool the realization of cotangent values as eigenvalues of a simple self-adjoint matrix with…
We prove that every sufficiently large odd integer is a sum of two positive squares and a prime. Let R(n) be the number of representations n = x^2 + y^2 + p with x, y >= 1 and p prime. We show that R(n) > 0 for all odd n >= n0 and obtain…
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…
For an arbitrary integer $x$, an integer of the form $T(x)\!=\!\frac{x^2+x}{2}$ is called a triangular number. Let $\alpha_1,\dots,\alpha_k$ be positive integers. A sum $\Delta_{\alpha_1,\dots,\alpha_k}(x_1,\dots,x_k)=\alpha_1…
In 1914, Kempner proved that the series 1/1 + 1/2 + ... + 1/8 + 1/10 + 1/11 + ... + 1/18 + 1/20 + 1/21 + ... where the denominators are the positive integers that do not contain the digit 9, converges to a sum less than 90. The actual sum…
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…