Results 171 to 180 of about 4,031 (226)

Recovering the polyhedral geometry of fragments. [PDF]

MethodsX
Török J, Domokos G.
europepmc   +1 more source

Wandering Drunkards Walk after Fibonacci Rabbits: How the Presence of Shared Market Opinions Modifies the Outcome of Uncertainty. [PDF]

Entropy (Basel)
Maloumian N.
europepmc   +1 more source

MUTE drives asymmetric divisions to form stomatal subsidiary cells in Crassulaceae succulents. [PDF]

Sci Adv
Cheng X, Lindner H, Hoffmann L, Pereira Gomes Filho AA, Duarte PR, Boxall SF, Gündoğmuş YB, Pritchard JH, Haldenby S, Gemmell M, Darby A, Läderach M, Hartwell J, Raissig MT.   +13 more
europepmc   +1 more source

Localized modes and acoustic band gaps using different quasi-periodic structures based on closed and open resonators. [PDF]

Sci Rep
Antraoui I, Khettabi A, Sallah M, Zaky ZA.   +3 more
europepmc   +1 more source

Searching permutations for constructing uniformly distributed point sets. [PDF]

Proc Natl Acad Sci U S A
Clément F, Doerr C, Klamroth K, Paquete L.   +3 more
europepmc   +1 more source

Electromagnetic Sculptor: a differentiable geometric optimization framework to manipulate electromagnetic fields. [PDF]

Commun Eng
Yang K, Liu C, Yu W, Cui TJ.
europepmc   +1 more source

Parafermions in moiré minibands. [PDF]

Nat Commun
Liu H, Perea-Causin R, Bergholtz EJ.
europepmc   +1 more source

Performance analysis of Thue Morse acoustic resonators for noise reduction. [PDF]

Sci Rep
Zaky ZA, El Malki M, Antraoui I, Khettabi A, Sallah M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quotients of Fibonacci Numbers

The American Mathematical Monthly, 2016
AbstractThere have been many articles in the MONTHLY on quotient sets over the years. We take a first step here into the p-adic setting, which we hope will spur further research.
Stephan Ramon Garcia, Florian Luca
openaire   +2 more sources

Factorization of Fibonacci Numbers

The Fibonacci Quarterly, 1970
The Fibonacci numbers \(F_n\) may be defined by \(F_0 = 0\), \(F_1= 1\), \(F_{n+1}=F_n +F_{n-1}\) for \(n \geq 1\). If \(F_z\) \(z>0\), is the smallest Fibonacci number divisible by the prime \(p\), then \(z =a(p)\) is defined as the entry point (or rank) of \(p\); moreover \(p\) divides \(F_n\) if and only if \(n\) is divisible by \(z(p)\).
Daykin, D. E., Dresel, L. A. G.
openaire   +2 more sources