New Results for the Fibonacci Sequence Using Binet s Formula

Similar documents
Logarithm of the Kernel Function. 1 Introduction and Preliminary Results

Two Topics in Number Theory: Sum of Divisors of the Factorial and a Formula for Primes

Gaps between Consecutive Perfect Powers

On Certain Sums Extended over Prime Factors

Bounds for the Positive nth-root of Positive Integers

Asymptotic Formulae for the n-th Perfect Power

On Generalized Fibonacci Numbers

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

On Infinite Series Involving Fibonacci Numbers

Weakly Connected Closed Geodetic Numbers of Graphs

New Inequalities of Hermite-Hadamard-like Type for Functions whose Second Derivatives in Absolute Value are Convex

The Exponential Function as a Limit

A Note On The Exponential Of A Matrix Whose Elements Are All 1

INFINITE SEQUENCES AND SERIES

Enumerative & Asymptotic Combinatorics

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

2.4.2 A Theorem About Absolutely Convergent Series

Review Article Incomplete Bivariate Fibonacci and Lucas p-polynomials

The Sampling Distribution of the Maximum. Likelihood Estimators for the Parameters of. Beta-Binomial Distribution

Generalized Fibonacci-Like Sequence and. Fibonacci Sequence

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

Infinite Sequences and Series

Oscillation and Property B for Third Order Difference Equations with Advanced Arguments

6.3 Testing Series With Positive Terms

A detailed proof of the irrationality of π

Double Stage Shrinkage Estimator of Two Parameters. Generalized Exponential Distribution

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

The log-behavior of n p(n) and n p(n)/n

Research Article Nonexistence of Homoclinic Solutions for a Class of Discrete Hamiltonian Systems

SOME TRIBONACCI IDENTITIES

Research Article Some E-J Generalized Hausdorff Matrices Not of Type M

Gamma Distribution and Gamma Approximation

A Fixed Point Result Using a Function of 5-Variables

Weak Laws of Large Numbers for Sequences or Arrays of Correlated Random Variables

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

MDIV. Multiple divisor functions

Research Article Invariant Statistical Convergence of Sequences of Sets with respect to a Modulus Function

ON POINTWISE BINOMIAL APPROXIMATION

Best bounds for dispersion of ratio block sequences for certain subsets of integers

5 Sequences and Series

SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES

Appendix to Quicksort Asymptotics

A NOTE ON SPECTRAL CONTINUITY. In Ho Jeon and In Hyoun Kim

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim

HAJEK-RENYI-TYPE INEQUALITY FOR SOME NONMONOTONIC FUNCTIONS OF ASSOCIATED RANDOM VARIABLES

Research Article A New Second-Order Iteration Method for Solving Nonlinear Equations

Research Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property

University of Manitoba, Mathletics 2009

Convergence of Random SP Iterative Scheme

Sequences. A Sequence is a list of numbers written in order.

Research Article Carleson Measure in Bergman-Orlicz Space of Polydisc

SEQUENCES AND SERIES

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

Complete Convergence for Asymptotically Almost Negatively Associated Random Variables

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

On Some Properties of Digital Roots

Some p-adic congruences for p q -Catalan numbers

Convergence of Binomial to Normal: Multiple Proofs

SHARP INEQUALITIES INVOLVING THE CONSTANT e AND THE SEQUENCE (1 + 1/n) n

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Correspondence should be addressed to Wing-Sum Cheung,

On the Beta Cumulative Distribution Function

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

Review Article Complete Convergence for Negatively Dependent Sequences of Random Variables

A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall

Research Article Approximate Riesz Algebra-Valued Derivations

MONOTONICITY OF SEQUENCES INVOLVING GEOMETRIC MEANS OF POSITIVE SEQUENCES WITH LOGARITHMICAL CONVEXITY

CHAPTER 1 SEQUENCES AND INFINITE SERIES

THE INTEGRAL TEST AND ESTIMATES OF SUMS

Research Article Complete Convergence for Maximal Sums of Negatively Associated Random Variables

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

4.1 Sigma Notation and Riemann Sums

A Note on the Kolmogorov-Feller Weak Law of Large Numbers

The natural exponential function

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

Math 21B-B - Homework Set 2

Chapter 6 Infinite Series

A Simplified Binet Formula for k-generalized Fibonacci Numbers

Limit distributions for products of sums

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

1+x 1 + α+x. x = 2(α x2 ) 1+x

Math 312 Lecture Notes One Dimensional Maps

MA131 - Analysis 1. Workbook 9 Series III

arxiv: v1 [math.co] 3 Feb 2013

Complex Number Theory without Imaginary Number (i)

Exponential and Trigonometric Functions Lesson #1

The (P-A-L) Generalized Exponential Distribution: Properties and Estimation

Math 113 Exam 4 Practice

An elementary proof that almost all real numbers are normal

Korovkin type approximation theorems for weighted αβ-statistical convergence

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Equations and Inequalities Involving v p (n!)

γn 1 (1 e γ } min min

Available online at J. Math. Comput. Sci. 4 (2014), No. 3, ISSN:

Transcription:

Iteratioal Mathematical Forum, Vol. 3, 208, o. 6, 29-266 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/imf.208.832 New Results for the Fiboacci Sequece Usig Biet s Formula Reza Farhadia Departmet of Statistics, Loresta Uiversity Khorramabad, Ira Rafael Jakimczuk Divisió Matemática, Uiversidad Nacioal de Lujá Bueos Aires, Argetia Copyright c 208 Reza Farhadia ad Rafael Jakimczuk. This article is distributed uder the Creative Commos Attributio Licese, which permits urestricted use, distributio, ad reproductio i ay medium, provided the origial work is properly cited. Abstract Let k ad h = 0,..., k. I this ote we study the mootoicity of the sequeces F k+h /, where F deotes the -th Fiboacci umber. I particular, we prove that the sequeces F 2 / ad F 2+ / are strictly icreasig for. We also obtai asymptotic formulae for k= log F k, k= F k ad prove some its. Mathematics Subject Classificatio: B39, B99 Keywords: Sequeces, mootoicity, Fiboacci umbers Itroductio ad Preiary Notes I 202, the Italia mathematicia Leoardo Fiboacci 7-2, through a problem rabbit problem i his book Liber Abaci, he itroduced the followig sequece of umbers: 0,,, 2, 3,, 8, 3, 2, 34,, 89, 44, 233,...

260 Reza Farhadia ad Rafael Jakimczuk This sequece is called the Fiboacci sequece, ad its terms are kow as Fiboacci umbers. The Fiboacci sequece has a simple rule. I fact, startig with 0 ad, every ext umber is foud by addig up the two umbers before it. I mathematical terms, if F be the -th Fiboacci umber, the F = F + F 2. with F 0 = 0 ad F =. There are may methods ad explicit formulas to fidig the -th Fiboacci umber. For example, the well-kow Biet s formula discovered by the Frech mathematicia Jacques Philippe Marie Biet 786-86 i 843 states that: F = [ + 2 The Biet s formula ca also be writte as ]. 2 F = ϕ ϕ, where ϕ = +.680339887..., is the golde ratio. 2 There are may papers ad books o the Fiboacci umbers. See, for example, []. I this article, we are iterested i studyig the mootoicity of sequeces cosistig of Fiboacci umbers ad also i asymptotic formulae ad its where the Fiboacci Numbers appear. 2 Mai Results Lemma 2. The followig it holds log + x x 0 x =. Proof. Use L Hospital s rule. The lemma is proved. Theorem 2.2 Let k ad h = 0,..., k. If either h = 0 or h = the the sequece F k+h is strictly icreasig from a certai value of ad its it is ϕ k. O the other had, if h 2 the the sequece F k+h is strictly decreasig from a certai value of ad its it is ϕ k.

Results for the Fiboacci sequece usig Biet s formula 26 Proof. We have Biet s formula F k+h ϕ k+h k+h ϕ = ϕ = ϕ k h + k+h+ ϕ 2h = exp k log ϕ + log a + log = exp k log ϕ + log a + = ϕ k a + c fc b b + c b, 2 where a = ϕh, c = k+h+ = O, b = > ad f by Lemma ϕ 2h 2.. Note that a immediate cosequece of the secod lie of equatio 2 is the it of the sequece is ϕ k. Let us cosider the sequece see the last lie of equatio 2 We have A = k log ϕ + log a + fc b A + A = log a + + O = b = k log ϕ + log a + O. b log a + O + + b. Therefore, from a certai value of the sig of A + A is the sig of log a = log ϕ h. If either h = 0 or h = the log a > 0 ad cosequetly the sequece A is strictly icreasig from a certai value of. O the other had, if h 2 the log a < 0 ad cosequetly the sequece A is strictly decreasig from a certai value of. The theorem is proved. I the case k = 2 we ca to prove that both sequeces are strictly icreasig from =. Lemma 2.3 Let a >.284 is a costat. The for every x > 0 we have 2x a 2x loga + loga a 2x > a 2x a 2x loga2x a Proof. Let us cosider the real fuctio hx = a 2x. The derivative of a 2x hx is h x = 2 logaa4x + that is positive for a > ad every real umber a 2x x, which meas that the fuctio hx with a > is strictly icreasig. I 2x.

262 Reza Farhadia ad Rafael Jakimczuk additio by calculatio we have hx > for a.284 ad x > 0. Now let s cotiue the proof. We have 2xa 2x loga = a 2x loga 2x > a 2x loga 2x a 2x = a2x loghx. We have loghx > 0 for a.284 ad x > 0 sice hx >. Hece, we have 2xa 2x loga a 2x loga 2x > 0, a.284, x > 0. 3 a2x 2x loga Sice ad loga 2x both are positive for a > ad x > 0, a 2x a 2x a 2x by addig these to the left side of iequality 3, we have 2xa 2x loga a 2x a 2x loga2x loga +2x > 0, a2x a 2x x > 0, a.284. Cosequetly 2x a 2x loga + loga > a 2x a 2x a 2x loga2x, a2x x > 0, a.284. The lemma is proved. Theorem 2.4 The sequece F 2 is strictly icreasig for. Proof. Usig Biet s formula we have F 2 = ϕ2 ϕ 2 = ϕ2 ϕ 2. 4 Let us cosider the followig cotiuous fuctio correspodig to 4: fx = ϕ2x ϕ 2x x, x > 0. We obtai the derivative of fx as follows: /x ϕ 2x f ϕ x = 2x x 2 2xϕ2x logϕ + logϕ ϕ 2x x ϕ 2x log ϕ 2x ϕ ϕ 2x 2x + log /x ϕ 2x ϕ 2x 2x 2. /x Usig Lemma 2.3 we kow that f x > 0 for x > 0. Sice the fuctio fx has a positive derivative for x > 0, so fx is strictly icreasig for every x > 0, cosequetly the sequece F 2 is strictly icreasig. The theorem is proved.

Results for the Fiboacci sequece usig Biet s formula 263 Lemma 2. If x > 0 the the followig iequality holds 0 < log + x x <. Proof. The fuctio fx = x log + x has positive derivative for x > 0 ad f0 = 0. The lemma is proved. Theorem 2.6 The sequece F 2+ is strictly icreasig for. Proof. If k = 2 ad h = equatio 2 gives F 2+ = exp 2 log ϕ + ϕ log + f ϕ 2 ϕ 4 where, by Lemma 2., we have 0 < f <. Let us cosider the sequece see A = 2 log ϕ + log ϕ + f ϕ 2 ϕ 4. We have where A + A = F = f + ϕ 2 ϕ log + F, 6 + ϕ 4 + f + ϕ 2 ϕ 4, ad cosequetly F ϕ 2 ϕ 4 + + + ϕ 4 2 ϕ 2 + ϕ 4 4 ϕ 2 ϕ 4 4 ϕ 6 7 x Sice the fuctio ϕ 4 x has egative derivative for x. O the other had, we have the iequality log ϕ > 4. Therefore ϕ 6 equatios 6 ad 7 give A + A > 0 if. The theorem is proved. Theorem 2.7 The followig asymptotic formulae ad its hold. i= log F i = 2 2 log ϕ + ϕ 2 log + C + o, 8

264 Reza Farhadia ad Rafael Jakimczuk where C = log + k+. 9 k= where i= F i C ϕ 2 2 ϕ 2, 0 C = + k+. k= F F 2 F 2 = ϕ. 2 F F 2 F F = 0. 3 F F 2 F F = ϕ. 4 Let k be a positive iteger, we have log F3 log F 4 log F log F = e log F3 3k log F 4 4k log F k k+ k+ log F = e k+ 6 log F+ = e log F Proof. We have Biet s formula F = ϕ + + = ϕ + + ϕ ϕ 2 Therefore F ϕ, 7

Results for the Fiboacci sequece usig Biet s formula 26 ad Hece i= log F = log ϕ 2 log + log + +. 8 ϕ 2 log F i = 2 2 log ϕ + ϕ 2 log + log k= + k+ Note that the series log + k+ = fk k+ k= k= + o. where fk by Lemma 2. coverges absolutely. This proves equatios 8 ad 9. Equatios 0 ad are a immediate cosequece of equatios 8 ad 9. Limit 2 is a immediate cosequece of equatio 0. Limits 3 ad 4 are a immediate cosequece of equatios 0 ad 6. Equatio 7 gives From the Stirlig s formula! log log F = log + log log ϕ + o 9 2π e we obtai log i = log + o 20 i= Therefore see 8 ad 9 log F3 log F 4 log F log = log F log log F 3 + + log log F log log F = log i + log log ϕ + o i= log + log log ϕ + o = + o That is, equatio. The proof of equatio 6 is the same as the proof of equatio. Note that we have the well-kow asymptotic formula k + 2 k + + k k+ k + ad sice the fuctio x k log x is strictly icreasig ad itegratio by parts we have i k log i = x k log x dx+o k log = k+ log i= k + k + 2 k+ +o k+

266 Reza Farhadia ad Rafael Jakimczuk The theorem is proved. Ackowledgemets. Rafael Jakimczuk is very grateful to Uiversidad Nacioal de Lujá. Refereces [] N. N. Vorobèv, Fiboacci Numbers, Spriger, Birkhäuser Verlag, Basel, 2002. https://doi.org/0.007/978-3-0348-807-4 Received: April 9, 208; Published: April 24, 208