Results 161 to 170 of about 1,028,977 (179)
Binet-Like Formulas from a Simple Expansion
The Fibonacci Quarterly, 2011 Martin Griffiths
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Ray tracing in concentric gradient-index media: optical Binet equation.
Journal of The Optical Society of America A-optics Image Science and Vision, 2022The Binet equation in mechanics describes the orbital geometry of a moving particle under a central force field. In this paper, as its counterpart in optics, we show this formula can be similarly utilized in ray tracing of a gradient-index (GRIN) medium ...
Wanguo Liu
semanticscholar +1 more source
Journal of Brand Strategy, 2022
How can a brand go from being the most recognised in its category to winning consumers’ hearts? That was the challenge faced by AustralianSuper, Australia’s largest superannuation (pension) fund.
Matt Allison
semanticscholar +1 more source
How can a brand go from being the most recognised in its category to winning consumers’ hearts? That was the challenge faced by AustralianSuper, Australia’s largest superannuation (pension) fund.
Matt Allison
semanticscholar +1 more source
Generalization of Binet's Gamma function formulas
Integral Transforms and Special Functions, 2013Several representations for the logarithm of the Gamma function exist in the literature. There are four important expansions which bear the name of Binet. Hermite generalized Binet's first formula to the logarithm of the Gamma function with shifted argument.
openaire +2 more sources
Probabilistic approaches to exploring Binet's type formula for the Tribonacci sequence
AIMS Mathematics: This paper presents a detailed procedure for deriving a Binet’s type formula for the Tribonacci sequence { T n } . We examine the limiting distribution of a Markov chain that encapsulates the entire sequence { T n } , offering insights into its ...
Skander Hachicha, Najmeddine Attia
semanticscholar +1 more source
Binet’s Formula for the Recursive Sequence of Order K
The Fibonacci quarterly, 1984The terms of a recursive sequence are usually defined by a recurrence procedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of ...
W. R. Spickerman, R. N. Joyner
semanticscholar +1 more source
Approximation of ∞-generalized Fibonacci sequences and their asymptotic binet formula
, 2001 Benaissa Bernoussi +3 more
openalex