Related papers: Universal sums of generalized pentagonal numbers
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
We show that the higher Pythagoras numbers for the polynomial ring are infinite $p_{2s}(K[x_1,x_2,\dots,x_n])=\infty$ provided that $K$ is a formally real field, $n\geq2$ and $s\geq 1$. This almost fully solves an old question \cite[Problem…
Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…
Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…
We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…
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 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…
In this paper, we study the set of positive integers that characterize the universality of $m$-gonal form.
Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Ap\'ery numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For…
We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…
Given that $a,b\in\mathbb N$, $c_0,c_1\in\mathbb Z$, $(c_0,c_1)\neq (0,0)$, and a generalized Fibonacci sequence $(s_n)_{n\geq 0}$ where $s_0 = c_0$, $s_1 = c_1$, and $s_{n+1}=as_{n}+bs_{n-1}$ for all positive integers $n$. In this paper,…
A number of the form $x(x+1)/2$ where $x$ is an integer is called a triangular number. Suppose, $N(a_1,\cdots,a_k;n)$ and $T(a_1,\cdots,a_k;n)$ denote the number of ways $n$ can be expressed as $\sum_{i=1}^k a_ix_i^2$ and $\sum_{i=1}^k…
We prove that the reciprocal sum $S_k(x)$ of the least common multiple of $k\geq 3$ positive integers in $\N\cap [1,x]$ satisfies $$ S_k(x)=P_{2^k-1}(\log x)+O(x^{-\theta_k+\epsilon}) $$ where $P$ is a polynomial of degree $2^k-1$ and…
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…
In this study, we find all Pell and Pell-Lucas numbers which are sums of three base 10 repdigits. The proof of our main theorem uses lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker-Davenport…
Let $X$ be a set of positive integers, and let $\mathbb Z_K$ be the ring of integers of a number field $K$ of degree $n$. Denote by $N(I)$ the absolute norm of an ideal $I$ of $\mathbb Z_K$, and by $\mathcal A$ the set of principal ideals…
For an integer $x$ let $t_x$ denote the triangular number $x(x+1)/2$. Following a recent work of Z. W. Sun, we show that every natural number can be written in any of the following forms with $x,y,z\in\Z$: $$x^2+3y^2+t_z, x^2+3t_y+t_z,…
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…
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…