Results 301 to 310 of about 10,886,718 (351)

Incomplete Fibonacci and Lucas numbers

Rendiconti del Circolo Matematico di Palermo, 1996
It is well known that the Fibonacci numbers \(F_n\) and the Lucas numbers \(L_n\) can be written as \[ \begin{aligned} F_n &= \sum^k_{i=0} {{n-1-i} \choose i}, \qquad \lfloor (n- 1)/2 \rfloor\leq k\leq n-1, \tag{1}\\ L_n &= \sum^k_{i=0} {n\over {n-i}} {{n-i} \choose i}, \qquad \lfloor n/2 \rfloor \leq k\leq n-1.
openaire   +2 more sources

Lucas-Sierpiński and Lucas-Riesel Numbers

The Fibonacci Quarterly, 2011
Daniel Baczkowski, Olaolu Fasoranti, Carrie E. Finch   +2 more
openaire   +1 more source

SOME PROPERTIES OF THE PRODUCT OF (P,Q) – FIBONACCI AND (P,Q) - LUCAS NUMBER

, 2017
A. Suvarnamani
semanticscholar   +1 more source

Lucas Numbers and Lucas Sequences

2022
openaire   +1 more source

Balancing and Lucas-balancing numbers which are concatenation of three repdigits

Boletín de la Sociedad Matematica Mexicana, 2023
S. G. Rayaguru, Jhon J. Bravo
semanticscholar   +1 more source

Lucas's Tests for Mersenne Numbers

The American Mathematical Monthly, 1945
(1945). Lucas's Tests for Mersenne Numbers. The American Mathematical Monthly: Vol. 52, No. 4, pp. 188-190.
openaire   +1 more source

On the sum of a Lucas number and a prime

Periodica Mathematica Hungarica
Rui-Jing Wang
semanticscholar   +1 more source

Primitive Divisors of Lucas Numbers

1988
Let \( R = \{ {R_n}\} _{n = 1}^\infty \) be a Lucas sequence defined by fixed rational integers A and B and by the recursion relation $$ {R_n} = A \cdot {R_{n - 1}} + B \cdot {R_{n - 2}} $$ for n > 2, where the initial values are R1 = 1 and R2 = A. The terms of R are called Lucas numbers.
openaire   +1 more source

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller, Leticia M Nogueira, Angela B Mariotto   +2 more
exaly  

On Concatenations of Fibonacci and Lucas Numbers

Bulletin of the Iranian Mathematical Society, 2022
M. Alan
semanticscholar   +1 more source