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

Similar documents
On repdigits as product of consecutive Lucas numbers

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

2.4 - Sequences and Series

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

CHAPTER 1 SEQUENCES AND INFINITE SERIES

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile. s: /

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

On Generalized Fibonacci Numbers

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

3 Gauss map and continued fractions

Some remarks for codes and lattices over imaginary quadratic

ON CONVERGENCE OF BASIC HYPERGEOMETRIC SERIES. 1. Introduction Basic hypergeometric series (cf. [GR]) with the base q is defined by

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

On the Jacobsthal-Lucas Numbers by Matrix Method 1

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

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Pell and Lucas primes

arxiv: v1 [math.fa] 3 Apr 2016

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco

Linear recurrence sequences and periodicity of multidimensional continued fractions

SOME TRIBONACCI IDENTITIES

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 +

MAT1026 Calculus II Basic Convergence Tests for Series

INFINITE SEQUENCES AND SERIES

A Simplified Binet Formula for k-generalized Fibonacci Numbers

The r-generalized Fibonacci Numbers and Polynomial Coefficients

The 4-Nicol Numbers Having Five Different Prime Divisors

Pellian sequence relationships among π, e, 2

arxiv: v1 [math.co] 3 Feb 2013

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

IRRATIONALITY MEASURES, IRRATIONALITY BASES, AND A THEOREM OF JARNÍK 1. INTRODUCTION

Math 2112 Solutions Assignment 5

INEQUALITIES BJORN POONEN

On Divisibility concerning Binomial Coefficients

Some p-adic congruences for p q -Catalan numbers

Bertrand s Postulate

TEACHER CERTIFICATION STUDY GUIDE

Sequences and Limits

CALCULATION OF FIBONACCI VECTORS

Recurrence Relations

Lecture 1. January 8, 2018

Some identities involving Fibonacci, Lucas polynomials and their applications

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

A Study on Some Integer Sequences

The Pascal Fibonacci numbers

Math 475, Problem Set #12: Answers

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

Hoggatt and King [lo] defined a complete sequence of natural numbers

SOME DOUBLE BINOMIAL SUMS RELATED WITH THE FIBONACCI, PELL AND GENERALIZED ORDER-k FIBONACCI NUMBERS

Some Basic Diophantine Equations

Regression with an Evaporating Logarithmic Trend

Roger Apéry's proof that zeta(3) is irrational

Math 2784 (or 2794W) University of Connecticut

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

Solutions to Tutorial 3 (Week 4)

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

ON BLEIMANN, BUTZER AND HAHN TYPE GENERALIZATION OF BALÁZS OPERATORS

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

Exponential Functions and Taylor Series

Zeros of Polynomials

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Matrix representations of Fibonacci-like sequences

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

Asymptotic Formulae for the n-th Perfect Power

Continued Fractions and Pell s Equation

Factors of sums and alternating sums involving binomial coefficients and powers of integers

A Note on the Symmetric Powers of the Standard Representation of S n

Concavity of weighted arithmetic means with applications

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng

Appendix to Quicksort Asymptotics

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

Seunghee Ye Ma 8: Week 5 Oct 28

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number

Definition An infinite sequence of numbers is an ordered set of real numbers.

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence.

Review for Test 3 Math 1552, Integral Calculus Sections 8.8,

Feedback in Iterative Algorithms

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

Assignment 5: Solutions

is also known as the general term of the sequence

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

COMM 602: Digital Signal Processing

BIRKHOFF ERGODIC THEOREM

Tauberian theorems for the product of Borel and Hölder summability methods

Random Models. Tusheng Zhang. February 14, 2013

An elementary proof that almost all real numbers are normal

Properties and Tests of Zeros of Polynomial Functions

Infinite Sequences and Series

Beurling Integers: Part 2

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

HOUSEHOLDER S APPROXIMANTS AND CONTINUED FRACTION EXPANSION OF QUADRATIC IRRATIONALS. Vinko Petričević University of Zagreb, Croatia

Accepted in Fibonacci Quarterly (2007) Archived in SEQUENCE BALANCING AND COBALANCING NUMBERS

Transcription:

Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k) } is defied as the sum 0 of the k proceedig terms ad iitial coditios are 0,..., 0, 1 (k terms). I this paper, we solve the diophatie equatio F (k) = 2 a + 3 b + 5 c + δ, where a, b, c ad δ are oegative itegers with max{a, b} c ad 0 δ 5. This work geeralizes a recet Marques [9] ad the first author, Szalay [6] results. 1. Itroductio Let k 2 be a iteger. The k-geeralized Fiboacci sequece { F (k) } by the followig recurrece relatio = 1 + 2 + + k, (k 2) 0 is defied with the iitial coditios (k 2) = (k 3) = = 0 = 0 ad k 1 = 1. Naturally, the case k = 2 turs to well-kow Fiboacci sequece {F }. If k = 3, the it gives the Triboacci sequece {T }. The problem of fidig differet type of the umbers amog the terms of liear recurrece has a log history. Oe of the results by Bugeaud, Migotte ad Siksek [1] is that oly 0, 1, 8, 144 i Fiboacci umbers ad 1, 4 i Lucas umbers ca be writte i the form y t, where t > 1. Szalay ad Luca showed that there are oly fiitely quadruples (, a, b, p) such that F = p a ± p b + 1, where p is a prime umber i [7]. Recetly, Bravo ad Luca [2] solved the diophatie equatio F (k) = 2 m for positive itegers, k, m with k 2. The paper of Marques ad Togbe [8] determies the Fiboacci umbers ad the Lucas umbers of the form 2 a + 3 b + 5 c where Lucas sequece is defied by relatio L = L 1 + L 2 for 2, together with L 0 = 2 ad L 1 = 1. Recetly, Marques [9] solved the diophatie equatio = 2 a + 3 b + 5 c with max{a, b} c. The first author ad Szalay showed that there are 22 solutios to the diophatie equatio 0 T 2 a 3 b 5 c 10, where T is the Triboacci sequece. Received May 6, 2016; revised March 22, 2017. 2010 Mathematics Subject Classificatio. Primary 11B39, 11J86. Key words ad phrases. k-geeralized Fiboacci sequece; liear forms i logarithms; reductio method. This project is supported by Niğde Uiversity s Project No: FEB 2013/30 BAGEP.

280 N. IRMAK ad M. ALP (1) I this paper, we solve the equatio = 2 a + 3 b + 5 c + δ, where a, b, c ad δ are oegative itegers with max{a, b} c ad 0 δ 5. There is a differece from the paper [9]. We add a diameter to the equatio. If we take k = 3 ad 0 δ 5 i the equatio (1), the we obtai the result of the paper [6]. Takig δ = 0 i the equatio (1) yields the paper [9]. Our result is the followig theorem. Theorem 1.1. For k + 2, the solutios of the equatio are give i the followig tables k a b c δ 4 2 0 0 0 0 6 2 1 0 1 0 5 3 0 0 1 0 15 3 1 2 5 0 15 3 3 1 5 0 7 4 0 1 2 0 9 7 0 0 3 0 k a b c δ 7 5 1 0 2 3 7 2 0 1 1 4 9 2 1 1 2 4 5 3 0 0 0 4 6 3 0 1 1 4 15 3 2 1 5 4 = 2 a + 3 b + 5 c + δ k a b c δ 6 2 0 0 1 1 15 3 0 2 5 1 7 4 1 0 2 1 7 5 1 1 2 1 7 5 2 0 2 1 5 2 0 0 0 2 9 2 2 1 2 2 k a b c δ 7 5 0 0 2 4 6 2 0 0 0 5 7 2 1 0 1 5 9 2 0 1 2 5 6 3 1 0 1 5 6 4 1 1 1 5 k a b c δ 12 2 3 2 3 2 15 3 3 0 5 2 7 4 0 0 2 2 7 5 0 1 2 2 16 11 3 6 6 2 7 2 1 1 1 3 6 3 1 1 1 3 where a, b ad c are positive itegers with max{a, b} c ad the sequece { F (k) } is the k-geeralized Fiboacci sequece. Whe we take δ = 0, it coicides with the Marques [9] results. Moreover, we ote that the solutios (, k, a, b, c, δ) = (7, 4, 0, 1, 2, 0) ad (9, 7, 0, 0, 3, 0) are ot observed i [9]. 2. Auxiliary Results Before proceedig further, we recall some facts ad tools which will be used ext. Dresde ([4, Theorem 1]) gave the Biet-type formula of the terms of the sequece { (k)} F as follows (2) = k i=1 α i 1 2 + (k + 1) (α i 2) α 1 i,

k-generalized FIBONACCI NUMBERS 281 for α 1,..., α k, the roots x k x k 1 1 = 0. Also, it was prove i the same paper that F (k) g (α, k) α 1 1 (3) < 2 where α is the domiat root of the characteristic equatio x k x k 1 1 = 0 ad the otatio g (α, k) := (α 1)/(2 + (k + 1) (α 2)). Also, Bravo ad Luca [2] proved that α 2 α 1 for all 1. Aother tool to prove our theorem is a lower boud for liear forms i logarithms of algebraic umbers, give by Matveev [10]. The first oe is the followig lemma. Lemma 2.1. Let K be a umber field of degree D over Q, γ 1, γ 2,... γ t be positive real umbers of K, ad b 1, b 2,... b t be ratioal itegers. Put ad B max { b 1, b 2,..., b t } Λ := γ b1 1 γbt t 1. Let A 1,..., A t be real umbers such that A i max {Dh (γ i ), log γ i, 0.16}, i = 1,..., t. The, assumig that Λ 0, we have Λ > exp ( 1.4 30 t+3 t 4.5 D 2 (1 + log D) (1 + log B) A 1... A t ). As usual, i the above lemma, the logarithmic height of algebraic umber η is defied as h (η) = 1 ( d ( log a 0 + max { η (i), 1 })) d i=1 where d is the degree of η over Q, ( η (i)) are the cojugates of η over Q, 1 i d ad a 0 is the positive leadig coefficiet of the miimal polyomial of η over the itegers. The applicatio of Matveev theorem gives a large upper boud. I order to reduce this boud, we use the followig lemma ([5, Lemma 2.2]). Lemma 2.2. Suppose that M is a positive iteger. Let p/q be a coverget of the cotiued fractio expasio of the irratioal umber γ such that q > 6M ad ε = µq M γq, where µ is a real umber ad deotes the distace from the earest iteger. If ε > 0, the there is o solutio to the iequality i positive itegers m ad with 0 < mγ + µ < AB m log(aq/ε) log B m < M. We use also the followig lemma from the paper [2].

282 N. IRMAK ad M. ALP Lemma 2.3. For every positive iteger 2, we have 2 2. 3. Proof of Theorem 1.1 The formula (2) together with the diophatie equatio yields that The we have k i=1 α i 1 2 + (k + 2) (α i 2) α 1 i = 2 a + 3 b + 5 c + δ. g (α, k) α 1 5 c 1 = 2a + 3 b ξ + δ 5 c, where 1 < α = α 1 R is the domiat root of the characteristic equatio x k x k 1 1 = 0 ad ξ = k i=2 g (α i, k) α 1 i is the real umber whose absolute value is less tha 1. Therefore, g(α,k)α 1 5 1 > 0. Cosequetly, we get c (4) g (α, k) α 1 5 c 1 < 2a + 3 b + δ 5 c < 3 5 0.3c sice 2 < 5, 3 < 5 0.7 ad c max{a, b}. I order to apply the Lemma 2.1, we take t := 3 ad γ 1 := g (α, k), γ 2 := α, γ 3 := 5, together with the expoets b 1 := 1, b 2 := 1 ad b 3 := c. For this choise, we have D = k, A 2 = k log 5, A 3 = 0.7, ad by the paper [2, page 73], A 1 = 4k log k. By the iequality (3), 5 c < F (k) < α 1 gives that 1 c > log 5 log α > 1. Hece, B = max {1, 1, c} = 1. Whe we compare the upper ad lower bouds for Λ, we get e T (1+log k)(1+log( 1))(4k log k)(k log 5)0.7 < 3 1.6 c, where T = 1.4 30 6 3 4.5 k 2. After takig logarithm of both sides ad some simplificatios together with 1 + log ( 1) < 2 log ( 1) ad 1 + log k < 2 log k, we obtai Sice α 2 < yields that c log 1.6 log 2 < 3.9 10 12 k 4 (log k) 2 log ( 1). < 3 5 c < 5 c+1, the ( 2) log α log 5 1 < c. So, the iequality ( ( 2) log α log 5 1 ) log 1.6 < 3.9 10 12 k 4 (log k) 2 log ( 1) 1 log ( 1) < 2.8 1013 k 4 (log k) 2.

k-generalized FIBONACCI NUMBERS 283 Sice the fuctio x x/ log x is icreasig for all x > e, it is easy check that the iequality x < A yields x < 2A log A. log x Thus, takig A := 5.1 10 12 k 4 (log k) 2, we have 1 < 2 (2.8 10 13 k 4 (log k) 2) log (2.8 10 13 k 4 (log k) 2) < 5.6 10 13 k 4 (log k) 2 (log 2.8 + 13 log 10 + 4 log k + 2 log (log k)) < 5.6 10 13 k 4 (log k) 2 (31 + 4 log k + 2 log (log k)), sice (31 + 4 log k + 2 log (log k)) < 48 log k for all k 2, the Sice 5 c < (5) < 2.7 10 15 k 4 (log k) 3. < α 1 ad α 2 < 2.3 c + 1 < < 3.4 (c + 1) + 2 < 5 c+1, the the iequality holds. I the sequel, assume that k [2, 372]. I order to apply Lemma 2.2, let t := ( 1) log α + log g (α, k) c log 5. By the equatio (4), we ca write that e t 1 < 3 5 0.3c. Sice e t 1 > 0, the t > 0. Together with the equatio (5), ( 1) log α + log g (α, k) c log 5 < 3 5 0.3c < 3 (1.6) c < 3 (1.6) 0.29 1.6 < 6.37 (1.14) holds. Dividig both sides of the above iequality by log 5, we get ( log α ) log g (α, k) log α + c < 6.37 (6) log 5 log 5 log 5 (1.14) < 3.96 (1.14). With γ := log α log 5, log g (α, k) log α µ :=, log 5 A := 3.96, B := 1.14,

284 N. IRMAK ad M. ALP the iequality (6) yields 0 < γ c + µ < A B. It is obvious that γ is a irratioal umber. Take M := 3.96 10 15 k 4 (log k) 3. We use the Lemma 2.2 for each case k [2, 372]. Mathematica programme reveals that maximum value of log (Aq/ε) / log B is 1941, 25.... Hece, we deduce that possible solutios of the diophatie equatio (1) are i the rage k [2, 372] ad [4, 1941]. I order to decrease the upper boud for, we use the iequality ( log 3 F (k) 5 log 5 δ ) ) log 5 (F (k) δ for 0 δ 5. Sice we assume that max{a, b} c, this ( iequality must hold. For k [2, 372] ad [4, 1941], the iequality log 3 F (k) 5 log 5 δ ) ( ) log 5 F (k) δ yields that 30. We go through the solutios of the diophatie equatio. We fid them as i Theorem 1.1. From ow o, assume that k 373. Uder this coditio, the iequality (7) < 2.7 10 15 k 4 (log k) 3 < 2 k 4 holds. Usig the same argumets i [2] with Lemma 2.3, we have g (α, k) α 1 = 2 2 + δ 2 + 2 1 η + ηδ, where δ < 2 ad η < 2k. The 2 k/2 2 k 2 a + 3 b + 5 c + δ 2 2 = 2 a + 3 b + 5 c g (α, k) α 1 + δ 2 + 2 1 η + ηδ < 5 2 2 2 k/2, where we used the facts 1/2 1 < 1/2 k/2, 4k/2 k < 1/2 k/2 ad 8k/2 3k/2 < 1/2 k/2 for k > 363. If we divide both sides by 2 2, the we get 2 a + 3 b + 5 c 2 2 1 < 5 2. k/2 This iequality gives that 1 The facts 2 2a < 5 c < So, 5c 2 2 < 5 2 + 2a + 3 b k/2 2 2 + δ 2 2. < 2 2 ad 3 1.45b < 5 c < 5 2 + 2a + 3 b k/2 2 2 + δ 12 < 2 2 2 0.3k. 1 5c 2 2 < 12 2 0.3k. < 2 2 yield that

k-generalized FIBONACCI NUMBERS 285 Now we apply the Lemma 2.1 agai. We take t := 2, D := 1, γ 1 := 5, γ 2 := 2, b 1 := c, b 2 := ( 2), B :=,A 1 := log 5 ad A 2 := log 2. The the Lemma 2.2 yields that e 1.4 305 2 4.5 (1+log ) log 5 log 2 < 12 2 0.3k. Takig both sides with logarithm fuctio, we have 3k 10 log 2 log 12 < 1.4 305 2 4.5 log 5 log 2 1.5 log, where we use the fact 1 + log < 3 2 log. Sice ( log < log 2.7 10 15 k 4 (log k) 3) < 11 log k for k 373, the 3k 10 log 2 log 7 < 1.42 1010 log k. Whe we solve the above iequality, we get 2 k < 2 10 12 ad 4 < 9.9 10 68. I order to reduce the upper boud of, we use Lemma 2.2 agai. Let τ := c log 5 ( 2) log 2. Sice 5 c < 2 2, the c log 5 ( 2) log 2 < 0 yields that τ < 0. Thus, we obtai τ < e τ 1 = e τ e τ 1 < 24 2 0.3k, where we use that e τ < 2 sice e τ 1 < 1 2. Sice 2 k, the k log 2 c log 5 ( 2) log 2 c log 5 < 24 (2 0.3) k. After dividig both sides by log 5, we get k log 2 log 5 c < 15 ( 2 0.3) k. Let γ := log 2 log 5, [a 0, a 1, a 2,...] = [0, 2, 3, 9,...] be the cotiued fractio of γ ad p k /q k deote kth coverget. The we have q 142 > 9.9 10 68. Furthermore, a M := max {a i ; i = 0, 1,..., 142}. The we fid a M = a 137 = 5394. Usig the properties of the cotiued fractio, we get that 1 ( 2) γ c > (a M + 2) ( 2). It yields that The, by the iequality (7), 1 5395 ( 2) < ( 2) γ c < 9 (2 0.3) k. 2 0.3k < 9 5395 ( 2) < 1.32 10 20 k 4 (log k) 3 holds. This iequality implies that k 361. This case is already treated.

286 N. IRMAK ad M. ALP Therefore, Theorem 1.1 is completed. Refereces 1. Bugeaud Y., Migotte M. ad Siksek S., Classical ad modular approaches to expoetial Diophatie equatio. I. Fiboacci ad Lucas perfect powers, A. of Math. (2) 163(3) (2006), 969 1018. 2. Bravo J. J. ad Luca F., Powers of two i geeralized Fiboacci sequece, Rev. Colombiaa Math. 46 (2012), 67 79. 3. Bravo J. J. ad Luca F., O a cojecture about repdigits i k-geeralized Fiboacci sequeces, Publ. Math. Debrece 82(3-4) (2013), 623 639. 4. Dresde G. P. ad Du Z., A simplified Biet formula for K-geeralized Fiboacci umbers, J. Iteger Seq. 17(4) (2014), Article 14.4.7, 9 pp. 5. Dujella A. ad Pethö A., A Geeralizatio of a Theorem of Baker ad Daveport, Quart. J. Math. Oxford 49(3) (1998), 291 306. 6. Irmak N. ad Szalay L., Triboacci umbers close to the sum 2 a + 3 b + 5 c, Math. Scad. 118 (1), (2016), 27 32. 7. Luca F. ad Szalay L., Fiboacci umbers of the form p a ± p b + 1, Fiboacci Quart., 45 (2007), 98 103. 8. Marques D. ad Togbe A., Fiboacci ad Lucas umbers of the form 2 a + 3 b + 5 c, Proc. Japa Acad., Ser. A 89(2013), 47 50. 9. Marques M., Geeralized Fiboacci umbers of the form 2 a + 3 b + 5 c, Bull. Braz. Math. Soc. New Series 45(3) (2014), 543 557. 10. Matveev E. M., A Explicit Lower Boud for a Homogeeous Ratioal Liear Form i the Logarithms of Algebraic Numbers, Izv. Math. 64(6) (2000), 1217 1269. N. Irmak, Correspodig author, Ömer Halisdemir Uiversity, Art ad Sciece Faculty, Mathematics Departmet, 51240, Niğde, Turkey, e-mail: irmak@igde.edu.tr M. Alp, Ömer Halisdemir Uiversity, Art ad Sciece Faculty, Mathematics Departmet, 51240, Niğde, Turkey, e-mail: muratalp@igde.edu.tr