Related papers: Integer Powers Expressed as Nested Sums of Lower P…

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

The generalized Waring problem asks exactly which positive integers cannot be expressed as the sum of $j$ positive $k$-th powers? Using computational techniques, this paper refines an approach introduced by Zenkin, establishes results for…

A positive integer $N$ is \emph{palindromic in the base $b$} when $N = \sum_{i=0}^{k} c_i b^i$, $c_k\neq 0$,and $c_i=c_{k-i},\; i=0,1,2,...,k$, Focusing on powers of 2, we investigate the smallest base $b$ when $N=2^n$ is palindromic in the…

We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce…

By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…

Newton's identities provide a way to express elementary symmetric polynomials in terms of power polynomials over fields of characteristic zero. In this article, we study the failure of this relation in positive characteristic and what can…

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…

We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), Ernvall-Metsankyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power…

Let k>2 be a fixed integer exponent and let \theta > 9/10. We show that a positive integer N can be represented as a non-trivial sum or difference of 3 k-th powers, using integers of size at most B, in O(B^{\theta}N^{1/10}) ways, providing…

Romanov proved that a positive proportion of the integers have a representation as a sum of a prime and a power of an arbitrary fixed positive integer. Rieger proved the analogous result for number fields. We will determine an explicit…

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…

Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

We consider the $k$-nested sum of integer powers, $F(n,m,k)$, defined as repeated partial sums of the classical Faulhaber polynomials. We provide an explicit recurrence relation relating $F(n,m,k)$ to sums of lower power $m-1$ and higher…