Related papers: Products and sums divisible by central binomial co…

It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$

For nonnegative integers $j$ and $n$ let $\Theta(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are not divisible by $2^{j+1}$. In this paper we prove that the family $j\mapsto\Theta(j,n)$ usually follows a…

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

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…

For each $n=0,1,2,\ldots$, the central trinomial coefficient $T_n$ is the coefficient of $x^n$ in the expansion of $(x^2+x+1)^n$. Let $p>3$ be a prime, and let $n$ be any positive integer. In 2016, the second author conjectured that the…

Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom…

The following theorem is proved. {\bf Theorem.} {\it Let $P(x) = \sum_{k=0}^{2n} a_k x^k$ be a polynomial with positive coefficients. If the inequalities $\frac{a_{2k+1}^2}{a_{2k}a_{2k+ 2}} < \frac{1}{cos^2(\frac{\pi}{n+2})} $ hold for all…

For $n=0,1,2,\ldots$ let $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k}$. In this paper we illustrate the connection between $\{d_n^{(r)}(x)\}$ and Meixner polynomials. New formulas and recurrence relations for $d_n^{(r)}(x)$ are…

In this paper, we introduce relations between binomial sums involving (generalized) Fibonacci and Lucas numbers, and different kinds of binomial coefficients. We also present some relations between sums with two and three binomial…

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

The Super-Catalan numbers are a generalization of the Catalan numbers defined as $T(m,n) = \frac{(2m)!(2n)!}{2m!n!(m+n)!}$. It is an open problem to find a combinatorial interpretation for $T(m,n)$. We resolve this for $m=3,4$ using a…

In this note, we prove that for every two positive integers $m \geq n \geq 9$, there exist $n$ positive rational numbers whose product is 1 and sum is $m$.

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 prove effective finiteness results concerning polynomial values of the sums $$ b^k +\left(a+b\right)^k + \cdots + \left(a\left(x-1\right) + b\right)^k $$ and $$ b^k - \left(a+b\right)^k + \left(2a+b\right)^k - \ldots + (-1)^{x-1}…

In this article I present results from a statistical study of prime numbers that shows a behaviour that is not compatible with the thesis that they are distributed randomly. The analysis is based on studying two arithmetical progressions…

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

We use the symmetric product to describe the resultant scheme and discriminant scheme of polynomials two variables.

In this paper, we investigate some congruences involving sums of $\frac{d^{-k}{x\choose k}{x+k\choose k}}{{2k \choose k}}$, where $x$ be a $p$-adic integer, $k$ be a non-negative integer, and $d$ $(d\neq 0)$ be a rational number.