Results 281 to 290 of about 92,778 (311)
Some of the next articles are maybe not open access.
Mersenne numbers as a difference of two Lucas numbers
Commentationes Mathematicae Universitatis Carolinae, 2023Summary: Let \((L_n)_{n\geq 0}\) be the Lucas sequence. We show that the Diophantine equation \(L_n-L_m=M_k\) has only the nonnegative integer solutions \((n,m,k)=(2,0,1)\), \((3,1,2)\), \((3,2,1)\), \((4,3,2)\), \((5,3,3)\), \((6,2,4)\), \((6,5,3)\) where \(M_k=2^k-1\) is the \(k\)th Mersenne number and \(n>m\).
openaire +3 more sources
1997
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +1 more source
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +1 more source
Lucas-Sierpiński and Lucas-Riesel Numbers
The Fibonacci Quarterly, 2011Daniel Baczkowski +2 more
openaire +1 more source
1991
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence $$ {u_n} + 2 = {u_{n + 1}} + {u_{{n^,}}}{u_0} = 0, {u_1} = 1 $$ are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2].
openaire +1 more source
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence $$ {u_n} + 2 = {u_{n + 1}} + {u_{{n^,}}}{u_0} = 0, {u_1} = 1 $$ are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2].
openaire +1 more source
Mersenne Numbers in Generalized Lucas Sequences
Proceedings of the Bulgarian Academy of SciencesLet $$k \geq 2$$ be an integer and let $$(L_{n}^{(k)})_{n \geq 2-k}$$ be the $$k$$-generalized Lucas sequence with certain initial $$k$$ terms and each term afterward is the sum of the $$k$$ preceding terms. Mersenne numbers are the numbers of the form $$2^a-1$$, where $$a$$ is any positive integer.
ALAN, Murat, Altassan, Alaa
openaire +2 more sources
Pseudoprimality related to the generalized Lucas sequences
Mathematics and Computers in Simulation, 2022Ovidiu Bagdasar, Dorin Andrica
exaly
On Some New Arithmetic Properties of the Generalized Lucas Sequences
Mediterranean Journal of Mathematics, 2021Ovidiu Bagdasar +2 more
exaly