Results 101 to 110 of about 137,846 (270)
Prime generating Lucas sequences
The distribution of prime numbers in Lucas sequences was investigated by independently changing the initial values and the multiplicative constants in the recursive definition of the sequence. The prime distribution was obtained by counting the number of primes in the first 1000 terms of various Lucas sequences. It was found that both smaller seeds and
Liu, Paul, Estrin, Ron
openaire +1 more source
On Some Relationships Among Pell, Pell-Lucas and Modified Pell Sequences
In this study, Pell, Pell-Lucas and Modified Pell numbers are investigated. Using Binet formulas for these sequences, some relations among these sequences are obtained. Also, some sum formulas are given by these properties.
Serpil Halıcı, Ahmet Daşdemir
doaj +1 more source
The 9th International RASopathies Symposium
ABSTRACT The RASopathies are a group of congenital disorders with overlapping clinical manifestations that are caused by pathogenic germline or early somatic variants that result in the hyperactivation of the RAS/mitogen‐activated protein kinase (MAPK) signaling pathway.
Pau Castel +41 more
wiley +1 more source
The Politics of Framing the Student Problem: Inquiries Into Australian Civics Education, 2006–2024
ABSTRACT Recurring debates about civics, the kinds of history that should, and should not, be taught in school, and ‘standards debates’ about the ‘basics’ typically follow on the heels of recurring moral panics about the ‘declining’ state of ‘our’ education system.
Patrick O'Keeffe +2 more
wiley +1 more source
In this work, we investigate the binomial transforms and Catalan transform of the $k$-Mersenne and $k$-Mersenne-Lucas numbers and examine the new integer sequences.
Kalika Prasad +3 more
doaj +1 more source
Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for n=2,...,7, U_n is a square for infinitely many pairs (P,Q) with gcd(P,Q)=1; further, for n=8,...,12, the only non-
Bremner, A., Tzanakis, N.
openaire +3 more sources
The Generalized Order-k Lucas Sequences in Finite Groups
We study the generalized order-k Lucas sequences modulo m. Also, we define the ith generalized order-k Lucas orbit lAi,{α1,α2,…,αk-1}(G) with respect to the generating set A and the constants α1,α2, and αk-1 for a finite group G=〈A〉.
Ömür Deveci, Erdal Karaduman
doaj +1 more source
Almost repdigits in balancing and Lucas-balancing sequences [PDF]
In this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and we search all terms of the balancing and Lucas-balancing sequences which are almost repdigits.
Manasi K. Sahukar, Hussain Basha
doaj +1 more source
Radical Cascade Combining Cross‐Olefin Coupling with the Smiles‐Truce Rearrangement
We present a cobalt‐catalysed radical cascade that efficiently merges two alkene starting materials to form multiple bonds in a single step. The process begins with a cobalt‐catalysed hydrogen‐atom transfer‐to a styrene double bond, followed by a Giese addition.
Jingyang Qin +3 more
wiley +1 more source
Fibonacci Cartan and Lucas Cartan numbers
This study introduces Fibonacci Cartan and Lucas Cartan numbers, extending the classical Fibonacci and Lucas sequences into the framework of Cartan numbers.
Öztürk İskender, Çakır Hasan
doaj +1 more source

