Related papers: Lucas' theorem: its generalizations, extensions an…

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)…

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

We describe an explicit generalized Lucasian test to determine the primality of numbers $h\cdot2^n\pm1$ when $h\nequiv0\pmod{17}$. This test is by means of fixed seeds which depend only on $h$. In particular when $h=16^m-1$ with $m$ odd,…

Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

In this paper, we study the combinatorial sum $$\sum_{k\equiv r(\mbox{mod }m)}{n\choose k}a^k.$$ By studying this sum, we obtain new congruences for Lucas quotients of two infinite families of Lucas sequences. Only for three Lucas…

Harmonic numbers $H_k=\sum_{0<j\le k}1/j (k=0,1,2,...)$ arise naturally in many fields of mathematics. In this paper we initiate the study of congruences involving both harmonic numbers and Lucas sequences. One of our three theorems is as…

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

In this work, we prove that many Ap\'ery-like sequences arising from modular forms satisfy the Lucas congruences modulo any prime. As an implication, we completely affirm four conjectural Lucas congruences that were recently posed by S.…

In this paper, we extend the $p$-adic valuations originally obtained by Carmichael for the sequences obtained by applying M\"obius inversion to Lucas sequences to $p$-adic congruences, from which we immediately derive corresponding…

In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed…

The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

For a class of Lucas sequences ${x_n}$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n = 1, 2, 3 or 6$. This has several desirable consequences.

In this paper we deduce some new supercongruences modulo powers of a prime $p>3$. Let $d\in\{0,1,\ldots,(p-1)/2\}$. We show that $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{2k}{k+d}}{8^k}\equiv 0\ (\mbox{mod}\ p)\ \ \ \mbox{if}\ d\equiv…

Let $\mathbf{u} = (u_n)_{n \geq 0}$ be a Lucas sequence, that is, a sequence of integers satisfying $u_0 = 0$, $u_1 = 1$, and $u_n = a_1 u_{n - 1} + a_2 u_{n - 2}$ for every integer $n \geq 2$, where $a_1$ and $a_2$ are fixed nonzero…

We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…

In 1977, Hugh Williams studied Lucas pseudoprimes to all Lucas sequences of a fixed discriminant. These are composite numbers analogous to Carmichael numbers and they satisfy a Korselt-like criterion: $n$ must be a product of distinct…

We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x…