2000 character limit reached
Congruences concerning Lucas' law of repetition
Published 12 Dec 2013 in math.NT | (1312.3511v1)
Abstract: Let $P,Q\in\Bbb Z$, $U_0=0,\ U_1=1$ and $U_{n+1}=PU_n-QU_{n+1}$. In this paper we obtain a general congruence for $U_{kmnr}/U_k\pmod {n{r+1}}$, where $k,m,n,r$ are positive integers. As applications we extend Lucas' law of repetition and characterize the square prime factors of $an+1$ or $S_n$, where ${S_n}$ is given by $S_1=P2+2$ and $S_{k+1}=S_k2-2\ (k\ge 1)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.