Related papers: Waring's Theorem for Binary Powers

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

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…

In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…

The Waring function $g(k,q)$ measures the difficulty of Waring's problem for $k$th powers in the field of $q$ elements. Its calculation seems to be difficult, and many partial results have been published, notably upper bounds for certain…

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. For every…

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

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

A conjecture of N. Terai states that for any integer $k>1$, the equation $x^2+(2k-1)^y =k^z$ has only one solution, namely, $(x, y, z) = (k-1, 1, 2).$ Using the structure of class groups of binary quadratic forms, we prove the conjecture…

The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…

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…

We give an estimate of exponential sums over singular binary quintic forms in a characteristic-free form, based on the Waring decomposition of binary forms. This extends the method on our preceding result on the space of binary quartics to…

Let $n$ be a positive integer. In 1915, Theisinger proved that if $n\ge 2$, then the $n$-th harmonic sum $\sum_{k=1}^n\frac{1}{k}$ is not an integer. Let $a$ and $b$ be positive integers. In 1923, Nagell extended Theisinger's theorem by…

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

It is shown that the set of palindromes is an additive basis for the natural numbers in any base. Specifically, we prove that every natural number can be expressed as the sum of $O(d)$ palindromes in base $d$.

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

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 the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1^{a_1},...,y_n^{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve…

For $n=0,1,2,\ldots$ let $W_n=\sum_{k=0}^{[n/3]}\binom{2k}k \binom{3k}k\binom n{3k}(-3)^{n-3k}$, where $[x]$ is the greatest integer not exceeding $x$. Then $\{W_n\}$ is an Ap\'ery-like sequence. In this paper we deduce many congruences…