Results 241 to 250 of about 137,846 (270)
Some of the next articles are maybe not open access.
Shifting Lucas Sequences Away from Primes
Summary: We strengthen a result of Jones by showing that for any positive integer \(P\), the Lucas sequence \((U_n)_n\) defined by \(U_0 = 0\), \(U_1 = 1\), \(U_n=P \cdot U_{n -1} + U_{n - 2}\) can be translated by a positive integer \(K(P)\) such that the shifted sequence with general term \(U_n + K(P)\) contains no primes, nor terms one unit away ...Ismailescu, Dan +4 more
openaire +2 more sources
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.
Altassan, Alaa, ALAN, Murat
openaire +2 more sources
Two generalizations of Lucas sequence
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Pseudoprimality related to the generalized Lucas sequences
Mathematics and Computers in Simulation, 2022Dorin Andrica, Ovidiu D Bagdasar
exaly
On Some New Arithmetic Properties of the Generalized Lucas Sequences
Mediterranean Journal of Mathematics, 2021Dorin Andrica, Ovidiu D Bagdasar
exaly
Lucas Sequences in Primality Testing
2014Prime or composite? This classification determines whether or not integers can be used in digital security. One such way to begin testing an integers primality is with the Fermat test, which says that if n is a prime number and a is an integer then an-1 1 mod n.
openaire +1 more source
Some Generalized Lucas Sequences
The Fibonacci Quarterly, 1985J. H. Clarke, A. G. Shannon
openaire +1 more source