Related papers: A binomial identity on the least prime factor of a…
Primality testing is an especially useful topic for public-key cryptography. In this paper, a novel primality test algorithm based on the Pell's cubic will be introduced, and its necessary primality conditions will be proved using three…
The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…
In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…
By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…
We prove a double binomial sum identity which differs from most binomial sum identities in that the summands involve the absolute value function. The identity is of interest because it can be used in proofs of lower bounds for the Hadamard…
For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…
We derive an identity that relates a class of multiple integrals involving Vandermonde polynomials to divided differences. Alternatively the identity can be viewed as an integral formula for divided differences. As part of the derivation we…
A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…
Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…
In this note, we provide a conceptual explanation of a well-known polynomial identity used in algebraic number theory.
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…
The ordinary factorial may be written in terms of the Stirling numbers of the second kind as shown by Quaintance and Gould and the odd double factorial in terms of the Stirling numbers of the first kind as shown by Callan. During the…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
Mendes recently conjectured an identity simplifying the Poincar\'e series of the space of equivariant polynomial maps from $\mathbb{R}^{n}$ to a subrepresentation of $Sym^{2}(\mathbb{R}^{n})$. We show how to prove this identity using a…
Let $B_{n}$ denote the Bernoulli numbers, and $S(n,k)$ denote the Stirling numbers of the second kind. We prove the following identity $$ B_{m+n}=\sum_{\substack{0\leq k \leq n \\ 0\leq l \leq m}}\frac{(-1)^{k+l}\,k!\, l!\,…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
We find the joint distribution of three simple statistics on lattice paths of n upsteps and n downsteps leading to a triple sum identity for the central binomial coefficient {2n}-choose-{n}. We explain why one of the constituent double sums…
We present an elementary identity for the cyclotomic polynomials $\Phi_n(X)$ which reflects a kind of multiplicative property of $\Phi_n(X)$ as a function of $n$, and we explore its connections with the properties of other arithmetical…
In this note, we will give a short proof of an identity for cubic partitions.