DOCSLIB.ORG

Squares, Triangle Numbers and Fibonacci Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Squares, Triangle Numbers and Fibonacci Numbers SQUARES,TRIANGLE NUMBERS AND FIBONACCI NUMBERS Todd Cochrane 1 / 30 The Fifth Night: Squares and Triangle Numbers Squares: 12; 22; 32; 42; 52;::: = 1; 4; 9; 16; 25; 36; 49;::: ••••• •••• ••• ••••• •• •••• • ••• ••••• •• •••• ••• ••••• •••• ••••• Differences of Consecutive Squares: 1; 4; 9; 16; 25; 36; 49; 64; 81; 100 Rule: The differences of consecutive squares are the 2 / 30 Difference of Consecutive Squares Geometric Viewpoint: ••••• ••••• ••••• ••••• ••••• Algebraic Viewpoint: n2 − (n − 1)2 3 / 30 Sum of the first n odd numbers n sum total 1 1 1 2 1 + 3 4 3 1 + 3 + 5 4 1 + 3 + 5 + 7 5 1 + 3 + 5 + 7 + 9 6 1 + 3 + 5 + 7 + 9 + 11 Rule: The sum of the first n odd numbers is , 4 / 30 Geometric view of sum of odd numbers ••••• ••••• ••••• ••••• ••••• 5 / 30 Triangle Numbers Triangle Numbers: 1, 3, 6, 10, 15, 21, 28, ... • • • •• • •• • •• ••• •• ••• ••• •••• •••• ••••• Tn = n-th triangle number 6 / 30 Differences between consecutive triangle numbers 1; 3; 6; 10; 15; 21; 28; 36; 45; 55;::: Rule: The differences between consecutive triangle numbers are Tn − Tn−1 = 7 / 30 Triangle Number as a Sum • •• ••• •••• Tn = The n-th triangle number is 8 / 30 Sum of Consecutive Triangle Numbers •••• •••• •••• •••• The sum of two consecutive triangle numbers is Tn−1 + Tn = Example: T6 + T7 = Check Answer: 9 / 30 Formula for the n-th Triangle Number Tn ••••• ••••• ••••• ••••• Rule: Tn = Example: What is the hundredth triangle number? 10 / 30 Sum of the first n natural numbers We’ve seen two formulas for the n-th triangle number: 1. Tn = 1 + 2 + 3 + ··· + n 1 2. Tn = 2 n(n + 1) Thus we obtain n(n + 1) 1 + 2 + 3 + ··· + n = 2 Example: Find 1 + 2 + 3 + ··· + 100 11 / 30 Another way to add 1 + 2 + 3 + ··· + 100 12 / 30 Sums of Squares Represent n as a sum of squares using as few squares as possible. Squares: 1,4,9,16,25,36,49,64,81,... 1 = 1 10 = 9 + 1 2 = 1 + 1 20 = 3 = 1 + 1 + 1 30 = 4 = 4 40 = 5 = 4 + 1 50 = 6 = 4 + 1 + 1 60 = 7 = 4 + 1 + 1 + 1 70 = 8 = 4 + 4 80 = 9 = 9 90 = Fact: Every positive integer is a sum of at most squares. (The same value can be used more than once.) 13 / 30 Sums of Triangle Numbers Triangle Numbers: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66 1 = 1 10 = 10 2 = 1 + 1 20 = 3 = 3 30 = 4 = 3 + 1 40 = 5 = 3 + 1 + 1 50 = 6 = 3 + 3 60 = 7 = 3 + 3 + 1 70 = 8 = 6 + 1 + 1 80 = 9 = 6 + 3 90 = Fact: Every positive integer is a sum of at most triangle numbers. (The same value can be used more than once.) 14 / 30 Further Properties of Squares and Triangle Numbers • There are infinitely many triangle numbers that are squares, T1 = 1, T8 = 36, T49 = 1225,... • A positive integer n is a triangle number if and only if 8n + 1 is a square. • The sum of the reciprocals of all triangle numbers is 1 1 1 1 1 1 1 + + + + + + + ··· = 3 6 10 15 21 28 15 / 30 The Sixth Night: The Fibonacci Sequence “Lots of number devils in Number Heaven. The bosses do nothing but sit and think. One boss is named Bonacci (for Fibonacci)." Fibonacci lived 1170-1250. Fibonacci sequence appears earlier in Indian mathematics. Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, , ... Fn = n-th Fibonacci Number. Fibonacci Rule: The next term in the Fibonacci sequence is obtained by adding the previous two terms. Fn+1 = Fn + Fn−1 16 / 30 Fn+1 − Fn = Fn−1 Differences of consecutive Fibonacci numbers 1 1 2 3 5 8 13 21 34 55 17 / 30 Differences of consecutive Fibonacci numbers 1 1 2 3 5 8 13 21 34 55 Fn+1 − Fn = Fn−1 18 / 30 Snow Rabbits Reproduction Rule: I. Start with a pair of newborn snow rabbits (one male, one female): ◦◦ II. After one month snow rabbits turn brown: •• III. After another month they have a pair of babies (one male, one female) and then continue to have a pair each month thereafter. Month Rabbits Number Pairs 1 ◦◦ 1 2 •• 1 3 ◦◦; •• 2 4 ◦◦; ••; •• 3 5 ◦◦; ◦◦; ••; ••; •• 5 6 ◦◦; ◦◦; ◦◦; ••; ••; • • ••; ••; •• 8 Can you see three different Fibonacci sequences in the above array? 19 / 30 Tree Branching: Branching Rule: I. Start with a stem (with no branches). II. After two years of growth a new branch is formed, and then a new branch is formed each year thereafter. III. Each new branch follows the same rule as the original stem. year 6 year 5 year 4 year 3 year 2 year 1 20 / 30 2 2 Fn + Fn+1 Total 1 + 1 2 1 + 4 5 4 + 9 13 ; 9 + 25 34 25 + 64 89 64 + 169 233 2 2 Rule: Fn + Fn+1 = F2n+1 Sum of Consecutive Fibonacci Number Squares Fn 1 1 2 3 5 8 13 21 34 2 Fn 1 1 4 9 25 64 169 441 21 / 30 2 2 Rule: Fn + Fn+1 = F2n+1 Sum of Consecutive Fibonacci Number Squares Fn 1 1 2 3 5 8 13 21 34 2 Fn 1 1 4 9 25 64 169 441 2 2 Fn + Fn+1 Total 1 + 1 2 1 + 4 5 4 + 9 13 ; 9 + 25 34 25 + 64 89 64 + 169 233 22 / 30 Sum of Consecutive Fibonacci Number Squares Fn 1 1 2 3 5 8 13 21 34 2 Fn 1 1 4 9 25 64 169 441 2 2 Fn + Fn+1 Total 1 + 1 2 1 + 4 5 4 + 9 13 ; 9 + 25 34 25 + 64 89 64 + 169 233 2 2 Rule: Fn + Fn+1 = F2n+1 23 / 30 Partitioning a Rectangle Draw a rectangle with sides of lengths F3, F4 and partition it into squares with side lengths F1; F2 and F3. Do the same thing for F4; F5. What formula do you discover? 24 / 30 2 2 2 F1 + F2 + ··· + Fn = FnFn+1 Breaking up a number as a sum of Fibonacci numbers Fact: Every positive integer can be expressed uniquely as a sum of one or more distinct Fibonacci numbers no two of which are consecutive. Compare this concept with factoring numbers. What is the difference? Procedure: Start with the biggest Fibonacci number less than or equal to the given number, see what’s left over, and repeat! It’s a lot easier than factoring! 25 / 30 EXAMPLE 1 Express 135 and 150 as a sum of distinct Fibonacci numbers, no two consecutive: 1,2,3,5,8,13,21,34,55,89,144,... 26 / 30 Rule: The sum of the first n Fibonacci numbers is one less than the (n + 2)-nd Fibonacci number. Sum of Fibonacci numbers The Fibonaccis: 1,1,2,3,5,8,13,21,34,55,89,144,... F1 + F2 + F3 + ··· + Fn Total 1 1 1 + 1 2 1 + 1 + 2 4 1 + 1 + 2 + 3 7 1 + 1 + 2 + 3 + 5 12 1 + 1 + 2 + 3 + 5 + 8 20 1 + 1 + 2 + 3 + 5 + 8 + 13 33 1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 27 / 30 Sum of Fibonacci numbers The Fibonaccis: 1,1,2,3,5,8,13,21,34,55,89,144,... F1 + F2 + F3 + ··· + Fn Total 1 1 1 + 1 2 1 + 1 + 2 4 1 + 1 + 2 + 3 7 1 + 1 + 2 + 3 + 5 12 1 + 1 + 2 + 3 + 5 + 8 20 1 + 1 + 2 + 3 + 5 + 8 + 13 33 1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 Rule: The sum of the first n Fibonacci numbers is one less than the (n + 2)-nd Fibonacci number. 28 / 30 Prime factors of Fibonacci Numbers Fn Factorization New Prime 2 2 2 3 3 3 5 5 5 8 23 none 13 13 13 34 2 · 17 17 55 5 · 11 11 89 89 89 144 2432 none 233 233 233 377 13 · 29 29 610 2 · 5 · 61 61 987 3 · 7 · 47 7; 47 Fact: Every Fibonacci number has a prime factor that is not a factor of any earlier Fibonacci number, except 1,8 and 144. 29 / 30 Further remarks • The only square Fibonacci numbers are 0, 1 and 144. • The sum of the first n even numbered Fibonacci numbers is one less than the next Fibonacci number. • The sum of the first n odd numbered Fibonacci numbers is the next Fibonacci number. • If d is a factor of n, then Fd is a factor of Fn. Example: 6 is a factor of 12. F6 = 8, F12 = 144. 8 is a factor of 144. 30 / 30.
Load more

Recommended publications
  • On K-Fibonacci Numbers of Arithmetic Indexes
    Applied Mathematics and Computation 208 (2009) 180–185 Contents lists available at ScienceDirect Applied Mathematics and Computation journal homepage: www.elsevier.com/locate/amc On k-Fibonacci numbers of arithmetic indexes Sergio Falcon *, Angel Plaza Department of Mathematics, University of Las Palmas de Gran Canaria (ULPGC), Campus de Tafira, 35017 Las Palmas de Gran Canaria, Spain article info abstract Keywords: In this paper, we study the sums of k-Fibonacci numbers with indexes in an arithmetic k-Fibonacci numbers sequence, say an þ r for fixed integers a and r. This enables us to give in a straightforward Sequences of partial sums way several formulas for the sums of such numbers. Ó 2008 Elsevier Inc. All rights reserved. 1. Introduction One of the more studied sequences is the Fibonacci sequence [1–3], and it has been generalized in many ways [4–10]. Here, we use the following one-parameter generalization of the Fibonacci sequence. Definition 1. For any integer number k P 1, the kth Fibonacci sequence, say fFk;ngn2N is defined recurrently by Fk;0 ¼ 0; Fk;1 ¼ 1; and Fk;nþ1 ¼ kFk;n þ Fk;nÀ1 for n P 1: Note that for k ¼ 1 the classical Fibonacci sequence is obtained while for k ¼ 2 we obtain the Pell sequence. Some of the properties that the k-Fibonacci numbers verify and that we will need later are summarized below [11–15]: pffiffiffiffiffiffiffiffi pffiffiffiffiffiffiffiffi n n 2 2 r1Àr2 kþ k þ4 kÀ k þ4 [Binet’s formula] Fk;n ¼ r Àr , where r1 ¼ 2 and r2 ¼ 2 . These roots verify r1 þ r2 ¼ k, and r1 Á r2 ¼1 1 2 2 nþ1Àr 2 [Catalan’s identity] Fk;nÀrFk;nþr À Fk;n ¼ðÀ1Þ Fk;r 2 n [Simson’s identity] Fk;nÀ1Fk;nþ1 À Fk;n ¼ðÀ1Þ n [D’Ocagne’s identity] Fk;mFk;nþ1 À Fk;mþ1Fk;n ¼ðÀ1Þ Fk;mÀn [Convolution Product] Fk;nþm ¼ Fk;nþ1Fk;m þ Fk;nFk;mÀ1 In this paper, we study different sums of k-Fibonacci numbers.
    [Show full text]
  • On the Prime Number Subset of the Fibonacci Numbers
    Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach On the Prime Number Subset of the Fibonacci Numbers Lacey Fish1 Brandon Reid2 Argen West3 1Department of Mathematics Louisiana State University Baton Rouge, LA 2Department of Mathematics University of Alabama Tuscaloosa, AL 3Department of Mathematics University of Louisiana Lafayette Lafayette, LA Lacey Fish, Brandon Reid, Argen West SMILE Presentations, 2010 LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions What is a sieve? What is a sieve? A sieve is a method to count or estimate the size of “sifted sets” of integers. Well, what is a sifted set? A sifted set is made of the remaining numbers after filtering. Lacey Fish, Brandon Reid, Argen West LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions What is a sieve? What is a sieve? A sieve is a method to count or estimate the size of “sifted sets” of integers. Well, what is a sifted set? A sifted set is made of the remaining numbers after filtering. Lacey Fish, Brandon Reid, Argen West LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions History Two Famous and Useful Sieves Sieve of Eratosthenes Brun’s Sieve Lacey Fish, Brandon Reid, Argen West
    [Show full text]
  • Fibonacci Number
    Fibonacci number From Wikipedia, the free encyclopedia • Have questions? Find out how to ask questions and get answers. • • Learn more about citing Wikipedia • Jump to: navigation, search A tiling with squares whose sides are successive Fibonacci numbers in length A Fibonacci spiral, created by drawing arcs connecting the opposite corners of squares in the Fibonacci tiling shown above – see golden spiral In mathematics, the Fibonacci numbers form a sequence defined by the following recurrence relation: That is, after two starting values, each number is the sum of the two preceding numbers. The first Fibonacci numbers (sequence A000045 in OEIS), also denoted as Fn, for n = 0, 1, … , are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, ... (Sometimes this sequence is considered to start at F1 = 1, but in this article it is regarded as beginning with F0=0.) The Fibonacci numbers are named after Leonardo of Pisa, known as Fibonacci, although they had been described earlier in India. [1] [2] • [edit] Origins The Fibonacci numbers first appeared, under the name mātrāmeru (mountain of cadence), in the work of the Sanskrit grammarian Pingala (Chandah-shāstra, the Art of Prosody, 450 or 200 BC). Prosody was important in ancient Indian ritual because of an emphasis on the purity of utterance. The Indian mathematician Virahanka (6th century AD) showed how the Fibonacci sequence arose in the analysis of metres with long and short syllables. Subsequently, the Jain philosopher Hemachandra (c.1150) composed a well-known text on these.
    [Show full text]
  • The "Greatest European Mathematician of the Middle Ages"
    Who was Fibonacci? The "greatest European mathematician of the middle ages", his full name was Leonardo of Pisa, or Leonardo Pisano in Italian since he was born in Pisa (Italy), the city with the famous Leaning Tower, about 1175 AD. Pisa was an important commercial town in its day and had links with many Mediterranean ports. Leonardo's father, Guglielmo Bonacci, was a kind of customs officer in the North African town of Bugia now called Bougie where wax candles were exported to France. They are still called "bougies" in French, but the town is a ruin today says D E Smith (see below). So Leonardo grew up with a North African education under the Moors and later travelled extensively around the Mediterranean coast. He would have met with many merchants and learned of their systems of doing arithmetic. He soon realised the many advantages of the "Hindu-Arabic" system over all the others. D E Smith points out that another famous Italian - St Francis of Assisi (a nearby Italian town) - was also alive at the same time as Fibonacci: St Francis was born about 1182 (after Fibonacci's around 1175) and died in 1226 (before Fibonacci's death commonly assumed to be around 1250). By the way, don't confuse Leonardo of Pisa with Leonardo da Vinci! Vinci was just a few miles from Pisa on the way to Florence, but Leonardo da Vinci was born in Vinci in 1452, about 200 years after the death of Leonardo of Pisa (Fibonacci). His names Fibonacci Leonardo of Pisa is now known as Fibonacci [pronounced fib-on-arch-ee] short for filius Bonacci.
    [Show full text]
  • Triangular Numbers /, 3,6, 10, 15, ", Tn,'" »*"
    TRIANGULAR NUMBERS V.E. HOGGATT, JR., and IVIARJORIE BICKWELL San Jose State University, San Jose, California 9111112 1. INTRODUCTION To Fibonacci is attributed the arithmetic triangle of odd numbers, in which the nth row has n entries, the cen- ter element is n* for even /?, and the row sum is n3. (See Stanley Bezuszka [11].) FIBONACCI'S TRIANGLE SUMS / 1 =:1 3 3 5 8 = 2s 7 9 11 27 = 33 13 15 17 19 64 = 4$ 21 23 25 27 29 125 = 5s We wish to derive some results here concerning the triangular numbers /, 3,6, 10, 15, ", Tn,'" »*". If one o b - serves how they are defined geometrically, 1 3 6 10 • - one easily sees that (1.1) Tn - 1+2+3 + .- +n = n(n±M and (1.2) • Tn+1 = Tn+(n+1) . By noticing that two adjacent arrays form a square, such as 3 + 6 = 9 '.'.?. we are led to 2 (1.3) n = Tn + Tn„7 , which can be verified using (1.1). This also provides an identity for triangular numbers in terms of subscripts which are also triangular numbers, T =T + T (1-4) n Tn Tn-1 • Since every odd number is the difference of two consecutive squares, it is informative to rewrite Fibonacci's tri- angle of odd numbers: 221 222 TRIANGULAR NUMBERS [OCT. FIBONACCI'S TRIANGLE SUMS f^-O2) Tf-T* (2* -I2) (32-22) Ti-Tf (42-32) (52-42) (62-52) Ti-Tl•2 (72-62) (82-72) (9*-82) (Kp-92) Tl-Tl Upon comparing with the first array, it would appear that the difference of the squares of two consecutive tri- angular numbers is a perfect cube.
    [Show full text]
  • Solving Cubic Polynomials
    Solving Cubic Polynomials 1.1 The general solution to the quadratic equation There are four steps to finding the zeroes of a quadratic polynomial. 1. First divide by the leading term, making the polynomial monic. a 2. Then, given x2 + a x + a , substitute x = y − 1 to obtain an equation without the linear term. 1 0 2 (This is the \depressed" equation.) 3. Solve then for y as a square root. (Remember to use both signs of the square root.) a 4. Once this is done, recover x using the fact that x = y − 1 . 2 For example, let's solve 2x2 + 7x − 15 = 0: First, we divide both sides by 2 to create an equation with leading term equal to one: 7 15 x2 + x − = 0: 2 2 a 7 Then replace x by x = y − 1 = y − to obtain: 2 4 169 y2 = 16 Solve for y: 13 13 y = or − 4 4 Then, solving back for x, we have 3 x = or − 5: 2 This method is equivalent to \completing the square" and is the steps taken in developing the much- memorized quadratic formula. For example, if the original equation is our \high school quadratic" ax2 + bx + c = 0 then the first step creates the equation b c x2 + x + = 0: a a b We then write x = y − and obtain, after simplifying, 2a b2 − 4ac y2 − = 0 4a2 so that p b2 − 4ac y = ± 2a and so p b b2 − 4ac x = − ± : 2a 2a 1 The solutions to this quadratic depend heavily on the value of b2 − 4ac.
    [Show full text]
  • Twelve Simple Algorithms to Compute Fibonacci Numbers Arxiv
    Twelve Simple Algorithms to Compute Fibonacci Numbers Ali Dasdan KD Consulting Saratoga, CA, USA [email protected] April 16, 2018 Abstract The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used in introductory algorithms courses. In this paper, we present twelve of these well-known algo- rithms and some of their properties. These algorithms, though very simple, illustrate multiple concepts from the algorithms field, so we highlight them. We also present the results of a small-scale experi- mental comparison of their runtimes on a personal laptop. Finally, we provide a list of homework questions for the students. We hope that this paper can serve as a useful resource for the students learning the basics of algorithms. arXiv:1803.07199v2 [cs.DS] 13 Apr 2018 1 Introduction The Fibonacci numbers are a sequence Fn of integers in which every num- ber after the first two, 0 and 1, is the sum of the two preceding num- bers: 0; 1; 1; 2; 3; 5; 8; 13; 21; ::. More formally, they are defined by the re- currence relation Fn = Fn−1 + Fn−2, n ≥ 2 with the base values F0 = 0 and F1 = 1 [1, 5, 7, 8]. 1 The formal definition of this sequence directly maps to an algorithm to compute the nth Fibonacci number Fn. However, there are many other ways of computing the nth Fibonacci number.
    [Show full text]
  • Introduction Into Quaternions for Spacecraft Attitude Representation
    Introduction into quaternions for spacecraft attitude representation Dipl. -Ing. Karsten Groÿekatthöfer, Dr. -Ing. Zizung Yoon Technical University of Berlin Department of Astronautics and Aeronautics Berlin, Germany May 31, 2012 Abstract The purpose of this paper is to provide a straight-forward and practical introduction to quaternion operation and calculation for rigid-body attitude representation. Therefore the basic quaternion denition as well as transformation rules and conversion rules to or from other attitude representation parameters are summarized. The quaternion computation rules are supported by practical examples to make each step comprehensible. 1 Introduction Quaternions are widely used as attitude represenation parameter of rigid bodies such as space- crafts. This is due to the fact that quaternion inherently come along with some advantages such as no singularity and computationally less intense compared to other attitude parameters such as Euler angles or a direction cosine matrix. Mainly, quaternions are used to • Parameterize a spacecraft's attitude with respect to reference coordinate system, • Propagate the attitude from one moment to the next by integrating the spacecraft equa- tions of motion, • Perform a coordinate transformation: e.g. calculate a vector in body xed frame from a (by measurement) known vector in inertial frame. However, dierent references use several notations and rules to represent and handle attitude in terms of quaternions, which might be confusing for newcomers [5], [4]. Therefore this article gives a straight-forward and clearly notated introduction into the subject of quaternions for attitude representation. The attitude of a spacecraft is its rotational orientation in space relative to a dened reference coordinate system.
    [Show full text]
  • Input for Carnival of Math: Number 115, October 2014
    Input for Carnival of Math: Number 115, October 2014 I visited Singapore in 1996 and the people were very kind to me. So I though this might be a little payback for their kindness. Good Luck. David Brooks The “Mathematical Association of America” (http://maanumberaday.blogspot.com/2009/11/115.html ) notes that: 115 = 5 x 23. 115 = 23 x (2 + 3). 115 has a unique representation as a sum of three squares: 3 2 + 5 2 + 9 2 = 115. 115 is the smallest three-digit integer, abc , such that ( abc )/( a*b*c) is prime : 115/5 = 23. STS-115 was a space shuttle mission to the International Space Station flown by the space shuttle Atlantis on Sept. 9, 2006. The “Online Encyclopedia of Integer Sequences” (http://www.oeis.org) notes that 115 is a tridecagonal (or 13-gonal) number. Also, 115 is the number of rooted trees with 8 vertices (or nodes). If you do a search for 115 on the OEIS website you will find out that there are 7,041 integer sequences that contain the number 115. The website “Positive Integers” (http://www.positiveintegers.org/115) notes that 115 is a palindromic and repdigit number when written in base 22 (5522). The website “Number Gossip” (http://www.numbergossip.com) notes that: 115 is the smallest three-digit integer, abc, such that (abc)/(a*b*c) is prime. It also notes that 115 is a composite, deficient, lucky, odd odious and square-free number. The website “Numbers Aplenty” (http://www.numbersaplenty.com/115) notes that: It has 4 divisors, whose sum is σ = 144.
    [Show full text]
  • Fibonacci Is Not a Pizza Topping Bevel Cut April, 2020 Andrew Davis Last Month I Saw an Amazing Advertisement Appearing in Our Woodworking Universe
    Fibonacci is Not a Pizza Topping Bevel Cut April, 2020 Andrew Davis Last month I saw an amazing advertisement appearing in our woodworking universe. You might say that about all of the Woodpeckers advertisements – promoting good looking, even sexy tools and accessories for the woodworker who has money to burn or who does some odd task many times per day. I don’t fall into either category, though I often click on the ads to see the details and watch a video or two. These days I seem to have time to burn, if not money. Anyway, as someone who took too many math courses in my formative years, this ad absolutely caught my attention. I was left guessing two things: what is a Fibonacci and why would anyone need such a tool? Mr. Fibonacci and his Numbers Mathematician Leonardo Fibonacci was born in Pisa – now Italy – in 1170 and is credited with the first CNC machine and plunge router. Fibonacci popularized the Hindu–Arabic numeral system in the Western World (thereby replacing Roman numerals) primarily through his publication in 1202 called the Book of Calculation. Think how hard it would be to do any woodworking today if dimensions were called out as XVI by XXIV (16 x 24). But for this bevel cut article, the point is that he introduced Europe to the sequence of Fibonacci numbers. Fibonacci numbers are a sequence in which each number is the sum of the two preceding numbers. Here are the first Fibonacci numbers. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418.
    [Show full text]
  • Fibonacci Numbers
    mathematics Article On (k, p)-Fibonacci Numbers Natalia Bednarz The Faculty of Mathematics and Applied Physics, Rzeszow University of Technology, al. Powsta´nców Warszawy 12, 35-959 Rzeszów, Poland; [email protected] Abstract: In this paper, we introduce and study a new two-parameters generalization of the Fibonacci numbers, which generalizes Fibonacci numbers, Pell numbers, and Narayana numbers, simultane- ously. We prove some identities which generalize well-known relations for Fibonacci numbers, Pell numbers and their generalizations. A matrix representation for generalized Fibonacci numbers is given, too. Keywords: Fibonacci numbers; Pell numbers; Narayana numbers MSC: 11B39; 11B83; 11C20 1. Introduction By numbers of the Fibonacci type we mean numbers defined recursively by the r-th order linear recurrence relation of the form an = b1an−1 + b2an−2 + ··· + bran−r, for n > r, (1) where r > 2 and bi > 0, i = 1, 2, ··· , r are integers. For special values of r and bi, i = 1, 2, ··· r, the Equality (1) defines well-known numbers of the Fibonacci type and their generalizations. We list some of them: Citation: Bednarz, N. On 1. Fibonacci numbers: Fn = Fn−1 + Fn−2 for n > 2, with F0 = F1 = 1. (k, p)-Fibonacci Numbers. 2. Lucas numbers: Ln = Ln−1 + Ln−2 for n > 2, with L0 = 2, L1 = 1. Mathematics 2021, 9, 727. https:// 3. Pell numbers: Pn = 2Pn−1 + Pn−2 for n > 2, with P0 = 0, P1 = 1. doi.org/10.3390/math9070727 4. Pell–Lucas numbers: Qn = 2Qn−1 + Qn−2 for n > 2, with Q0 = 1, Q1 = 3. 5. Jacobsthal numbers: Jn = Jn−1 + 2Jn−2 for n > 2, with J0 = 0, J1 = 1.
    [Show full text]
  • On Repdigits As Product of Consecutive Fibonacci Numbers1
    Rend. Istit. Mat. Univ. Trieste Volume 44 (2012), 393–397 On repdigits as product of consecutive Fibonacci numbers1 Diego Marques and Alain Togbe´ Abstract. Let (Fn)n≥0 be the Fibonacci sequence. In 2000, F. Luca proved that F10 = 55 is the largest repdigit (i.e. a number with only one distinct digit in its decimal expansion) in the Fibonacci sequence. In this note, we show that if Fn ··· Fn+(k−1) is a repdigit, with at least two digits, then (k, n) = (1, 10). Keywords: Fibonacci, repdigits, sequences (mod m) MS Classification 2010: 11A63, 11B39, 11B50 1. Introduction Let (Fn)n≥0 be the Fibonacci sequence given by Fn+2 = Fn+1 + Fn, for n ≥ 0, where F0 = 0 and F1 = 1. These numbers are well-known for possessing amaz- ing properties. In 1963, the Fibonacci Association was created to provide an opportunity to share ideas about these intriguing numbers and their applica- tions. We remark that, in 2003, Bugeaud et al. [2] proved that the only perfect powers in the Fibonacci sequence are 0, 1, 8 and 144 (see [6] for the Fibono- mial version). In 2005, Luca and Shorey [5] showed, among other things, that a non-zero product of two or more consecutive Fibonacci numbers is never a perfect power except for the trivial case F1 · F2 = 1. Recall that a positive integer is called a repdigit if it has only one distinct digit in its decimal expansion. In particular, such a number has the form a(10m − 1)/9, for some m ≥ 1 and 1 ≤ a ≤ 9.
    [Show full text]