Related papers: Identically vanishing $k$-generalized Fibonacci po…

The aim of this paper consists of providing summation formulas for the $k$-Fibonacci numbers ($k \in \mathbb{Z}$, $k \geq 2$) and their asymptotic equivalents in terms of generalized binomial coefficients. Our main tools are the Lagrange…

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…

We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…

In this paper, we prove that if $f(x)=\sum_{k=0}^n{n\choose k}a_kx^k$ is a polynomial with real zeros only, then the sequence $\{a_k\}_{k=0}^n$ satisfies the following inequalities $a_{k+1}^2(1-\sqrt{1-c_k})^2/a_k^2…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

We confirm Sun's conjecture that $(\root{n+1}\of{F_{n+1}}/\root{n}\of{F_n})_{n\ge 4}$ is strictly decreasing to the limit 1, where $(F_n)_{n\ge0}$ is the Fibonacci sequence. We also prove that the sequence…

We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…

Let $K$ be a field and $f _{n}(X) = (X + 1) ^{n} + (-1) ^{n}(X ^{n} + 1) \in K[X]$, for each $n \in \mathbb N$. This note shows that the polynomials $f _{m}(X)$ and $f _{m'}(X)$ are relatively prime, for some distinct indices $m$ and $m…

We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.

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…

We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.

We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

For every $m\in\mathbb{N}$, we establish the convergence of the averaged distributions of the zeros of the $m$-th order derivatives $(f^n)^{(m)}$ of the iterated polynomials $f^n$ of a polynomial $f\in\mathbb{C}[z]$ of degree $>1$ towards…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

Let a_n(k) be the kth coefficient of the nth cyclotomic polynomial Phi_n(x). As n ranges over the integers, a_n(k) assumes only finitely many values. For any such value v we determine the density of integers n such that a_n(k)=v. Also we…

We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) =…

It is well known that Pascal's triangle exhibits fractal behavior when reduced modulo a prime. We show that the triangle of Fibonomial coefficients has a similar nature modulo two. Specifically, for any $m \ge 0$, the subtriangle consisting…

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…