The Pascal Fibonacci numbers

Similar documents
Pell and Lucas primes

Pellian sequence relationships among π, e, 2

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Combinatorially Thinking

CALCULATION OF FIBONACCI VECTORS

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

On Generalized Fibonacci Numbers

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

SOME TRIBONACCI IDENTITIES

On the Jacobsthal-Lucas Numbers by Matrix Method 1

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS

2.4 - Sequences and Series

CALCULATING FIBONACCI VECTORS

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recurrence Relations

~W I F

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

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

1/(1 -x n ) = \YJ k=0

A Remark on Relationship between Pell Triangle and Zeckendorf Triangle

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

Math 2112 Solutions Assignment 5

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? 1. My Motivation Some Sort of an Introduction

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

The Binomial Theorem

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

Sequences, Sums, and Products

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

is also known as the general term of the sequence

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

On Infinite Series Involving Fibonacci Numbers

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

1 Generating functions for balls in boxes

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

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

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

n k <. If an even palindrome subsequence consists 2

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Series III. Chapter Alternating Series

(a) (b) All real numbers. (c) All real numbers. (d) None. to show the. (a) 3. (b) [ 7, 1) (c) ( 7, 1) (d) At x = 7. (a) (b)

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

ADVANCED PROBLEMS AND SOLUTIONS

Bertrand s Postulate

Chimica Inorganica 3

Week 5-6: The Binomial Coefficients

A Study on Some Integer Sequences

CS284A: Representations and Algorithms in Molecular Biology

Sums, products and sequences

PROPERTIES OF AN EULER SQUARE

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

= = =

Information-based Feature Selection

Catalan triangles and Finucan s hidden folders

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

MA131 - Analysis 1. Workbook 9 Series III

Unit 6: Sequences and Series

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

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

P.3 Polynomials and Special products

FINITE TRIGONOMETRIC PRODUCT AND SUM IDENTITIES. 1. Introduction In some recent papers [1, 2, 4, 5, 6], one finds product identities such as.

KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS

Formation of A Supergain Array and Its Application in Radar

XT - MATHS Grade 12. Date: 2010/06/29. Subject: Series and Sequences 1: Arithmetic Total Marks: 84 = 2 = 2 1. FALSE 10.

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

On the number of sums of three unit fractions

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

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

TEACHER CERTIFICATION STUDY GUIDE

EDGE AND SECANT IDEALS OF SHARED-VERTEX GRAPHS

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

Sect 5.3 Proportions

S. S. Dragomir and Y. J. Cho. I. Introduction In 1956, J. Aczél has proved the following interesting inequality ([2, p. 57], [3, p.

On Second Order Additive Coupled Fibonacci Sequences

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

A Combinatoric Proof and Generalization of Ferguson s Formula for k-generalized Fibonacci Numbers

Objective Mathematics

Substitute these values into the first equation to get ( z + 6) + ( z + 3) + z = 27. Then solve to get

Chapter Unary Matrix Operations

4.3 Growth Rates of Solutions to Recurrences

Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra

Stochastic Matrices in a Finite Field

Linear chord diagrams with long chords

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA

Define and Use Sequences and Series

Math 112 Fall 2018 Lab 8

Topic 9 - Taylor and MacLaurin Series

Sets and Probabilistic Models

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

SEQUENCES AND SERIES

Commutativity in Permutation Groups

arxiv: v1 [math.co] 3 Feb 2013

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

Math 113 Exam 3 Practice

A Simplified Binet Formula for k-generalized Fibonacci Numbers

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

The Phi Power Series

Sets and Probabilistic Models

MAT 271 Project: Partial Fractions for certain rational functions

Transcription:

Notes o Number Theory ad Discrete Mathematics Vol. 19, 013, No. 3, 5 11 The Pascal Fiboacci umbers J. V. Leyedekkers 1 ad A. G. Shao 1 Faculty of Sciece, The Uiversity of Sydey NSW 00, Australia Faculty of Egieerig & IT, Uiversity of Techology Sydey NSW 007, Australia e-mails: tshao38@gmail.com, Athoy.Shao@uts.edu.au Abstract. The Pascal Fiboacci (PF) umbers for a give Fiboacci umber sum to give the values of that Fiboacci umber. Idividual PF umbers are members of oe of the triagular, tetrahedral or petagoal series or have factors i commo with the pyramidal or other geometric series. For composite umbers, partial sums of PF umbers ca yield a factor, while prime Fiboacci umbers are detected with sums of squares. Keywords: Fiboacci umbers, Biet equatio, Pascal Triagle, Triagular umbers, Tetrahedral umbers, Petagoal umbers, Pyramidal umbers. AMS Classificatio: 11B39, 11B50. 1 Itroductio It is well-kow that the umbers alog the leadig diagoals i the Pascal Triagle sum to umbers i the Fiboacci sequece {F } (with geeralizatios to higher order recursive sequeces ad geometric dimesios [7]). This provides a simple way to calculate the Fiboacci umbers without irratioals, as i the Biet equatio [5, ]; that is by 1 ( p 1) p i F = +. (1.1) i= i 1 We have called elemets of these Pascal Fiboacci (PF) umbers, each of which is give p i N p i = (1.) i 1 which are listed i Table 1 for p from 7 to 59 []. For example, whe p = 17 ad i = 4, the third umber i the sum is N P17 (3) = 8. Similarly, whe p = 43 ad i = 5, N P43 (4) = 73815. Agai, whe p = 59, the last i = ½(p 1) =9, so the 8 th umber i the sum is N P59 (8) = = 30! / 8!! = 435. 5

p F p 7 5, 11 9, 8,35,15 13 11, 45,84,70,1 17 15, 91,8,495,4,10,3 19 17, 10,455,1001,187,94,330,45 3 1, 190,99,300,188,8008,435,3003,715, 9 7, 35,300,10,3349,7413,1180,15970,9378,43758,137,180,105 31 9, 378,95,14950,53130,13459,45157,319770,93930,18475,7558,1854,380,10 37 35, 51,545,3590,19911,593775,150780,3108105,4885,5311735,4457400, 70415,11440,319770,544,4845,171 41 39, 703,7770,58905,343,1344904,47048,10518300,010075,30045015, 3459790,3041755,0058300,957700,3870,735471,100947,7315,10 43 41, 780,9139,73815,435897,194779,7450,181504,3857100,45140, 847315,84935,783915,401100,1738380,5311735,1081575,13459, 8855,31 47 45, 94,1341,111930,749398,3838380,15380937,4890349,144030,541885,4175900, 548354040,5731440,47143500,300540195,145475,51895935,1313110,0075, 3030,150,7 53 51, 15,1844,194580,1533939,93819,453790,17737,5391995,147144973, 31594198,558853480,8145444,99554100,93419970,730787110,45375750, 0391430,81880900,579840,443515,58595,47500,0475,351 59 57, 1540,35,3151,8985,035850,115775100,5387850,05445534,54071589, 1741713317,389101755,730009045,11495580858,1515359,1509710, 151584480450,1133801800,8934410,3357800010,187577470, 3799700,834451800,13118140,1388415,9019,3145,435 Table 1. Pascal Fiboacci umbers I this paper, we examie the details of the structure of these umbers. I particular, the PF umbers are formed by sequetial ratios of factorials ad therefore have a regular structure. They are composed of primes, the maximum of which is P i 1 for F Pi. For istace, the PF umbers associated with F 19 have the primes {, 3, 5, 7, 11, 13, 17} i varyig proportios. The simple structure makes the positio of each alog the diagoals sigificat. For example, all the first umbers equal (p ), the secod are triagular as are the last, while the third umbers are tetrahedral. The secod last umbers, N i, (i=½(p 5)), are petagoal [, 3]. The secod PF umbers The triagular umbers ca be represeted by T = ½( + 1). (.1) The secod PF umber of each F p (7 p 59) are give by Equatio (.1) with = p 4 (Table ).

1 p = p 4 N = ( 1) + 7 3 11 7 8 13 9 45 17 13 91 19 15 10 3 19 190 9 5 35 31 7 378 37 33 51 41 37 703 43 39 780 47 43 94 53 49 15 59 55 1540 1 57 153 Table. Secod PF Numbers 3 The third PF umbers The tetrahedral umbers i this cotext [, 3] are give by ad the third PF umbers fit this series with = (p ) (Table 3). H = 1 ( + 1)( + ) (3.1) 1 p = p N = ( + 1)( ) 7 3 + 11 5 35 13 7 84 17 11 8 19 13 455 3 17 99 9 3 300 31 5 95 37 31 545 41 35 7770 43 37 9139 47 41 1341 53 47 1844 59 53 35 1 55 90 Table 3. Third PF Numbers

4 The fourth PF umbers Assumig the patter for cotiues, that is (p i) for, are the fourth umbers compatible with some geometric umber series? Usig = p 8 for the pyramidal umbers [, 3], that is Q = 1 ( + 1)( + 1) (4.1) it is foud that these umbers always have a factor i commo with the fourth PF umbers. I fact, the factor 5 is commo to all fourth PF umbers except F 19, F 9, F 59 ; that is, whe p has a right-ed-digit (RED) of 9 ad is therefore a elemet of the Class 45 Z5 [1, 4, ]. 5 Last three umbers (a) The last umbers are triagular umbers which satisfy Equatio (.1) with = ½(p 1). All these umbers are divisible by 3 so that they fall ito a special subset of the triagular umbers [, 3] (Table 4). p = ½(p 1) N i (Eq.1) ⅓N i 7 3 11 5 15 5 13 1 7 17 8 3 1 19 9 3 15 3 11 9 14 105 35 31 15 10 40 37 18 171 57 41 0 10 70 43 1 31 77 47 3 7 9 53 351 117 59 9 435 145 1 30 45 155 Table 4. i = ½(p 3) (b) The secod last umbers N i (i = ½(p 5)) always have 5 as a factor. These umbers are always divisible by 5, ad at least oe of the factors is triagular with varyig from 1 to. Moreover, these umbers are petagoal, give by [, 3]: with = p /4 (Table 5). D = 1 (3 1) (5.1) 8

p = p /4 * D i = ½(3 1) positio, i 11 5 35 3 13 7 70 4 17 1 10 19 15 330 7 3 715 9 9 35 180 1 31 40 380 13 37 57 4845 1 41 70 7315 18 43 77 8855 19 47 9 150 1 53 117 0475 4 59 145 3145 4 1 155 3590 8 Table 5. Petagoal umbers D i = ½(3 1) ad positio i; *residual of 0.04 for all p is eglected (c) Third last umbers, N i, i = ½(p 7), are always eve (except for p = 3 or 41), ad all are divisible by 7 (11 umbers from p = 17 to 59). Eight of the umbers also have 8 as a factor. Other umbers, N i, with i = 4 to 14 The remaiig umbers have factors i commo with triagular, tetrahedral ad other geometric series, with = p i. They geerally have a factor commo to all, but there are a few exceptios: examples (Table ): i Commo factor for i p Exceptios Factor of N i 4 5 9,59 3 5 3 13,19,31,37 7 7 41 11 7 5 31,41,47 3 8 3 53 11 9 5 9,59 11 10 11 43 3 11 5 9 7 1 5 31,37 7 13 5 37,53 7 14 5 59 11 Table. Remaiig umbers, N i 9

7 Idetifyig prime F p We have previously [] show how the structure of the Fiboacci umbers ca help to idetify primes. Some alterative complemetary methods are outlied i (a) ad (b) below. 7.1 From PF umbers The PF umbers ca be partially summed to fid a suitable factor (Table 7). p F p Numbers summed Factors 19 4181 S = N + N + N = 17 + 10 + 145 = 37 1 37 113 1 3 37 4157817 S = N + N = 35 + 51 = 4 149 73 149 1 7. Sum of squares Aother method is via the sum of squares [1]: 1 Table 7. Partial sums of PF umbers F p = d + e. (7.1) Primes oly have oe set of (d, e) with o commo factors. Geerally composites have the same umber of sets as their factors. Oe (d, e) set is give by ( F ) ( F ) 1 F (7.1) p = 1 + ( p + 1) ( p 1) with others from various techiques [1]. Examples are displayed i Table 8. p F p factors d e d, e as F 7 13-3 F 4 F 3 11 89-5 8 F 5 F 13 33-13 8 F 7 F 17 1597-1 34 F 8 F 9 19 4181 37,113 55 34 F 10 F 9 41 50 3 857-89 144 F 11 F 1 9 5149-377 10 F 14 F 15 31 1349 557,417 987 10 F 1 F 15 875 7 37 4157817 73,149,1 4181 584 F 19 F 18 4909 44 3859 3044 Table 8. Sums of squares Fially, the iterested reader may like to develop geeralizatios of the Pascal Fiboacci umbers which ca be made with suitable geeralizatios of Pascal s triagle [8]. 10

Refereces [1] Leyedekkers, J. V., A. G. Shao. Fiboacci Numbers withi Modular Rigs. Notes o Number Theory ad Discrete Mathematics. Vol. 4, 1998, No. 4, 15 174. [] Leyedekkers, J. V., A. G. Shao. The Structure of Geometric Number Sequeces. Notes o Number Theory ad Discrete Mathematics. Vol. 17, 011, No. 3, 31 37. [3] Leyedekkers, J. V., A. G. Shao. Geometric ad Pellia Sequeces. Advaced Studies i Cotemporary Mathematics. Vol., 01, No. 4, 507-508. [4] Leyedekkers, J. V., A. G. Shao. The Structure of the Fiboacci Numbers i the Modular Rig Z 5. Notes o Number Theory ad Discrete Mathematics. Vol. 19, 013, No. 1, 7. [5] Leyedekkers, J. V., A. G. Shao. O the Golde Ratio. Advaced Studies i Cotemporary Mathematics. Vol. 3, 013, No. 1, 195 01. [] Leyedekkers, J. V., A. G. Shao. Fiboacci ad Lucas Primes. Notes o Number Theory ad Discrete Mathematics. Vol. 19, 013, No., 49 59. [7] Shao, A. G. Triboacci Numbers ad Pascal s Pyramid. The Fiboacci Quarterly. Vol. 15, 1977, No. 3, 8, 75. [8] Wog, C. K., T. W. Maddocks. A Geeralized Pascal s Triagle. The Fiboacci Quarterly. Vol. 13, 1975, No., 134 13. 11