DOCSLIB.ORG

Sequences of Tridovan and Their Identities

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sequences of Tridovan and Their Identities Notes on Number Theory and Discrete Mathematics Print ISSN 1310–5132, Online ISSN 2367–8275 Vol. 25, 2019, No. 3, 185–197 DOI: 10.7546/nntdm.2019.25.3.185-197 Sequences of Tridovan and their identities Renata Passos Machado Vieira 1 and Francisco Regis Vieira Alves 2 1 Department of Mathematics Institute Federal of Technology of the State of Ceará (IFCE) Fortaleza-CE, Brazil e-mail: [email protected] 2 Department of Mathematics Institute Federal of Technology of the State of Ceará (IFCE) Fortaleza-CE, Brazil e-mail: [email protected] Received: 19 December 2018 Revised: 20 June 2019 Accepted: 29 July 2019 Abstract: This work introduces the so-called Tridovan sequence which is an extended form of the Padovan sequence. In a general definition, this extension adds one more term to the Padovan recurrence relation, considering now the three terms preceding the penultimate one. Studies carried out on the proposed extension reveal properties of the positive and negative integer index, the sum of all, even and odd terms, the obtaining Tridovan Q-matrix and finally the Tridovan initial terms generalization. Keywords: Sequence of Tridovan, Positive indices, Negative indices, Generating matrix. 2010 Mathematics Subject Classification: 11B37, 11B39. 1 Introduction The Italian architect Richard Padovan (born 1935) discovered a kind of “cousin” of the well-known Fibonacci sequence, the Padovan numbers, which is also recursive, arithmetic and linear. Padovan was born in the city of Padua [12], a village a little far from the same birthplace of Fibonacci [1]. The Padovan sequence is defined by the recursive relation Pn = Pn2 + Pn3, n t 3, where Pn is the n-th term of the sequence. The first sequence terms are defined by P0 = P1 = P2 = 1, which may generate the following initial elements: 1, 1, 1, 2, 2, 3, 4, 5, 7, ... 185 An important feature of this sequence is the neighboring terms relationship Pn+1 / Pn, which converges to a value known as plastic number or plastic constant [8, 10]. The approximate value of the plastic number is ψ = 1.324718... and the ways of calculating this value are presented in the [6, 8]. Based on the Fibonacci sequence, [4, 9] proposed a sequence extension considering not only the sum of two previous elements but three or four previous elements. Following the same path it is possible to extend the Padovan numbers considering a greater number of terms to estimate the next one. The geometric representation of the Padovan sequence occurs through the Padovan spiral, as shown in Figure 1. This is composed by the juxtaposition of equilateral triangles respecting a characteristic construction rule. Consider the side 1 highlighted triangle in blue as the initial triangle. The spiral formation of the spiral is given by the addition of a new equilateral triangle to the largest side of the formed polygon, initially the blue triangle. After the addition of the other triangles, the new polygon is formed, known as plastic pentagon. The spiral presents itself by connecting with an arc the two corners of the newly added triangle. Figure 1. Padovan spiral. (Source: Prepared by the authors.) Although this sequence is recursive, its terms can be found through the Q-matrix. According to studies carried out by Alves [2] for the Fibonacci sequence, the same idea will be followed so that an application is made for the Tridovan numbers. Thus, it is possible to study these new identities in addition to providing the perception of a constantly evolving notion of this sequence. 186 2 Preliminary As defined in the previous section, any element of the Padovan sequence is calculated based on the sum of the last two terms ignoring the one immediately before. Following the same idea, one can define the Tridovan sequence as the sum of the tree last terms ignoring the one immediately before. The addition of this new element makes the Tridovan Sequence a 4th degree recurrent linear sequence, and its properties and definitions will be presented in the following sessions. Definition 1. The Tridovan sequence numbers recursive relation for positive indices is given by: TTnn 234 T n Tn n,4 t, where Tn is the n-th term of the sequence. The initial values of these numbers are given by: T0 = 0, T1 = 1, T2 = 0, T3 = 1. Thus, the list of terms in this sequence are (0, 1, 0, 1, 1, 2, 2, 4, 5, 8, 11, 17, ...). Definition 2. The Tridovan sequence recurrence relation for negative indices is given by: T–n = T–n + 4 – T–n + 2 – T–n + 1 or T–n = T–n + 4 – T–n + 2 + T–n + 1, with T0 = 0, T1 = 1, T2 = 0, T3 = 1. From Definition 1, we can naturally describe the Tridovan sequence. We can also observe a process of extension of integer indices, since, in the previous definition, its values are indicated only for n t 4 . So let us see that for nTTTT 3?310 1 and, thus, we will have the T1 0 . Similarly, we see that for nTTTT 2?20 1 2 and, we will have the value T2 0 . For a smaller index, we have nTTTT 1?1123 , getting T3 1. On a recurrent basis, we can further determine that TTTTTTTT4 1, 5 0, 6 1, 7 0, 8 2, 9 2, 10 1, 11 3 , etc. With this, from the previous values, we can systematize the description of the following sets with integers, as follows: (...,TTTTTnnnnn2 , 1 , , 1 , 2 ,... TTTTTTTTTTTTT 432101234 , , , , , , , , ,..., nnnn 3 , 2 , 1 , ,...) . When we want to determine any element for n t 4, we use the relationship Tn = Tn – 2 + Tn – 3 + Tn – 4, however, the elements T0 = 0, T1 = 1, T2 = 0, T3 = 1 are fixed preliminarily. Now, noticing that TTTT1310 or yet TTTT220 1 and also TTTT31 1 2, constructing: (..., 3, 1, 2, 2, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4, ...) we can write the relation of recurrence to negative indexes as: TTnnnn 421 T T or TTnn 421 T n T n. This arrangement shows a different understanding of the one shown at the beginning, since before the development of the terms were found by performing a “movement” from left to right, these terms can now be found with right-to-left “movement”) of the sequence. Definition 3. From the Tridovan sequence, we use the following notations with initial values T0 = 0, T1 = 1, T2 = 0, T3 = 1, and S0 = 0, S1 = 1, S2 = 1, S3 = 2, and: n (a) Sum of positive terms: STTTnnni 012... T 1 T ¦ T, i 0 n (b) Sum of positive even-numbered terms: STTT2nnni 024... T 222 T ¦ T 2, i 0 187 n (c) Sum of positive odd-numbered terms: STTTTT21nnni 1 3 5... 21 21 ¦ T 21 , i 0 n (d) Sum of negative terms: STTTnnni 012 ... T 1 T ¦ T, i 0 n (e) Sum of negative even-numbered terms: STTT2nnni 024 ... T 222 T ¦ T 2, i 0 n (f) Sum of negative odd-numbered terms: STTTT21nni 1 3 5... 21 ¦ T 21. i 0 Theorem 1. For any integer n t 2 the following identities are verified: (i) SSnn13 T n1 ; (ii) SS22123nn T n1, (iii) SS21nn 22 T 22 n . Proof. Consider the following set of expressions: ­­T4 TTT 210 TT 42 TT 10 °°TTTT TTTT °°5 321 53 21 °°T6 TTT 432 TT 64 TT 32 °° ®®? °°TTTT TTTT °°nnnn1123 nnnn 1123 °°Tn212212 TTT nnn TTTT n nnn °° ¯¯Tn31 T n TT nn 1 T n 31 T n TT nn 1 We can effectively cancel out the similar terms in the above equations to determine the following sum nn1 TTTTnii323 ¦ ¦ T, ii 00 remembering that TT23 0, 1 and, therefore, we see that nn1 SSnn13 ¦¦ T i TT in 1, ii 00 or even more simplified as SSnn13 T n1, hence we prove (i). In a similar way, this time for the even indices, we have the following set of equations: ­TTTT5 321­ TTTT 53 21 °TTTT ° TTTT ° 7543° 7543 °TTTT9765 ° TTTT 9765 ° ° ®?® °TTTT ° TTTT ° 21nnnn 23 24 25° 21 nnnn 23 24 25 °TTTT21nnnn 21 22 23° TTTT 21 nnnn 21 22 23 ° ° ¯TTTT23nnnn 21 2 21 ¯ TT 23 n 21nnn TT 2 21 By means of cancelling out, we can obtain: 188 nn1 TTT23nn 3 231 ¦ T 2 ii¦ T 21 , ii 10 assuming T3 1, we find that TSS23nnn1 2 21, hence we prove (ii). We can also consider the following arrangement of the elements of the first list, eliminating the odd indexes as follows: ­­T4210 TTT TT 4210 TT °°TTTT TTTT °°6 432 64 32 °°TTTT8 654 TTTT 86 54 °° ®®TTTT10 8 7 6 ? TTTT 10 8 7 6 °° °° °°TTTT2nnnn 22 23 24 TTTT 2 nnnn 22 23 24 °° ¯¯T22n TTT 2 nnn 21 22 TTTT 22 n 2 nnn 21 22 Thus, considering the corresponding eliminations, we must find that nn11 TT22nnn 2 ¦ T 21¦ T 2, ii 00 therefore, we can write nn11 TTTSS22nnnnn ¦¦ 21 2 21 22, ii 00 which proves item (iii). Finally, let us note that nSSS 4? 1210 1110 3 S 4. Using another value for n, one can get nSSS 51?321 12115 S 5. Thus, through the inductive method, we can see that: SSSSnnnn 1234. For n = n + 1, we have SSTSSSTSSSTTTnnn1 1 (1 nnn 234 ) n 1 (1 nnn 234 ) ( nnn 123 ) SSTSTSTSSSnnnnnnnnnn1213243123 1( )( )( )1 Theorem 2. For any integer n t 2 the following identities are verified: (i) TSS22nnn 23 24 ; (ii) ()TTnn23 S n 4 S n 5. Proof. Let us consider the equations: ­TT0234 T T °TTTT ° 2456 °TTTT4678 ® °TTTT68910 ° ° ¯°TT2222324nn T n T n 189 Performing some algebraic manipulations, we have: ­TT02 T 34 T °TTTT ° 24 56 °TTTT46 78 ® .
Load more

Recommended publications
  • Integer Sequences
    UHX6PF65ITVK Book > Integer sequences Integer sequences Filesize: 5.04 MB Reviews A very wonderful book with lucid and perfect answers. It is probably the most incredible book i have study. Its been designed in an exceptionally simple way and is particularly just after i finished reading through this publication by which in fact transformed me, alter the way in my opinion. (Macey Schneider) DISCLAIMER | DMCA 4VUBA9SJ1UP6 PDF > Integer sequences INTEGER SEQUENCES Reference Series Books LLC Dez 2011, 2011. Taschenbuch. Book Condition: Neu. 247x192x7 mm. This item is printed on demand - Print on Demand Neuware - Source: Wikipedia. Pages: 141. Chapters: Prime number, Factorial, Binomial coeicient, Perfect number, Carmichael number, Integer sequence, Mersenne prime, Bernoulli number, Euler numbers, Fermat number, Square-free integer, Amicable number, Stirling number, Partition, Lah number, Super-Poulet number, Arithmetic progression, Derangement, Composite number, On-Line Encyclopedia of Integer Sequences, Catalan number, Pell number, Power of two, Sylvester's sequence, Regular number, Polite number, Ménage problem, Greedy algorithm for Egyptian fractions, Practical number, Bell number, Dedekind number, Hofstadter sequence, Beatty sequence, Hyperperfect number, Elliptic divisibility sequence, Powerful number, Znám's problem, Eulerian number, Singly and doubly even, Highly composite number, Strict weak ordering, Calkin Wilf tree, Lucas sequence, Padovan sequence, Triangular number, Squared triangular number, Figurate number, Cube, Square triangular
    [Show full text]
  • Padovan-Like Sequences and Generalized Pascal's Triangles
    An. S¸tiint¸. Univ. Al. I. Cuza Ia¸si.Mat. (N.S.) Tomul LXVI, 2020, f. 1 Padovan-like sequences and generalized Pascal’s triangles Giuseppina Anatriello Giovanni Vincenzi · Abstract The Padovan sequence and the Plastic number are mathematical objects of central interest among architects, and from this point of view, their importance is com- parable to that of the Fibonacci sequence and the Golden mean. Padovan-like sequences, such as Perrin sequence or the Cordonnier sequence, also have mathematical applications. In this article, we will characterize a large family of Padovan-like sequences in terms of ‘Padovan diagonals’ of generalized Pascal’s triangles. Keywords Padovan-like sequences Plastic number Combinatorial identities Kepler limit Generalized Pascal’s triangle · Computational methods· · · · Mathematics Subject Classification (2010) 05A19 03D20 00A67 11Y55 · · · 1 Introduction The Fibonacci sequence, which we will denote by (Fn), is defined by F0 = 0,F1 = 1 Fn = Fn 1 + Fn 2, n > 1, (1.1) − − and it has been of wide interest since his first appearance in the book Liber Abaci published in 1202. Four centuries later, Kepler showed (see the book “Harmonices Mundi”, 1619, p. 273, see [20], [21]) that: F lim n+1 = Φ (1.2) n Fn where Φ denotes the highly celebrated Golden mean, which appears in sev- eral human fields, especially in Art and Architecture, even if sometimes not always appropriately (see e.g. [14], [24] and references therein). Among the most relevant generalizations of the Fibonacci sequence, there is the Tribonacci sequence (Tn). It is a third order recursive sequence defined by T0 = 0,T1 = T2 = 1, and Tn = Tn 1 + Tn 2 + Tn 3, n > 1.
    [Show full text]
  • Plastic Number: Construction and Applications
    SA 201 AR 2 - - A E d C v N a E n c R e E d F R N e Advanced Research in Scientific Areas 2012 O s C e a L r A c h U T i n R I S V c - i e s n a t e i r f i c A December, 3. - 7. 2012 Plastic Number: Construction and Applications Luka Marohnić Tihana Strmečki Polytechnic of Zagreb, Polytechnic of Zagreb, 10000 Zagreb, Croatia 10000 Zagreb, Croatia [email protected] [email protected] Abstract—In this article we will construct plastic number in a heuristic way, explaining its relation to human perception in three-dimensional space through architectural style of Dom Hans van der Laan. Furthermore, it will be shown that the plastic number and the golden ratio special cases of more general defini- tion. Finally, we will explain how van der Laan’s discovery re- lates to perception in pitch space, how to define and tune Padovan intervals and, subsequently, how to construct chromatic scale temperament using the plastic number. (Abstract) Keywords-plastic number; Padovan sequence; golden ratio; music interval; music tuning ; I. INTRODUCTION In 1928, shortly after abandoning his architectural studies and becoming a novice monk, Hans van der Laan1 discovered a new, unique system of architectural proportions. Its construc- tion is completely based on a single irrational value which he 2 called the plastic number (also known as the plastic constant): 4 1.324718... (1) Figure 1. Twenty different cubes, from above 3 This number was originally studied by G.
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]
  • Generalized Pell-Padovan Numbers
    Asian Journal of Advanced Research and Reports 11(2): 8-28, 2020; Article no.AJARR.57839 ISSN: 2582-3248 Generalized Pell-Padovan Numbers ∗ Y ¨ukselSoykan1 1Department of Mathematics, Faculty of Art and Science, Zonguldak Bulent¨ Ecevit University, 67100, Zonguldak, Turkey. Author’s contribution The sole author designed, analyzed, interpreted and prepared the manuscript. Article Information DOI: 10.9734/AJARR/2020/v11i230259 Editor(s): (1) Dr. Hasan Aydogan , Selcuk University, Turkey. Reviewers: (1) B. Selvaraj, Nehru Institute of Engineering and Technology, India. (2) Md. Asaduzzaman, Islamic University, Bangladesh. Complete Peer review History: http://www.sdiarticle4.com/review-history/57839 Received 05 April 2020 Accepted 12 June 2020 Original Research Article Published 20 June 2020 ABSTRACT In this paper, we investigate the generalized Pell-Padovan sequences and we deal with, in detail, four special cases, namely, Pell-Padovan, Pell-Perrin, third order Fibonacci-Pell and third order Lucas-Pell sequences. We present Binet’s formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences. Keywords: Pell-Padovan numbers; Pell-Perrin numbers; third order Fibonacci-Pell numbers; third order Lucas-Pell numbers. 2010 Mathematics Subject Classification: 11B39, 11B83. 1 INTRODUCTION and third order Lucas-Pell. Before, we recall the generalized Tribonacci sequence and its some The aim of this paper is to define and to explore properties.
    [Show full text]
  • Proceedings of the Sixteenth International Conference on Fibonacci Numbers and Their Applications
    Proceedings of the Sixteenth International Conference on Fibonacci Numbers and Their Applications Rochester Institute of Technology, Rochester, New York, 2014 July 20{27 edited by Peter G. Anderson Rochester Institute of Technology Rochester, New York Christian Ballot Universit´eof Caen-Basse Normandie Caen, France William Webb Washington State University Pullman, Washington ii The Sixteenth Conference The 16th International Conference on Fibonacci Numbers and their Applica- tions was held on the large campus of the Rochester Institute of Technology, situated several miles off from downtown. It hosted about 65 participants from at least a dozen countries and all continents, northern Americans being most represented. Besides regular and occasional participants, there were a number of people who attended this conference for the first time. For instance, M´arton, 24, from Hungary, took three flights to reach Rochester; it was his first flying experiences, and we believe many appreciated his presence, and he himself en- joyed the whole package of the conference. These conferences are very congenial, being both scientific, social, and cultural events. This one had the peculiarity of having three exceptional presentations open to the public held on the Wednesday morning in a large auditorium filled with local young people and students, in addition to the conference participants. The Edouard´ Lucas invited lecturer, Jeffrey Lagarias, gave a broad well-applauded historic talk which ran from antiquity to present; Larry Ericksen, painter and mathematician, also had us travel through time and space, commenting on often famous artwork|okay, maybe the Golden ratio appeared a few too many times|and Arthur Benjamin, mathemagician (and mathematician) who, for some of his magics, managed the feat of both performing and explaining without loosing the audience a second.
    [Show full text]
  • The Derive - Newsletter #93 Issn 1990-7079
    THE DERIVE - NEWSLETTER #93 ISSN 1990-7079 THE BULLETIN OF THE USER GROUP C o n t e n t s: 1 Letter of the Editor 2 Editorial - Preview David Halprin 3 Recursive Series of Numbers, An Umbral Look Josef Böhm 22 Applications of Generating Functions Roland Schröder 24 Light in the Coffee Cup David Halprin 27 What I have investigated over the Years Adrian Oldknow 33 Why CAS must mean more than …. (Keynote Address) Josef Böhm 42 Two more Tribonacci Sequences May 2014 D-N-L#93 Information D-N-L#93 Useful Links for Generating Functions www.mia.uni-saarland.de/Teaching/MFI0708/kap65.pdf www.math.tugraz.at/~wagner/KombSkr.pdf www.informatik.uni-bremen.de/~denneberg/Kombinatorik/Skript%20Kombinatorik.pdf math-www.upb.de/MatheI_02/vorl/woche_16.pdf www2.s-inf.de/Skripte/Diskrete.2001-SS-Hinrichs.%28JV%29.ErzeugendeFunktionen.pdf www.mathdb.org/notes_download/elementary/algebra/ae_A11.pdf www.cut-the-knot.org/blue/GeneratingFunctions.shtml Links for the Padovan Sequence (very recommendable) www.mathematik.uni-wuerzburg.de/~dobro/uhalt/u4.pdf www.had2know.com/academics/perrin-padovan-sequence-plastic-constant-calculator.html Our friend Wolfgang Pröpper discovered a nice photo in Spiegel-online: Madeira Impressions D-N-L#93 Letter of the Editor p 1 Dear DUG Members, Finally I wanted to publish a keynote ad- first of all I’d like to apologize once more dress given by Adrian Oldknow at the occa- for the extra long delay in publishing sion of the Gettysburg conference many DNL#93. This is due to several reasons: an years ago (1998).
    [Show full text]
  • ( ) , 0,1,2,3,4,... (3.2) ( ) F X X X N F X + =
    Turkish Journal of Computer and Mathematics Education Vol.12 No.2 (2021), 3098 - 3101 Research Article Properties of Padovan Sequence Dr. R. Sivaraman1 1Associate Professor, Department of Mathematics, D. G. Vaishnav College, Chennai, IndiaNational Awardee for Popularizing Mathematics among masses [email protected] Article History: Received: 11 January 2021; Accepted: 27 February 2021; Published online: 5 April 2021 Abstract:Among several types of famous sequences that exist in all branches of mathematics, Padovan sequence is one of such sequences possessing amusing properties. In this paper, we shall discuss about Padovan Sequence and determine a special number called Plastic number. We also derive the ratio of its (n+1)st term to the nth term as n is very large, which is called “Limiting Ratio”. Finally we discuss the geometrical interpretation of the terms of Padovan sequence. Keywords: Padovan Sequence, Recurrence Relation, Characteristic Equation, Plastic Number, Limiting Ratio. 1. Introduction Padovan Sequence is named after British Polymath Richard Padovan who became fascinated with the works of Dutch monk and architect Hans van der Laan to the extent that he wrote a book about him titled “Dom Hans van der Laan: modern primitive” in the year 1989. In this book Richard Padovan while mentioning works of Hans van der Laan attributed an interesting sequence of numbers which had striking resemblance with the most famous Fibonacci numbers. Later, British mathematician and science popularizer Ian Stewart while describing the same sequence in one of his books called the sequence as Padovan Sequence and the name remained thereafter. Though Padovan sequence resembles Fibonacci sequence, it differs quite significantly from Fibonacci numbers especially in the case of dealing with limiting ratio.
    [Show full text]
  • On Factorials in Perrin and Padovan Sequences
    Turkish Journal of Mathematics Turk J Math (2019) 43: 2602 – 2609 http://journals.tubitak.gov.tr/math/ © TÜBİTAK Research Article doi:10.3906/mat-1907-38 On factorials in Perrin and Padovan sequences Nurettin IRMAK∗ Department of Mathematics, Faculty of Art and Science, Niğde Ömer Halisdemir University, Niğde, Turkey Received: 06.07.2019 • Accepted/Published Online: 06.09.2019 • Final Version: 28.09.2019 Abstract: Assume that wn is the nth term of either Padovan or Perrin sequence. In this paper, we solve the equation wn = m! completely. Key words: Factorials, Perrin numbers, Padovan numbers 1. Introduction A number of mathematicians have been interested in Diophantine equations including both factorials and elements of linear recurrences such as Fibonacci, Tribonacci, and balancing numbers, etc. For example, Luca [6] proved that Fn is a product of factorials only when n = 1; 2; 3; 6; 12, where Fn is the nth Fibonacci number. Grossman and Luca [3] showed that the equation Fn = m1! + m2! + ··· + mk! has finitely many positive integers n for fixed k: In the same paper the solutions were determined for k ≤ 2. The case k = 3 was handled by Bollman et al. in [2]. Irmak et al. [5] solved several equations involving balancing numbers and factorials. Recently, Sobolewski [10] gave the 2-adic valuation of generalized Fibonacci sequences. Marques and Lengyel [8] searched the factorials in Tribonacci sequence. They characterized the 2-adic order of Tribonacci numbers and then solved the equation Tn = m! completely. This was the first paper to find factorials in third-order linear recurrences. In this paper, wepresent the 2-adic order of Padovan and Perrin numbers.
    [Show full text]
  • Geometry of the Perrin and Padovan Sequences II
    Geometry of the Perrin and Padovan Sequences II Building a Perrin Sequence This chalkboard further examines the geometry of the Perrin sequence which was previously discussed in Chapter 19. Another recent publication1 discusses the geometric interpretation of the Perrin and Padovan numbers using multi-variate polynomials. I will use previous theorems 19.1 and 19.2 to prove the result in reference [1]. This result is then extended to other sequences related to the Perrin sequence derived from the equation x3 – x- 1 =0. A second morphic number derived from the equation x3 – x2- 1 =0 will also be demonstrated to find the so-called Narayana’s cow sequence2 and other related sequences. The construction of the plastic number leads to the following previously derived theorems: 19.1 Theorem: The Perrin sequence can be generated from a unit measure and powers of the plastic number, . Given a unit measure a paper folding technique can be used to construct and powers of . All Perrin numbers can be generated from the unit measure (1) and the three constructible numbers , 1/ and − 3 Corollary: Let and be the complex and complex conjugate solution to the equation x -x- 1 =0. n n − All powers + can be generated from the real numbers 2, - and . The Perrin sequence as shown in previous chapters is generated from powers of the three solutions to the cubic equation. n n n [19-4] P(n) = + + where n = 0, 1, 2, …. n. Let the powers of the real and complex solutions be constructed as follows: 0 0 0 + = 2 and = 1 1 1 1 + = - and = 2 2 − 2 + = and = 1 +1/ 19.2 Theorem: Given the three generators for n = 0, 1, and 2 all powers are obtained from the n n n-2 n-2 n-3 n-3 n n-2 n-3 recurrence relation + = + + + and = + .
    [Show full text]
  • The Eleven Set Contents
    0_11 The Eleven Set Contents 1 1 1 1.1 Etymology ............................................... 1 1.2 As a number .............................................. 1 1.3 As a digit ............................................... 1 1.4 Mathematics .............................................. 1 1.4.1 Table of basic calculations .................................. 3 1.5 In technology ............................................. 3 1.6 In science ............................................... 3 1.6.1 In astronomy ......................................... 3 1.7 In philosophy ............................................. 3 1.8 In literature .............................................. 4 1.9 In comics ............................................... 4 1.10 In sports ................................................ 4 1.11 In other fields ............................................. 6 1.12 See also ................................................ 6 1.13 References ............................................... 6 1.14 External links ............................................. 6 2 2 (number) 7 2.1 In mathematics ............................................ 7 2.1.1 List of basic calculations ................................... 8 2.2 Evolution of the glyph ......................................... 8 2.3 In science ............................................... 8 2.3.1 Astronomy .......................................... 8 2.4 In technology ............................................. 9 2.5 In religion ..............................................
    [Show full text]
  • Music of the Primes in Search of Order
    Music of the Primes In Search of Order PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Wed, 19 Jan 2011 04:12:59 UTC Contents Articles Prime number theorem 1 Riemann hypothesis 9 Riemann zeta function 30 Balanced prime 40 Bell number 41 Carol number 46 Centered decagonal number 47 Centered heptagonal number 48 Centered square number 49 Centered triangular number 51 Chen prime 52 Circular prime 53 Cousin prime 54 Cuban prime 55 Cullen number 56 Dihedral prime 57 Dirichlet's theorem on arithmetic progressions 58 Double factorial 61 Double Mersenne prime 75 Eisenstein prime 76 Emirp 78 Euclid number 78 Even number 79 Factorial prime 82 Fermat number 83 Fibonacci prime 90 Fortunate prime 91 Full reptend prime 92 Gaussian integer 94 Genocchi number 97 Goldbach's conjecture 98 Good prime 102 Happy number 103 Higgs prime 108 Highly cototient number 109 Illegal prime 110 Irregular prime 113 Kynea number 114 Leyland number 115 List of prime numbers 116 Lucas number 131 Lucky number 133 Markov number 135 Mersenne prime 137 Mills' constant 145 Minimal prime (recreational mathematics) 146 Motzkin number 147 Newman–Shanks–Williams prime 149 Odd number 150 Padovan sequence 153 Palindromic prime 157 Partition (number theory) 158 Pell number 166 Permutable prime 174 Perrin number 175 Pierpont prime 178 Pillai prime 179 Prime gap 180 Prime quadruplet 185 Prime triplet 187 Prime-counting function 188 Primeval prime 194 Primorial prime 196 Probable prime 197 Proth number 198 Pseudoprime
    [Show full text]