Related papers: Relations de r\'ecurrence lin\'eaires, primitivit\…

We investigate the existence, non-existence, uniqueness, and multiplicity of positive solutions to the following problem: \begin{align}\label{P} \left\{ \begin{array}{l} D_{0+}^\alpha u + h(t)f(u) = 0, \quad 0<t<1, \\[1ex] u(0)=u(1)=0,…

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

Benford's law describes a common phenomenon among many naturally occurring data sets and distributions in which the leading digits of the data are distributed with the probability of a first digit of $d$ base $B$ being…

The aim of this paper is to investigate the dynamics of a higher order system of rational difference equations. Our concentration is on boundedness character, the oscillatory, the existence of unbounded solutions and the global behavior of…

Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…

Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

The van der Laan-Padovan sequence $P_n ~ (n=0, 1, \ldots)$ is defined by $P_0=1, P_1=P_2=0$, and $P_{n+3}=P_{n+1}+P_n$ for $n=0, 1, \ldots$. We determine all pairs $(P_m, P_n)$ satisfying $P_m^b=2^{g_1} 3^{g_2} 5^{g_3} 7^{g_4} P_n^a$ for…

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Let $(d_n)$ be a sequence of positive numbers and let $(X_n)$ be a sequence of positive independent random variables. We provide an upper bound for the deviation between the distribution of the mantissaes of $(X_n^{d_n})$ and the Benford's…

We investigate the boundedness of solutions of the first order linear difference equation of the form $x_{n+1} = Ax_{n} + y_{n}, \; n \geq 1$ where $A$ is a square matrix with complex entries, sequence $\{y_{n}\}_{n\geq 1}$ and initial…

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we…

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

Zeckendorf's theorem states every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. This result has been generalized to many sequences $\{a_n\}$ arising from an integer positive linear recurrence, each…

Second order recurrence relations of real numbers arise form various applications in discrete time dynamical systems as well as in the context on Markov chains. Solutions to the recurrence relations are fully defined by the first two…

We classify integer abc-equations c = a + b (to be defined), according to their radical R(abc) and prove that the resulting equivalence classes contain only a finite number of such equations. The proof depends on a 1933 theorem of Kurt…

We study the combinatorial and algebraic properties of Nonnegative Matrices. Our results are divided into three different categories. 1. We show a quantitative generalization of the 100 year-old Perron-Frobenius theorem, a fundamental…