Related papers: For which 2-adic integers $x$ can $\sum_k \binom x…
In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…
Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…
In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…
Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…
We develop a notion of cell decomposition suitable for studying weak p- adic structures (reducts of p-adic fields where addition and multiplication are not (everywhere) definable). As an example, we apply this to a language with restricted…
I considered definition and properties of polynomial in no-commutative algebra. There exists polynomial which has finite, infinite or empty set of roots. For instance, the polynomial $$p_1(x)=ix-xi-1$$ have no root and the polynomial…
We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…
Suppose that $f(x)=Ax^k$ mod $p$ is a permutation of the least residues mod $p$. With the exception of the maps $f(x)=Ax$ and $Ax^{(p+1)/2}$ mod $p$ we show that for fixed $n\geq 2$ the image of each residue class mod $n$ contains elements…
It is shown that the p-summing norm of any operator with n-dimensional domain can be well-aproximated using only ``few" vectors in the definition of the p-summing norm. Except for constants independent of n and log n factors, ``few" means n…
Let $t$ be a fixed parameter and $x$ some indeterminate. We give some properties of the generalized binomial coefficients $\genfrac{<}{>}{0pt}{}{x}{k}$ inductively defined by $k/x \genfrac{<}{>}{0pt}{}{x}{k}=…
In this work, we completely characterize (i) permutation binomials of the form $x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb{F}_{2^n}[x], n = 2^st, a \in \mathbb{F}_{2^{2t}}^{*}$, and (ii) permutation trinomials of the form…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Assume that $v_p(f(n))\ge s_1$ and $v_p(g(n))\ge s_2$ hold for all integers $n$ for some $s_1, s_2$ fixed non-negative integers. Let $S$ denote…
We consider summation of some finite and infinite functional p-adic series with factorials. In particular, we are interested in the infinite series which are convergent for all primes p, and have the same integer value for an integer…
Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…
Let $m>2$ and $q>0$ be integers with $m$ even or $q$ odd. We show the supercongruence $$\sum_{k=0}^{p-1}(-1)^{km}\binom{p/m-q}{k}^m\equiv0\pmod{p^3}.$$ for any prime $p>mq$. This confirms a conjecture of Sun.
We introduce a new conjecture on products of two distinct primes that would provide a partial answer to a conjecture of McIntosh. Also, $\binom{2p-1}{p-1}-1$ is written in terms of a polynomial in prime $p$ over the integers and we discuss…
We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…
Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…
In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…