Related papers: Some new primality criteria based on Lucas sequenc…
Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…
We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…
For integers $k \geq 2$ and $n \neq 0$, let $v_k(n)$ denotes the greatest nonnegative integer $e$ such that $k^e$ divides $n$. Moreover, let $u_n$ be a nondegenerate Lucas sequence satisfying $u_0 = 0$, $u_1 = 1$, and $u_{n + 2} = a u_{n +…
The Skolem Problem asks, given a linear recurrence sequence $(u_n)$, whether there exists $n\in\mathbb{N}$ such that $u_n=0$. In this paper we consider the following specialisation of the problem: given in addition $c\in\mathbb{N}$,…
In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…
We study the distribution modulo one of linear recurrent sequences of real numbers. We prove criteria for the finiteness of the set of limit values of the fractional parts of such a sequence and give lower bounds for the maximal distance…
We study the limiting behavior of $\Tr U^{k(n)}$, where $U$ is a $n\times n$ random unitary matrix and $k(n)$ is a natural number that may vary with $n$ in an arbitrary way. Our analysis is based on the connection with Toeplitz…
By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
We survey recent results beyond equidistribution of sequences modulo one. We focus on the sequence of angles in a Euclidean lattice in $\mathbb R^2$ and on the sequence $\sqrt n\bmod1 $.
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. For an integer $m$,…
Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…
In this paper, we consider properties of coefficients of a generating functions composition, where the outer function is a logarithmic generating function and the inner function is an ordinary generating function with integer coefficients.…
We have known that most sequences in $\mathcal{M}=\{1,2,\dots, M\}$ with length $n$ will miss $Me^{-\lambda}$ of the total numbers of $\{1,2,\dots,M\}$ as the ratio $n/M$ tends to $\lambda$. Now we consider a more general case where the…
By use of a modified Nunokawa's lemma, we obtain some new conditions for univalence. Also, some sharp inequalities concerning univalent functions are presented.
This paper first proves what the author called the Eight Levels Theorem and then highlights a new explicit expansion approach to Lucas-Lehmer primality test for Mersenne primes and gives a new criterion for Mersenne compositeness. Also, we…
The goal of this paper is twofold: (1) extend theory on certain statistics in the Fibonacci and Lucas sequences modulo $m$ to the Lucas sequences $U := \left(U_n(p,q)\right)_{n \geq 0}$ and $V := \left(V_n(p,q)\right)_{n \geq 0}$, and (2)…