Related papers: How to prove this polynomial always has integer va…

Expressions for the summation of the series involving the Laguerre polynomials \[S_m(\pm\nu, \pm p)\equiv e^{-x}\sum_{n=0}^\infty \frac{x^n\,L_n^{(\nu)}(x)}{(1\pm \nu\pm p)_n}\frac{(f+m)_n}{(f)_n}\] for any non-negative integers $m$ and $p$…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…

The $q$-binomial coefficients $\qbinom{n}{m}=\prod_{i=1}^m(1-q^{n-m+i})/(1-q^i)$, for integers $0\le m\le n$, are known to be polynomials with non-negative integer coefficients. This readily follows from the $q$-binomial theorem, or the…

Two conjectures of Su and Wang (2008) concerning binomial coefficients are proved. For $n\geq k\geq 0$ and $b>a>0$, we show that the finite sequence $C_j=\binom{n+ja}{k+jb}$ is a P\'{o}lya frequency sequence. For $n\geq k\geq 0$ and…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.

An integer-valued polynomial $P(x,y,z)$ is said to be universal (over $\mathbb Z$) if each nonnegative integer can be written as $P(x,y,z)$ with $x,y,z\in\mathbb Z$. In this paper, we mainly introduce a new technique to determine the…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

In this paper, the polynomials $P_a(x)=x^{2^l+1}+x+a$ with $a\in\mathrm{GF}(2^k)$ are studied. New criteria for the number of zeros of $P_a(x)$ in $\mathrm{GF}(2^k)$ are proved. In particular, a criterion for $P_a(x)$ to have exactly one…

We study the number of real zeros of finite combinations of $K+1$ consecutive normalized Hermite polynomials of the form $$ q_n(x)=\sum_{j=0}^K\gamma_j\tilde H_{n-j}(x),\quad n\ge K, $$ where $\gamma_j$, $j=0,\dots ,K$, are real numbers…

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

Let $m\geq 1$ and $a_m$ be integers. Let $\alpha$ be a rational number which is not a negative integer such that $\alpha = \frac{u}{v}$ with $\gcd(u,v) = 1, v>0$. Let $\phi(x)$ belonging to $\Z[x]$ be a monic polynomial which is irreducible…

In this article, we give a positive answer to a question posed in 1960 by D.S. Mitrinovi\'{c} and R.S. Mitrinovi\'{c} (see: D.S. Mitrinovi\'{c} et R.S. Mitrinovi\'{c}, Tableaux qui fournissent des polyn\^{o}mes de Stirling, Publications de…

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

In this work, we study asymptotic zero distribution of random multi-variable polynomials which are random linear combinations $\sum_{j}a_jP_j(z)$ with i.i.d coefficients relative to a basis of orthonormal polynomials $\{P_j\}_j$ induced by…

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…