Related papers: Almost universal ternary sums of pentagonal 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.

We show that for a large class of cubic polynomials $f$, every sufficiently large number can be written as a sum of seven positive values of $f$. As a special case, we show that every number greater than $e^{10^7}$ is a sum of seven…

In this paper we use the theory of modular forms to find formulas for the number of representations of a positive integer by certain class of quadratic forms in eight variables, viz., forms of the form $a_1x_1^2 + a_2 x_2^2 + a_3 x_3^2 +…

We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose…

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

In this article, we provide an explicit constant $C$ such that there is no regular ternary sum of generalized $m$-gonal numbers for any integer $m$ greater than $C$.

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

Let $a,b,c,d,e$ and $f$ be integers with $a\ge c\ge e>0$, $b>-a$ and $b\equiv a\pmod2$, $d>-c$ and $d\equiv c\pmod 2$, $f>-e$ and $f\equiv e\pmod2$. Suppose that $b\ge d$ if $a=c$, and $d\ge f$ if $c=e$. When $b(a-b)$, $d(c-d)$ and $f(e-f)$…

In this article, we consider weighted sums of generalized polygonal numbers with coefficients $1$ or $2$. We show that for any $m\ge10$, those weighted sums of generalized $m$-gonal numbers represent every non-negative integers if they only…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

We show that if there exists an integer subject to some congruence conditions that cannot be written as the sum of the norm of an ideal in $\mathbb{Z}[\exp(2\pi i/2^k)]$ and at most $k$ powers of $2$, $k\geq 3$, then there are infinitely…

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions $<x$ that have no adjacent terms,…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

For a subset $S$ of nonnegative integers and a vector $\mathbf{a}=(a_1,\dots,a_k)$ of positive integers, let $V'_S(\mathbf{a})=\{ a_1s_1+\cdots+a_ks_k : s_i\in S\} \setminus \{0\}$. For a positive integer $n$, let $\mathcal T(n)$ be the set…

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

For non-negative integers $a,b,$ and $n$, let $N(a, b; n)$ be the number of representations of $n$ as a sum of squares with coefficients $1$ or $3$ ($a$ of ones and $b$ of threes). Let $N^*(a,b; n)$ be the number of representations of $n$…

A (positive definite primitive integral) quadratic form is called odd-regular if it represents every odd positive integer which is locally represented. In this paper, we show that there are at most 147 diagonal odd-regular ternary quadratic…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…