Results 251 to 260 of about 21,260 (290)
The genomics of insecticide resistance in Anopheles funestus: insights from a large bed-net trial. [PDF]
Namuli-Kayondo L +24 more
europepmc +1 more source
Do Symbiotic Microbes Drive Chemical Divergence Between Colonies in the Pratt's Leaf-Nosed Bat, Hipposideros pratti? [PDF]
Zheng Z, Lucas JR, Zhang C, Sun C.
europepmc +1 more source
Distribution and evolution of the LysR-type transcriptional regulators of the Salmonella genus. [PDF]
S D, A RR, Y GM, R O, V M H, I HL.
europepmc +1 more source
On the discriminator of Lucas sequences
Faye, B. ; https://orcid.org/0000-0002-2299-5956 +2 more
openaire +1 more source
On Some New Arithmetic Properties of the Generalized Lucas Sequences [PDF]
Some arithmetic properties of the generalized Lucas sequences are studied, extending a number of recent results obtained for Fibonacci, Lucas, Pell, and Pell–Lucas sequences.
Dorin Andrica +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mersenne Numbers in Generalized Lucas Sequences
Let $$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 +3 more sources
(Verifiable) Delay Functions from Lucas Sequences [PDF]
Lucas sequences are constant-recursive integer sequences with a long history of applications in cryptography, both in the design of cryptographic schemes and cryptanalysis.
Charlotte Hoffmann +2 more
exaly +1 more source
The Fibonacci Quarterly, 2015
Consider the Lucas sequence u(a, b) = (un(a, b)) and the companion Lucas sequence v(a, b) = (vn(a, b)) which both satisfy the second order recursion relation wn+2 = awn+1 − bwn with initial terms u0 = 0, u1 = 1, and v0 = 2, v1 = a, respectively. We give both necessary and sufficient tests and also necessary tests for the primality of |un| and |vn|. For
Křížek, M. (Michal), Somer, L.
openaire +2 more sources
Consider the Lucas sequence u(a, b) = (un(a, b)) and the companion Lucas sequence v(a, b) = (vn(a, b)) which both satisfy the second order recursion relation wn+2 = awn+1 − bwn with initial terms u0 = 0, u1 = 1, and v0 = 2, v1 = a, respectively. We give both necessary and sufficient tests and also necessary tests for the primality of |un| and |vn|. For
Křížek, M. (Michal), Somer, L.
openaire +2 more sources

