Results 11 to 20 of about 2,122 (182)
Image-Derived Volumetry During Forced Expiration Using a 3D Fermat Looped, Orthogonally Encoded Trajectory. [PDF]
ABSTRACT Purpose To enable MRI‐based nongated 3D depiction of forced expiration with both high spatio‐temporal resolution and fidelity of lung dynamics. Methods An undersampled 3D Fermat looped, orthogonally encoded trajectory (FLORET) was optimized for nonsegmented dynamic acquisitions during forced expiration and a corresponding model‐based ...
Scheidel S +6 more
europepmc +2 more sources
An inequality for Fibonacci numbers
Summary: We extend an inequality for Fibonacci numbers published by \textit{P. G. Popescu} and \textit{J. L. Díaz-Barrero} in [JIPAM, J. Inequal. Pure Appl. Math. 7, No. 2, Paper No. 41, 5 p. (2006; Zbl 1132.26011)].
Horst Alzer, Florian Luca
openaire +2 more sources
On Fibonacci functions with Fibonacci numbers [PDF]
Abstract In this paper we consider Fibonacci functions on the real numbers R, i.e., functions f : R → R such that for all x ∈ R ,
Han, Jeong, Kim, Hee, Neggers, Joseph
openaire +2 more sources
Dynamic sampling for SAXSTT: towards real-time measurement adaptation. [PDF]
A dynamic sampling strategy is presented to reduce the measurement time required for SAXS tensor tomography while maintaining reconstruction quality.Small‐angle X‐ray scattering tensor tomography (SAXSTT) is a powerful technique for non‐destructive 3D characterization of nanoscale structures by reconstructing q‐resolved reciprocal space maps.
Wang S, Nielsen LC, Liebi M.
europepmc +2 more sources
On generalized Fibonacci numbers [PDF]
We provide a formula for the $n^{th}$ term of the $k$-generalized Fibonacci-like number sequence using the $k$-generalized Fibonacci number or $k$-nacci number, and by utilizing the newly derived formula, we show that the limit of the ratio of successive terms of the sequence tends to a root of the equation $x + x^{-k} = 2$.
Bacani, Jerico B. +1 more
openaire +2 more sources
On the Inverse of a Fibonacci Number Modulo a Fibonacci Number Being a Fibonacci Number
Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of representatives $\{0, 1, \dots, b-1\}$. Put also $[a^{-1} \!\bmod b] := \infty$ when $\gcd(a, b) > 1$.
openaire +3 more sources
Bi-Periodic (p,q)-Fibonacci and Bi-Periodic (p,q)-Lucas Sequences
In this paper, we define bi-periodic (p,q)-Fibonacci and bi-periodic (p,q)-Lucas sequences, which generalize Fibonacci type, Lucas type, bi-periodic Fibonacci type and bi-periodic Lucas type sequences, using recurrence relations of (p,q)-Fibonacci and (p,
Yasemin Taşyurdu +1 more
doaj +1 more source
Some properties of the generalized (p,q)- Fibonacci-Like number
For the real world problems, we use some knowledge for explain or solving them. For example, some mathematicians study the basic concept of the generalized Fibonacci sequence and Lucas sequence which are the (p,q) – Fibonacci sequence and the (p,q ...
Suvarnamani Alongkot
doaj +1 more source
Diophantine equations with Lucas and Fibonacci number coefficients [PDF]
Fibonacci and Lucas numbers are special number sequences that have been the subject of many studies throughout history due to the relations they provide.
Cemil Karaçam +3 more
doaj +1 more source
Power Fibonacci sequences in quadratic integer modulo m [PDF]
The power Fibonacci sequence in ℤₘ[√δ] is defined as a Fibonacci sequence Fₙ=Fₙ₋₁+Fₙ₋₂ where F₀=1 and F₁=a, such that a∈ℤₘ[√δ] and Fₙ≡aⁿ(mod m), for all n∈ℕ∪{0}. In this paper, we investigated the existence of power Fibonacci sequences in ℤₘ[√δ], and the
Paul Ryan A. Longhas +3 more
doaj +1 more source

