Related papers: On Additive Representations of Integers by Binomia…

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…

We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower…

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

In this article we further develop methods for representing integers as a sum of three cubes. In particular, a barrier to solving the case $k=3$, which was outlined in a previous paper of the second author, is overcome. A very recent…

Suppose $k$ is a positive integer. In this work, we establish formulas for for the number of representations of integers by the quadratic forms $$ x_{1}^{2}+\cdots+x_{k}^{2}+l\left(x_{k+1}^{2}+\cdots+x_{2k}^{2}\right) $$ for $l\in\{2,4\}$.

In this paper, we prove the identity $$\lcm\{\binom{k}{0}, \binom{k}{1}, >..., \binom{k}{k}\} = \frac{\lcm(1, 2, ..., k, k + 1)}{k + 1} (\forall k \in \mathbb{N}) .$$ As an application, we give an easily proof of the well-known nontrivial…

We prove a conjecture posted in the Online Encyclopedia of Integer Sequences, namely that there are exactly five positive integers that can be written in more than one way as the sum of a nonnegative power of 2 and a nonnegative power of 3.…

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…

We propose an explicit representation of central $(2k+1)$-nomial coefficients in terms of finite sums over trigonometric constructs. The approach utilizes the diagonalization of circulant boolean matrices and is generalizable to all…

Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…

A "practical number" is a positive integer $n$ such that every positive integer less than $n$ can be written as a sum of distinct divisors of $n$. We prove that most of the binomial coefficients are practical numbers. Precisely, letting…

Given an infinite sequence of positive integers $\cA$, we prove that for every nonnegative integer $k$ the number of solutions of the equation $n=a_1+...+a_k$, $a_1,\,..., a_k\in \cA$, is not constant for $n$ large enough. This result is a…

Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.

In this paper we prove several inequalities for binomial coefficients. For instance, if $ k$ and $n$ are positive integers such that $n\ge 400$ and $[\frac n5]\le k\le [\frac n2]$, where $[x]$ is the greatest integer not exceeding $x$, then…

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…