Questions tagged [lucas-numbers]

Questions on the Lucas numbers, a special sequence of integers that satisfy the recurrence $L_n=L_{n-1}+L_{n-2}$ with the initial conditions $L_0=2$ and $L_1=1$.

The $n$th Lucas number $L_n$ is defined recursively, by

$$L_n = L_{n - 1} + L_{n - 2}$$

for $n > 1$, and $L_0 = 2,\; L_1 = 1$. There is a closed form expression, namely

$$ L_{n}=\varphi ^{n}+(1-\varphi )^{n}=\varphi ^{n}+(-\varphi )^{-n}=\left({1+{\sqrt {5}} \over 2}\right)^{n}+\left({1-{\sqrt {5}} \over 2}\right)^{n},$$

where the golden ratio $\varphi$ is equal to $\dfrac{1 + \sqrt{5}}{2}$.

The sequence of Lucas numbers is: $2,1,3,4,7,11,18,29,47,76,123,\dots$ (sequence A000032 in the OEIS).

Reference: Lucas number.

98 questions
65
votes
3 answers

Closed form solution for $\sum_{n=1}^\infty\frac{1}{1+\frac{n^2}{1+\frac{1}{\stackrel{\ddots}{1+\frac{1}{1+n^2}}}}}$.

Let $$ \text{S}_k = \sum_{n=1}^\infty\cfrac{1}{1+\cfrac{n^2}{1+\cfrac{1}{\ddots1+\cfrac{1}{1+n^2}}}},\quad\text{$k$ rows in the continued fraction} $$ So for example, the terms of the sum $\text{S}_6$…
10
votes
0 answers

When is $L_n-1$ a prime?

Let $L_n$ be the $n$th Lucas number. I tested whether $L_n-1$ is prime for all $n<100000$ and found that it is prime only for $n=2,3,6,24,48,96$. Are there any other prime numbers? Also, is there a reason why most of these $n$s are in the form of…
dodicta
  • 1,193
  • 4
  • 18
9
votes
1 answer

On $3+\sqrt{11+\sqrt{11+\sqrt{11+\sqrt{11+\dots}}}}=\phi^4$ and friends

Let $\phi$ be the golden ratio. We know it has a beautiful infinite nested radical, $$\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\dots}}}}=\phi$$ However, it is also the case…
7
votes
1 answer

Common terms in general Fibonacci sequences

Mathworld notes that "The Fibonacci and Lucas numbers have no common terms except 1 and 3," where the Fibonacci and Lucas numbers are defined by the recurrence relation $a_n=a_{n-1}+a_{n-2}$. For Fibonacci numbers, $a_1=a_2=1$; for Lucas numbers,…
7
votes
0 answers

Period of Fibonacci sequence and Lucas number mod p

Let $p$ be an odd prime and $L_n$ be the $n$th Lucas number. Can anyone prove this? $$\frac{L_1}{1}+\frac{L_3}{3}+\frac{L_5}{5}+\cdots+\frac{L_{p-2}}{p-2}\neq0\pmod{p}$$ Please help me! I am thinking about the period of Fibonacci sequence. The…
7
votes
4 answers

Is there a Lucas-Lehmer equivalent test for primes of the form ${3^p-1 \over 2}$?

I'm reviewing the cyclotomic form $f_b(n)= {b^n-1 \over b-1}$ for various properties to extend an older treatize of mine on that form. With respect to primality there is the Lucas-Lehmer-test for primeness of $f_2(p)$ where of course $p$ itself…
5
votes
1 answer

What's the Lucas version of the Möbius test for Fibonacci numbers?

I recently came across the following, attributed to Möbius: $$(a\in\mathbb N)=F_n\iff\left[\varphi a-\tfrac{1}{a},\varphi a+\tfrac{1}{a}\right]\ni(b\in\mathbb N)$$ It is the lesser-known test used to tell if a positive integer $a$ is a Fibonacci…
Brian J. Fink
  • 1,330
  • 11
  • 17
5
votes
1 answer

A pattern of periodic continued fraction

I am interested in the continued fractions which $1$s are consecutive appears. For example, it is the following values. $$ \sqrt{7} = [2;\overline{1,1,1,4}] \\ \sqrt{13} = [3;\overline{1,1,1,1,6}] $$ In this article, let us denote n consecutive $1$s…
5
votes
2 answers

What is the fastest method to compute the $nth$ number in Lucas sequences?

Lucas sequences $U_n(P,Q)$ and $V_n(P,Q)$ are defined by the following relations: $U_0(P,Q)=0,$ $U_1(P,Q)=1,$ $U_n(P,Q)=P\cdot U_{n-1}(P,Q)-Q\cdot U_{n-2}(P,Q)$ and $V_0(P,Q)=2,$ $V_1(P,Q)=P,$ $V_n(P,Q)=P\cdot V_{n-1}(P,Q)-Q\cdot V_{n-2}(P,Q).$ I…
5
votes
1 answer

Prove that if prime $p$ divide $a_{2k}-2$, then $p$ divide also $a_{2k+1}-1$.

Sequence $a_0,a_1,a_2,...$ satisfies that $a_0=2,a_1=1,a_{n+1}=a_n+a_{n-1}$ Prove that if $p$ is a prime divisor of $a_{2k}-2$,then $p$ is also a prime divisor of $a_{2k+1}-1$ If $x_{1,2}={1\pm\sqrt{5}\over 2}$ then $a_k = x_1^k+x_2^k$ and…
nonuser
  • 86,352
  • 18
  • 98
  • 188
4
votes
1 answer

An identity involving Lucas numbers

Let $L_n$ be the Lucas numbers, defined by $L_n = F_{n-1} + F_{n+1}$ where $F_k$ are the Fibonacci numbers. How to prove that $$L_{2n+1} = \displaystyle \sum_{k=0}^{\lfloor n + 1/2\rfloor}\frac{2n+1}{2n+1 - k}{2n+1 - k \choose k} $$
4
votes
1 answer

Evaluate $\sum _{k=0}^{\infty } \frac{L_{2 k+1}}{(2 k+1)^2 \binom{2 k}{k}}$

How to prove $$\sum _{k=0}^{\infty } \frac{L_{2 k+1}}{(2 k+1)^2 \binom{2 k}{k}}=\frac{8}{5} \left(C-\frac{1}{8} \pi \log \left(\frac{\sqrt{50-22 \sqrt{5}}+10}{10-\sqrt{50-22 \sqrt{5}}}\right)\right)$$ Where $L_k$ denotes Lucas number and $C$…
Infiniticism
  • 8,283
  • 1
  • 19
  • 64
4
votes
2 answers

Mathematical induction on Lucas sequence and Fibonacci sequence

I'm trying to prove the following: $$L_k^2-5F_k^2=4(-1)^k\qquad k\ge1$$ $L_k$ is the $k$th term of the Lucas numbers and $F_k$ is the $k$th term of the Fibonacci sequence. I've tried using mathematical induction, however it's not working out too…
4
votes
3 answers

Lucas Numbers and Matrices

Is there a $2 \times 2$ matrix that can be raised to any power to obtain the Lucas Numbers? If so, what is that matrix? I've looked around on this website and other sites and am not able to find the solution.
guest111
  • 41
  • 2
1
2 3 4 5 6 7