A Study on Some Integer Sequences

Size: px
Start display at page:

Download "A Study on Some Integer Sequences"

Transcription

1 It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, A Study o Some Iteger Sequeces Serpil Halıcı Sakarya Uiversity, Departmet of Mathematics Esetepe Campus, Sakarya, Turkey shalici@sakarya.edu.tr Abstract. I this ote, some iteger sequeces are ivestigated ad the relatioships betwee them are obtaied. Especially, may similarities betwee eumeratio of geeralized iboacci sequeces ad Padova sequece are realized. By this similarities some ew sequeces are obtaied. Also, recurrece relatios that satisfied by the sequeces are studied. Mathematics Subject Classificatio: B37, B39, B0 Keywords: Cotiued ractio, Recurrece Relatio, iboacci Sequece. Itroductio Edouard ucas(84 89) made a deep study of sequeces which is called geeralized iboacci sequeces that begi the sum of the precedig two. The simplest such series; 0,,,,3,5,8,3,, is called the iboacci sequeces by ucas. The ext simplest series,,,3,4,7,,8, is the called the ucas umbers i his hoor. The iboacci rule of addig the latest two to get the ext is kept, but here we begi with ad. The positio of each umber i this sequeces is traditioally idicated by a subscript, so that 0 0,,, 3 () ad so o. Thus, iboacci sequece ca be defied as follows + - ; () which two boudary coditios; 0 0,. The ucas sequece is defied as follows where we write its members as - + -, > which two boudary coditios; 0,. ucas umbers have lots of properties similar to those of iboacci umbers.

2 04 S. Halıcı + If th iboacci umber, the is equal to a cotiued fractio.ideed, we apply the Euclidea algorithm to + ad. I effect we get a sequece of + equatios: [ ;,, ] If the value of cotiued fractio [ ;, ] is called δ, ad the th covergece of this fractio is [ ;,...,] + + δ lim[ ;,..., ] lim C lim lim C the, +,the positive root of this equatio δ + 5 ;,... which is kow as golde ratio[ 4 ]. is [ ] or ay positive real umber k, the k-iboacci sequece, say { k } N recurretly by k, + kk, + k,, is defied, (3) with iitial coditios 0 ;. If k, the classical iboacci sequece k, 0 k, is obtaied ad if k, the classical Pell sequece appears. Note that if k is a real variable x the iboacci polyomials defied by k x,, ad they correspod to the + ( x) x x ( x) + ( x) if 0, if, if f (4). Some Properties of iboacci Sequece Theorem.: If, 3 ad for 3, + ad 5 5 α + ve β the α β + (5) Proof: The proof by iductio is easy. Defiitio. ( Biet s ormula) Alteratively we ca defie the iboacci umbers for iteger by

3 A study o some iteger sequeces 05 (6) where α ad β are two solutios of ( z) z z α + α, β + β. The p. Note that α + β, αβ, + α ( α + ) β ( β + ) α β. Here the formula idirectly implies that, for 0, 0,, + which is a repeated correlatio[ 3 ] The th k- iboacci umber is give by k, r r r r (7) where r, r are the roots of the characteristic equatio r kr + ad r f r. iear Algebra. Defie matrices 0 M, P α β, 0 D α 0 β (8) Ad for iteger, defie v (9) Stadard computatios show that β - P β α - α α 0 0 β, D (0) The characteristic polyomial of M is p(z) ad a diagoal decompositio of M is M PDP [] 3. The Mv v +, ad two routie iductios show that v M v ad M PD P. We coclude that v PD P v yields followig equatio i vector form:

4 06 S. Halıcı Theorem.: or, the cosequtive ucas umbers are prime umbers i 4. theirselves, that meas (, + ) [ ] k k k Defiitio.: If p ( x) x ak x ak x... ax a0 polyom is a k degree moic polyom, the the compaio matrix is defied such as[ ]: A px ( ) a0 a a... ak ak () + Theorem.3 : et, 0, the A 0 With the help of this theorem, each required ucas umber ca easily be foud. or example 6 th ucas umber is: A Defiitio.3: The Padova sequece is the sequece of itegers P() defied by the iitial values p(0)p()p() () ad the recurrece relatio P()P( )+P( 3) (3) The first few values of P() are,,,,,3,4,5,7,9,,6,,8, [ ]. Whe the table writte for ucas sequece, is agai rewritte for iboacci sequece, the sum of the diagoal elemets sums up to Padova sequece. Now cosider the ifiite dimesioel matrix A ij where we defie recursively each elemets a ij as follows for i,j,[ 5 ]; a ij if, i j A ij a ij 0 if, i > j or j i+ (4) a ij a i-,j- + a i-,j- other cases.

5 A study o some iteger sequeces 07 Thus, we obtai the followig table: Table. The elemets of the A ij matrix i / j M The Results Accordig to the table above, the followig results could be writte: Corollary 3.: (a) or i,j ; ai, j j + of S() : j i (b) The sum of the diagoal elemets o the table are the elemets ( ) k+ S a, k. (5) k The first few values of S() are,,,,3,3,4,6,7,0,3,7,3, Note that the S() sequece also satisfies the recurrece relatios; S()P()+P( 3) ; P(0) P() P() S()P(-)+.P( 3) (6) S()P() -P( ) ; S(0) S(), S() (c) or, if the rows of the table are show by R(), the the sum of the elemets of R() could be foud accordig to this formula: R(). 3 (7) The elemets of this sequece are the elemets of Pisot sequece.

6 08 S. Halıcı Corollary 3.: or sequeces ad if >4, the -4. Proof: This could be verified by iductio. If 5, 5 4, 5 5, 5-4 the 5 5. et 4<k< be true. Namely, -4. We will show that Sice ad from hypothesis with the help of equatios - 4 ad - -, it is see that Corollary 3.3: et s cosider three differet iteger sequeces whose a few first terms are as followig: P:,,,3,4,7,,8, ; where P() P(-) + P(-3) P r :3,0,,3,,5,5,7,0,,7, ;wherep r ()P r (-)+P r (-3) (8) S:,,,3,3,4,6,7,0,3,7,3, ;where S() S(-) + S(-3) Betwee these sequeces, for >, S() P r ()+P(-) is valid. Here P r () is a Padova sequece the iitial terms of which are differet. Proof: et s assume 3 i order to prove by iductio. Sice, S(3)30, P r (3) 9, P(3-) P() rom equatio S(3) P r (3)+P() the validity of the equatio is obvius. et <k be true. That s for <k S()P r () +P(-), S(+)P r (+)+P(-). (9) The validity of this equatio should be show. Sice S(+) S(-) + S(-) from hypothesis S(-) P r (-)+P(-3). With the help of S(-)P r (-)+P(-4) the validity of this equatio is obvius. With the help of these tables several iteger sequeces could be established. Moreover, the relatios betwee the properties of the sequeces could be uderstood easily.

7 A study o some iteger sequeces 09 REERENCES [] [] I.Nive, H.S. Zuckerma, H.. Motgomery, A itroductio to the theory of umbers, 5 th Ed., Wiley, New York, 99. [] 3 M. Marcus ad H. Mic, A survey of matrix theory ad matrix iequalities, Ally ad Baco, Bosto, 964. [] 4 T. Koshy, iboacci ad ucas Numbers with Applicatios, Wiley, New York, 00. [] 5 Y.Türker Ulutaş ad N. Özgür, A Iterestig Table Cotaied Biomial Coefficiets, Iteratioal Joural of Cotemporary Mathematical Scieces, vol., Number 6, (006), Received: July 0, 007

On the Jacobsthal-Lucas Numbers by Matrix Method 1

On the Jacobsthal-Lucas Numbers by Matrix Method 1 It J Cotemp Math Scieces, Vol 3, 2008, o 33, 1629-1633 O the Jacobsthal-Lucas Numbers by Matrix Method 1 Fikri Köke ad Durmuş Bozkurt Selçuk Uiversity, Faculty of Art ad Sciece Departmet of Mathematics,

More information

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

More information

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 +

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 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Matrix representations of Fibonacci-like sequences

Matrix representations of Fibonacci-like sequences NTMSCI 6, No. 4, 03-0 08 03 New Treds i Mathematical Scieces http://dx.doi.org/0.085/tmsci.09.33 Matrix represetatios of Fiboacci-like sequeces Yasemi Tasyurdu Departmet of Mathematics, Faculty of Sciece

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Reciprocal Series of K Fibonacci Numbers with Subscripts in Linear Form

Reciprocal Series of K Fibonacci Numbers with Subscripts in Linear Form IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578 p-issn: 39-765X Volume Issue 6 Ver IV (Nov - Dec06) PP 39-43 wwwiosrjouralsorg Reciprocal Series of K iboacci Numbers with Subscripts i iear orm Sergio

More information

ON SOME RELATIONSHIPS AMONG PELL, PELL-LUCAS AND MODIFIED PELL SEQUENCES

ON SOME RELATIONSHIPS AMONG PELL, PELL-LUCAS AND MODIFIED PELL SEQUENCES SAÜ Fe Bilimleri Dergisi, Cilt, Sayı, s-5, 00 O Some Relatioships Amog ell, ell-lucas ad Modified ell Seueces ON SOME RELATIONSHIS AMONG ELL, ELL-LUCAS AND MODIFIED ELL SEQUENCES, Ahmet DAŞDEMİR Sakarya

More information

Pellian sequence relationships among π, e, 2

Pellian sequence relationships among π, e, 2 otes o umber Theory ad Discrete Mathematics Vol. 8, 0, o., 58 6 Pellia sequece relatioships amog π, e, J. V. Leyedekkers ad A. G. Shao Faculty of Sciece, The Uiversity of Sydey Sydey, SW 006, Australia

More information

Applied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients

Applied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients Applied Mathematics Letters 3 (1 68 7 Cotets lists available at ScieceDirect Applied Mathematics Letters joural homepage: wwwelseviercom/locate/aml O the properties of Lucas umbers with biomial coefficiets

More information

TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction

TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction Math Appl 6 2017, 143 150 DOI: 1013164/ma201709 TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES PANKAJ KUMAR DAS ad LALIT K VASHISHT Abstract We preset some iequality/equality for traces of Hadamard

More information

ON SOME GAUSSIAN PELL AND PELL-LUCAS NUMBERS

ON SOME GAUSSIAN PELL AND PELL-LUCAS NUMBERS Ordu Üiv. Bil. Tek. Derg., Cilt:6, Sayı:1, 016,8-18/Ordu Uiv. J. Sci. Tech., Vol:6, No:1,016,8-18 ON SOME GAUSSIAN PELL AND PELL-LUCAS NUMBERS Serpil Halıcı *1 Sia Öz 1 Pamukkale Ui., Sciece ad Arts Faculty,Dept.

More information

Continued Fractions and Pell s Equation

Continued Fractions and Pell s Equation Max Lah Joatha Spiegel May, 06 Abstract Cotiued fractios provide a useful, ad arguably more atural, way to uderstad ad represet real umbers as a alterative to decimal expasios I this paper, we eumerate

More information

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity

More information

arxiv: v1 [math.fa] 3 Apr 2016

arxiv: v1 [math.fa] 3 Apr 2016 Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert

More information

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

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

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

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction 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)

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

Math 104: Homework 2 solutions

Math 104: Homework 2 solutions Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

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

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

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

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile.  s: / THE GELIN-CESÀRO IDENTITY IN SOME THIRD-ORDER JACOBSTHAL SEQUENCES arxiv:1810.08863v1 [math.co] 20 Oct 2018 GAMALIEL CERDA-MORALES 1 1 Istituto de Matemáticas Potificia Uiversidad Católica de Valparaíso

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

Math 475, Problem Set #12: Answers

Math 475, Problem Set #12: Answers Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe

More information

Math 2112 Solutions Assignment 5

Math 2112 Solutions Assignment 5 Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger

More information

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

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun Korea J. Math. 23 2015) No. 3 pp. 371 377 http://dx.doi.org/10.11568/kjm.2015.23.3.371 COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q } Sag Pyo Ju Abstract. I this ote we cosider a geeralized

More information

arxiv: v1 [math.co] 3 Feb 2013

arxiv: v1 [math.co] 3 Feb 2013 Cotiued Fractios of Quadratic Numbers L ubomíra Balková Araka Hrušková arxiv:0.05v [math.co] Feb 0 February 5 0 Abstract I this paper we will first summarize kow results cocerig cotiued fractios. The we

More information

V. Adamchik 1. Recursions. Victor Adamchik Fall of x n1. x n 2. Here are a few first values of the above sequence (coded in Mathematica)

V. Adamchik 1. Recursions. Victor Adamchik Fall of x n1. x n 2. Here are a few first values of the above sequence (coded in Mathematica) V. Adamchik Recursios Victor Adamchik Fall of 2005 Pla. Covergece of sequeces 2. Fractals 3. Coutig biary trees Covergece of Sequeces I the previous lecture we cosidered a cotiued fractio for 2 : 2 This

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

On the Fibonacci-like Sequences of Higher Order

On the Fibonacci-like Sequences of Higher Order Article Iteratioal Joural of oder atheatical Scieces, 05, 3(): 5-59 Iteratioal Joural of oder atheatical Scieces Joural hoepage: wwwoderscietificpressco/jourals/ijsaspx O the Fiboacci-like Sequeces of

More information

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

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV

More information

On the Number of 1-factors of Bipartite Graphs

On the Number of 1-factors of Bipartite Graphs Math Sci Lett 2 No 3 181-187 (2013) 181 Mathematical Scieces Letters A Iteratioal Joural http://dxdoiorg/1012785/msl/020306 O the Number of 1-factors of Bipartite Graphs Mehmet Akbulak 1 ad Ahmet Öteleş

More information

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

Sequences of Definite Integrals, Factorials and Double Factorials

Sequences of Definite Integrals, Factorials and Double Factorials 47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology

More information

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

A 2nTH ORDER LINEAR DIFFERENCE EQUATION A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy

More information

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

2.4 - Sequences and Series

2.4 - Sequences and Series 2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,

More information

Linear recurrence sequences and periodicity of multidimensional continued fractions

Linear recurrence sequences and periodicity of multidimensional continued fractions arxiv:1712.08810v1 [math.nt] 23 Dec 2017 Liear recurrece sequeces ad periodicity of multidimesioal cotiued fractios Nadir Murru Departmet of Mathematics Uiversity of Turi 10123 Turi, Italy E-mail: adir.murru@uito.it

More information

arxiv: v1 [math.nt] 10 Dec 2014

arxiv: v1 [math.nt] 10 Dec 2014 A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a

More information

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

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

The Binet formula, sums and representations of generalized Fibonacci p-numbers

The Binet formula, sums and representations of generalized Fibonacci p-numbers Europea Joural of Combiatorics 9 (008) 70 7 wwwelseviercom/locate/ec The Biet formula, sums ad represetatios of geeralized Fiboacci p-umbers Emrah Kilic TOBB ETU Uiversity of Ecoomics ad Techology, Mathematics

More information

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

1+x 1 + α+x. x = 2(α x2 ) 1+x Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem

More information

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a. Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times

More information

A NOTE ON PASCAL S MATRIX. Gi-Sang Cheon, Jin-Soo Kim and Haeng-Won Yoon

A NOTE ON PASCAL S MATRIX. Gi-Sang Cheon, Jin-Soo Kim and Haeng-Won Yoon J Korea Soc Math Educ Ser B: Pure Appl Math 6(1999), o 2 121 127 A NOTE ON PASCAL S MATRIX Gi-Sag Cheo, Ji-Soo Kim ad Haeg-Wo Yoo Abstract We ca get the Pascal s matrix of order by takig the first rows

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

Review Article Incomplete Bivariate Fibonacci and Lucas p-polynomials

Review Article Incomplete Bivariate Fibonacci and Lucas p-polynomials Discrete Dyamics i Nature ad Society Volume 2012, Article ID 840345, 11 pages doi:10.1155/2012/840345 Review Article Icomplete Bivariate Fiboacci ad Lucas p-polyomials Dursu Tasci, 1 Mirac Ceti Firegiz,

More information

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

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

Pell and Lucas primes

Pell and Lucas primes Notes o Number Theory ad Discrete Mathematics ISSN 30 532 Vol. 2, 205, No. 3, 64 69 Pell ad Lucas primes J. V. Leyedekkers ad A. G. Shao 2 Faculty of Sciece, The Uiversity of Sydey NSW 2006, Australia

More information

The r-generalized Fibonacci Numbers and Polynomial Coefficients

The r-generalized Fibonacci Numbers and Polynomial Coefficients It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,

More information

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

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco EXTENDING THE BERNOULLI-EULER METHOD FOR FINDING ZEROS OF HOLOMORPHIC FUNCTIONS Beaissa Beroussi Uiversité Abdelmalek Essaadi, ENSAT de Tager, B.P. 416, Tager, Morocco e-mail: Beaissa@fstt.ac.ma Mustapha

More information

The Phi Power Series

The Phi Power Series The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.

More information

1 Last time: similar and diagonalizable matrices

1 Last time: similar and diagonalizable matrices Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero

More information

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

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

A generalization of Fibonacci and Lucas matrices

A generalization of Fibonacci and Lucas matrices Discrete Applied Mathematics 56 28) 266 269 wwwelseviercom/locate/dam A geeralizatio of Fioacci ad Lucas matrices Predrag Staimirović, Jovaa Nikolov, Iva Staimirović Uiversity of Niš, Departmet of Mathematics,

More information

On Generalized Fibonacci Numbers

On Generalized Fibonacci Numbers Applied Mathematical Scieces, Vol. 9, 215, o. 73, 3611-3622 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.215.5299 O Geeralized Fiboacci Numbers Jerico B. Bacai ad Julius Fergy T. Rabago Departmet

More information

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314

More information

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Sequence A sequence is a function whose domain of definition is the set of natural numbers. Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis

More information

On Infinite Series Involving Fibonacci Numbers

On Infinite Series Involving Fibonacci Numbers Iteratioal Joural of Cotemporary Mathematical Scieces Vol. 10, 015, o. 8, 363-379 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijcms.015.594 O Ifiite Series Ivolvig Fiboacci Numbers Robert Frotczak

More information

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

Roger Apéry's proof that zeta(3) is irrational Cliff Bott cliffbott@hotmail.com 11 October 2011 Roger Apéry's proof that zeta(3) is irratioal Roger Apéry developed a method for searchig for cotiued fractio represetatios of umbers that have a form such

More information

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

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-

More information

3 Gauss map and continued fractions

3 Gauss map and continued fractions ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

(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

(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 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

PAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION

PAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

(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.

(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. ON THE LENGTH OF THE EUCLIDEAN ALGORITHM E. P. IV1ERKES ad DAVSD MEYERS Uiversity of Ciciati, Ciciati, Ohio Throughout this article let a ad b be itegers, a > b >. The Euclidea algorithm geerates fiite

More information

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1 MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The

More information

Tauberian Conditions in Terms of General Control Modulo of Oscillatory Behavior of Integer Order of Sequences

Tauberian Conditions in Terms of General Control Modulo of Oscillatory Behavior of Integer Order of Sequences Iteratioal Mathematical Forum, 2, 2007, o. 20, 957-962 Tauberia Coditios i Terms of Geeral Cotrol Modulo of Oscillatory Behavior of Iteger Order of Sequeces İ. Çaak Departmet of Math., Ada Mederes Uiversity,

More information

ON POINTWISE BINOMIAL APPROXIMATION

ON POINTWISE BINOMIAL APPROXIMATION Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece

More information

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

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

BINOMIAL COEFFICIENT AND THE GAUSSIAN

BINOMIAL COEFFICIENT AND THE GAUSSIAN BINOMIAL COEFFICIENT AND THE GAUSSIAN The biomial coefficiet is defied as-! k!(! ad ca be writte out i the form of a Pascal Triagle startig at the zeroth row with elemet 0,0) ad followed by the two umbers,

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California GENERALIZATIONS OF ZECKENDORFS THEOREM TilVIOTHY J. KELLER Studet, Harvey Mudd College, Claremot, Califoria 91711 The Fiboacci umbers F are defied by the recurrece relatio Fi = F 2 = 1, F = F - + F 0 (

More information

You may work in pairs or purely individually for this assignment.

You may work in pairs or purely individually for this assignment. CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or

More information

Observations on Derived K-Fibonacci and Derived K- Lucas Sequences

Observations on Derived K-Fibonacci and Derived K- Lucas Sequences ISSN(Olie): 9-875 ISSN (Prit): 7-670 Iteratioal Joural of Iovative Research i Sciece Egieerig ad Techology (A ISO 97: 007 Certified Orgaizatio) Vol. 5 Issue 8 August 06 Observatios o Derived K-iboacci

More information

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor IJITE Vol Issue-, (November 4) ISSN: 3-776 ATTRACTIVITY OF A HIGHER ORDER NONLINEAR DIFFERENCE EQUATION Guagfeg Liu School of Zhagjiagag Jiagsu Uiversit of Sciece ad Techolog, Zhagjiagag, Jiagsu 56,PR

More information

Regent College Maths Department. Further Pure 1. Proof by Induction

Regent College Maths Department. Further Pure 1. Proof by Induction Reget College Maths Departmet Further Pure Proof by Iductio Further Pure Proof by Mathematical Iductio Page Further Pure Proof by iductio The Edexcel syllabus says that cadidates should be able to: (a)

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES 9 SEQUENCES AND SERIES INTRODUCTION Sequeces have may importat applicatios i several spheres of huma activities Whe a collectio of objects is arraged i a defiite order such that it has a idetified first

More information

Numerical Method for Blasius Equation on an infinite Interval

Numerical Method for Blasius Equation on an infinite Interval Numerical Method for Blasius Equatio o a ifiite Iterval Alexader I. Zadori Omsk departmet of Sobolev Mathematics Istitute of Siberia Brach of Russia Academy of Scieces, Russia zadori@iitam.omsk.et.ru 1

More information

CHAPTER 1 SEQUENCES AND INFINITE SERIES

CHAPTER 1 SEQUENCES AND INFINITE SERIES CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig

More information

SPECTRUM OF THE DIRECT SUM OF OPERATORS

SPECTRUM OF THE DIRECT SUM OF OPERATORS Electroic Joural of Differetial Equatios, Vol. 202 (202), No. 20, pp. 8. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.ut.edu ftp ejde.math.txstate.edu SPECTRUM OF THE DIRECT SUM

More information

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Dominating Sets and Domination Polynomials of Square Of Cycles

Dominating Sets and Domination Polynomials of Square Of Cycles IOSR Joural of Mathematics IOSR-JM) ISSN: 78-78. Volume 3, Issue 4 Sep-Oct. 01), PP 04-14 www.iosrjourals.org Domiatig Sets ad Domiatio Polyomials of Square Of Cycles A. Vijaya 1, K. Lal Gipso 1 Assistat

More information

Unit 6: Sequences and Series

Unit 6: Sequences and Series AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo

More information

ON THE HADAMARD PRODUCT OF BALANCING Q n B AND BALANCING Q n

ON THE HADAMARD PRODUCT OF BALANCING Q n B AND BALANCING Q n TWMS J App Eg Math V5, N, 015, pp 01-07 ON THE HADAMARD PRODUCT OF ALANCING Q AND ALANCING Q MATRIX MATRIX PRASANTA KUMAR RAY 1, SUJATA SWAIN, Abstract I this paper, the matrix Q Q which is the Hadamard

More information

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION J Korea Math Soc 44 (2007), No 2, pp 487 498 GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION Gi-Sag Cheo ad Moawwad E A El-Miawy Reprited from the Joural of the Korea Mathematical

More information

ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY

ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY Aales Uiv. Sci. Budapest., Sect. Comp. 39 (203) 257 270 ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY E. Kaya (Mersi, Turkey) M. Kucukasla (Mersi, Turkey) R. Wager (Paderbor, Germay) Dedicated

More information

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece

More information

The Simplex algorithm: Introductory example. The Simplex algorithm: Introductory example (2)

The Simplex algorithm: Introductory example. The Simplex algorithm: Introductory example (2) Discrete Mathematics for Bioiformatics WS 07/08, G. W. Klau, 23. Oktober 2007, 12:21 1 The Simplex algorithm: Itroductory example The followig itroductio to the Simplex algorithm is from the book Liear

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information