Related papers: Supercongruences involving Lucas sequences

Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

We describe how to compute the intersection of two Lucas sequences of the forms $\{U_n(P,\pm 1) \}_{n=0}^{\infty}$ or $\{V_n(P,\pm 1) \}_{n=0}^{\infty}$ with $P\in\mathbb{Z}$ that includes sequences of Fibonacci, Pell, Lucas, and Lucas-Pell…

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…

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

The numbers we study in this paper are of the form $B_{n, p}(k)$, which is the number of binary words of length $n$ that contain the word $p$ (as a subsequence) exactly $k$ times. Our motivation comes from the analogous study of pattern…

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} ~(\bmod ~…

In this paper, we confirm several conjectures posed by Sun recently; for example, we prove that for any odd prime $p$ we have $$ \sum_{k=0}^{p-1}A_k\equiv\begin{cases}4x^2-2p\pmod{p^2}\quad&\text{if $p=x^2+2y^2\ (x,y\in\mathbb{Z})$},\\…

Let $n\geq 3$ be an integer and $p$ be a prime with $p\equiv 1\pmod{n}$. In this paper, we show that $${}_nF_{n-1}\bigg[\begin{matrix} \frac{n-1}{n}&\frac{n-1}{n}&\ldots&\frac{n-1}{n}\\ &1&\ldots&1\end{matrix}\bigg | \, 1\bigg]_{p-1}\equiv…

Let $p$ be a prime number. We say that a positive integer $n$ is a Sylow $p$-number if there exists a finite group having exactly $n$ Sylow $p$-subgroups. When $p=2$, every odd integer is a Sylow $2$-number. In contrast, when $p$ is odd,…

Let $\{A'_n\}$ be the Ap\'ery numbers given by $A'_n=\sum_{k=0}^n\binom nk^2\binom{n+k}k.$ For any prime $p\equiv 3\pmod 4$ we show that $A'_{\frac{p-1}2}\equiv \frac{p^2}3\binom{\frac{p-3}2}{\frac{p-3}4}^{-2}\pmod {p^3}$. Let $\{t_n\}$ be…

Determinants with Legendre symbol entries have close relations with character sums and elliptic curves over finite fields. In recent years, Sun, Krachun and his cooperators studied this topic. In this paper, we confirm some conjectures…

Let $B_n$ be the $n$-th balancing number. In this paper, we give some explicit expressions of $\sum_{l=0}^{2 r-3}(-1)^l\binom{2 r-3}{l}\sum_{j_1+\cdots+j_r=n-2 l\atop j_1,\dots,j_r\ge 1}B_{j_1}\cdots B_{j_r}$ and…

A Wagstaff prime is a prime number of the form $(2^{\mathfrak{p}}+1)/3$, where $\mathfrak{p}$ is an odd prime. Let $(L_n^{(k)})_{n\geq 2-k}$ be the $k$-Lucas number sequence defined by the recurrence relation $ L_n^{(k)} = L_{n-1}^{(k)} +…

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

Let $k\ge 2$ and $\{L_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$-Lucas numbers 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 solve the Diophantine equation…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…