Results 51 to 60 of about 21,260 (290)
Solutions of some diophantine equations involving k-generalized lucas sequences [PDF]
Fen Bilimleri Enstitüsü, Matematik Ana Bilim Dalı, Cebir ve Sayılar Teorisi Bilim DalıBu tezde, öncelikle bazı temel kavramlar verilmiştir. k-genelleştirilmiş Lucas dizisinin tanımı ve Binet tipi formülü elde edilmiştir.
Açıkel, Abdullah
core +2 more sources
On Lucas Sequences Computation
This paper introduces an improvement to a currently published algorithm to compute both Lucas "sister" sequences Vk and Uk. The proposed algorithm uses Lucas sequence properties to improve the running time by about 20% over the algorithm published in [1].
openaire +1 more source
Binomial Coefficients and Lucas Sequences
Let sequences \(\{u_n\}_{n\geq 0}\) and \(\{v_n\}_{n\geq 0}\) be defined by \(u_n= \frac{a^n-b^n}{a-b}\), \(v_n= a^n+b^n\) where \(a,b\) are integers such that \(a>|b|\). (Such sequences are Lucas sequences such that the associated quadratic polynomial has integer roots.
Flammenkamp, Achim, Luca, Florian
openaire +2 more sources
Lucas sequences and repdigits [PDF]
summary:Let $(G_{n})_{n \geq 1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\{U_n\}$ and $\{V_n\}$, respectively. We show that the Diophantine equation $G_n=B \cdot (g^{lm}-1)
Hashim, Hayder Raheem, Tengely, Szabolcs
core +1 more source
On arithmetic progressions in Lucas sequences
In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that there are only a few sequences which contain infinitely many and one can explicitly list both the sequences and the ...
Lajos Hajdu +2 more
openaire +4 more sources
On New Polynomial Sequences Constructed to Each Vertex in an n-Gon
In this work, we bring to light the properties of newly formed polynomial sequences at each vertex of Pell polynomial sequences placed clockwise at each vertex in the n-gon. We compute the relation among the polynomials with such vertices.
Abdul Hamid Ganie +3 more
doaj +1 more source
Diophantine equations involving the bi-periodic Fibonacci and Lucas sequences
In this paper, we present new identities involving the biperiodic Fibonacci and Lucas sequences. Then we solve completely some quadratic Diophantine equations involving the bi-periodic Fibonacci and Lucas ...
DJOUMAKH, Akila +2 more
core +1 more source
Bioscience students were asked for their opinions on the value and teaching of skills. 204 responded that teamwork, time management and study skills are necessary to reach University, that scientific writing, research, laboratory and presentation skills are taught effectively during their studies, while other skills are gained inherently through study ...
Janella Borrell, Susan Crennell
wiley +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Cracking the Code: Genotype–Phenotype Correlation Models in Sarcoglycanopathies
ABSTRACT Objective Sarcoglycanopathies are among the most severe limb‐girdle muscular dystrophies (LGMD), though milder presentations have been described. These diseases are primarily caused by missense variants, but the limited predictability of their effect on protein maturation, complex formation, and transport has hindered reliable genotype ...
Leonela Luce +72 more
wiley +1 more source

