DOCSLIB.ORG

Using Automata Theory to Solve Problems in Additive Number Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Using Automata Theory to Solve Problems in Additive Number Theory Using Automata Theory to Solve Problems in Additive Number Theory by Aayush Rajasekaran A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Computer Science Waterloo, Ontario, Canada, 2018 c Aayush Rajasekaran 2018 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Additive number theory is the study of the additive properties of integers. Perhaps the best-known theorem is Lagrange's result that every natural number is the sum of four squares. We study numbers whose base-k representations have certain interesting proper- ties. In particular, we look at palindromes, which are numbers whose base-k representations read the same forward and backward, and binary squares, which are numbers whose binary representation is some block repeated twice (like (36)2 = 100100). We show that all natural numbers are the sum of four binary palindromes. We also show that all natural numbers are the sum of three base-3 palindromes, and are also the sum of three base-4 palindromes. We also show that every sufficiently large natural number is the sum of four binary squares. We establish these results using virtually no number theory at all. Instead, we construct automated proofs using automata. The general proof technique is to build an appropriate machine, and then run decision algorithms to establish our theorems. iii Acknowledgements If the statement of authorship that opens this thesis gives the suggestion that this was a \one-man effort”, let me hastily dispel that notion. There are many individuals and institutions that I have left unthanked for too long, and it is only proper that I attempt to right that wrong. First and foremost, I would like to thank my supervisor, Dr. Jeffrey Shallit, for every- thing he has given me over the past 2 years. It is no exaggeration to say that this thesis would not have been possible without you. Your breadth of knowledge, passion for re- search, and incredible assiduity are all truly inspiring. I will always remember the day you sent me an email with the subject \cool problem" that included attachments describing nested-word automata. The past 2 years under your supervision have seen many weekly meetings, a few published papers, and nearly a dozen trivia nights. I will keep these mem- ories with me, and will remain grateful to you for all the opportunities, experiences, and skills you have given me. Thank you, Jeff. The work described in this thesis was performed in collaboration with some remarkable people. My co-author, Tim Smith, came up with many of the ideas that were critical in proving our results. I'm also grateful to the other mathematicians I got to collabo- rate with during my Master's study: Narad Rampersad, Dirk Nowotka, and Madhusudan Parthasarathy. I would like to think Dr. Eric Blais and Dr. Jason Bell for agreeing to read this the- sis. More generally, I would like to think the faculty and staff at the Cheriton School of Computer Science. I would also like to acknowledge the excellent psychological support I received during my course of therapy at the Centre for Mental Health Research. The University of Waterloo has been my home for 7 years now, and leaving is far more bitter than sweet. There are two individuals whose friendships I savagely exploited for assistance at every stage of my graduate studies. Thank you, Ming-Ho Yee, for having been a big brother of sorts since 2011. How do most graduate students survive without your advice? I'm glad I never had to find out. Rein Otsason, you are in every page of this thesis. The story of my Master's study is the story of our relationship. Thank you. And finally, I would like to thank the many people who make my daily life the joy that it is. Perhaps the most valuable service one human being can provide to another is to make them laugh. The many, many people I ungratefully demand that service from include Arjun, Ian, Christine, Shelby, Nick P., Nick S., Anubhav, and most recently, Jacky Jack. Thank you all. iv For the constants. Moo. Dada and Anna. Kira and Faith. v Table of Contents List of Figures ix 1 Introduction1 1.1 Contributions of the Thesis..........................1 1.2 Definitions and Notation............................1 1.3 Overview of Additive Number Theory.....................2 1.4 Palindromes...................................3 1.5 Squares.....................................4 1.6 Our Approach..................................4 2 Automata Theory5 2.1 Finite Automata................................5 2.2 Nested Word Automata............................6 3 Results on Binary Palindromes9 3.1 The Idea.....................................9 3.2 The Result.................................... 10 3.3 The Machines.................................. 12 3.4 An Example Input............................... 14 3.5 Checking Correctness.............................. 17 vi 4 Palindromes in Larger Bases 19 4.1 The Folding Trick................................ 19 4.2 The Results................................... 20 4.3 The Machines.................................. 22 4.4 Example Inputs................................. 24 5 Results on Squares 28 5.1 Introduction................................... 28 5.2 Proof of Lemma 12............................... 29 5.2.1 Odd-length Inputs........................... 30 5.2.2 Even-length Inputs........................... 33 5.3 Checking Correctness.............................. 35 5.4 Other Results on Squares............................ 36 6 Some Results from Walnut 39 6.1 Automatic Sequences and Walnut....................... 39 6.2 The Approach.................................. 40 6.3 Results on the Fibonacci word......................... 42 6.4 Evil and Odious Numbers........................... 43 7 Discussion 46 7.1 Limitations of this Proof Technique...................... 46 7.1.1 Time and Space Complexity...................... 46 7.1.2 Limitations of the Machines...................... 47 7.2 Future Work on Palindromes.......................... 47 7.3 Future Work on Squares............................ 47 References 49 APPENDICES 53 vii A Walnut automata files 54 A.1 Fibonacci Numbers............................... 54 A.2 Numbers of the Form 4n − 1.......................... 54 A.3 Evening Numbers................................ 55 viii List of Figures 2.1 An illustration of M ..............................6 2.2 A nested-word automaton for the language f0n12n : n ≥ 1g ........7 6.1 The automaton outputting the Thue-Morse word.............. 40 6.2 The automaton outputting the Rudin-Shapiro word............. 41 6.3 The result automaton.............................. 41 ix Chapter 1 Introduction 1.1 Contributions of the Thesis The primary results presented in this thesis relate to expressing numbers as sums of bi- nary palindromes and binary squares (defined in Sections 1.4 and 1.5). In Theorem1, we show that all natural numbers are the sum of at most 4 binary palindromes. Theo- rem4 establishes a similar result for binary squares. In Chapter6, we use the automatic theorem-proving software Walnut[30] to establish a variety of results regarding the additive properties of automatic sequences. The results regarding palindromes first appeared in the author's paper with Shallit and Smith [35]. The results regarding squares first appeared in the author's paper with Madhusudan, Nowotka, and Shallit [27]. Some sections of this thesis have been copied verbatim from these papers. 1.2 Definitions and Notation We present some standard definitions in this section. An alphabet, usually denoted Σ, is a finite, non-empty set of symbols. We denote the alphabet of size k as Σk, with the letters implicitly assumed to be 0; 1 : : : k − 1. We denote the set of all possible (finite) words on an alphabet Σ as Σ∗. For integers n; k ≥ 0, we denote the canonical base-k representation of n as (n)k. The canonical base-k representation does not include any leading zeros, and starts with the 1 most significant digit. For instance, (39)2 = 100111. The canonical representation of 0 in any base is the empty string, which we denote . Note that (n)k is a word on the alphabet Σk. 1.3 Overview of Additive Number Theory One can easily see that every natural number is the sum of at most 2 odd integers. It is also self-evident that a similar statement cannot be made about the even integers. There are infinitely many natural numbers that cannot be written as the sum of any number of even integers. A non-trivial statement along these lines is Lagrange's famous theorem that every natural number is the sum of four squares [16, 29]. As an example, the natural number 983 = 212 + 222 + 72 + 32. These are the kinds of results studied under the field of additive number theory. Formally, additive number theory is the study of the additive properties of integers [31]. For a given T ⊆ N, an additive basis of order h is a subset S ⊆ N such that every n 2 T is the sum of h members, not necessarily distinct, of S. The principal problem of additive number theory is as follows: given two subsets S and T , does S form an additive basis of some order h for T , and if so, what is the smallest value of h? It is trivially evident that the natural numbers, N, form an additive basis of order 1 for N. Goldbach's famous conjecture [44] can be phrased in this language. If S is the set of even integers greater than 2, and T is the set of prime numbers, the conjecture asks whether T forms an additive basis for S of order 2. There has been much research in this area, and deep techniques, such as the Hardy-Littlewood circle method [42,4], have been developed to solve problems. We can rephrase Lagrange's theorem in our terminology. The theorem tells us that S = f02; 12; 22; 32;:::g forms an additive basis for N of order 4.
Load more

Recommended publications
  • Single Digits
    ...................................single digits ...................................single digits In Praise of Small Numbers MARC CHAMBERLAND Princeton University Press Princeton & Oxford Copyright c 2015 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TW press.princeton.edu All Rights Reserved The second epigraph by Paul McCartney on page 111 is taken from The Beatles and is reproduced with permission of Curtis Brown Group Ltd., London on behalf of The Beneficiaries of the Estate of Hunter Davies. Copyright c Hunter Davies 2009. The epigraph on page 170 is taken from Harry Potter and the Half Blood Prince:Copyrightc J.K. Rowling 2005 The epigraphs on page 205 are reprinted wiht the permission of the Free Press, a Division of Simon & Schuster, Inc., from Born on a Blue Day: Inside the Extraordinary Mind of an Austistic Savant by Daniel Tammet. Copyright c 2006 by Daniel Tammet. Originally published in Great Britain in 2006 by Hodder & Stoughton. All rights reserved. Library of Congress Cataloging-in-Publication Data Chamberland, Marc, 1964– Single digits : in praise of small numbers / Marc Chamberland. pages cm Includes bibliographical references and index. ISBN 978-0-691-16114-3 (hardcover : alk. paper) 1. Mathematical analysis. 2. Sequences (Mathematics) 3. Combinatorial analysis. 4. Mathematics–Miscellanea. I. Title. QA300.C4412 2015 510—dc23 2014047680 British Library
    [Show full text]
  • Std XII Computer Science
    J.H. TARAPORE SCHOOL WORKSHEET NO- 5 STD XII :A/B/C COMPUTER SCIENCE (2020-2021) Topic : Java Practical Programs General Instructions: • Give the program name as “yournameQ1” eg : “SamikshaQ1,Samiksha Q2” • Execute the programs in your laptop. • Save the program and output together in a Microsoft Word File. • Submit the pendrive on the first day of the school reopening. Question 1. Write a program to check whether the given number is a Prime Adam Number or Not. Prime Number:A number which has only two factors,i.e 1 and the number itself. Adam Number : The square of a number and the square of its reverse are reverse to each other.Example,if n=31 and reverse of n=13,then 312=961 and 132= 169,which is reverse of 961.Thus ,31 is an Adam Number. So, 31 is a Prime Adam Number. Question 2. Write a program to check whether the given number is a Evil Number or Not. An Evil number is a positive whole number which has even number of 1’s in its binary equivalent. Example: Binary equivalent of 9 is 1001, which contains even number of 1’s. Thus, 9 is an Evil Number. A few Evil numbers are 3, 5, 6, 9.... Question 3. Write a program to check whether the given number is a Smith Number or Not. A Smith Number is a composite number,the sum of the digits of a number is equal to the sum of the digits of its prime factors (excluding 1). Example: 666 Prime factors of 666 : 2,3,3 and 37.
    [Show full text]
  • Eureka Issue 61
    Eureka 61 A Journal of The Archimedeans Cambridge University Mathematical Society Editors: Philipp Legner and Anja Komatar © The Archimedeans (see page 94 for details) Do not copy or reprint any parts without permission. October 2011 Editorial Eureka Reinvented… efore reading any part of this issue of Eureka, you will have noticed The Team two big changes we have made: Eureka is now published in full col- our, and printed on a larger paper size than usual. We felt that, with Philipp Legner Design and Bthe internet being an increasingly large resource for mathematical articles of Illustrations all kinds, it was necessary to offer something new and exciting to keep Eu- reka as successful as it has been in the past. We moved away from the classic Anja Komatar Submissions LATEX-look, which is so common in the scientific community, to a modern, more engaging, and more entertaining design, while being conscious not to Sean Moss lose any of the mathematical clarity and rigour. Corporate Ben Millwood To make full use of the new design possibilities, many of this issue’s articles Publicity are based around mathematical images: from fractal modelling in financial Lu Zou markets (page 14) to computer rendered pictures (page 38) and mathemati- Subscriptions cal origami (page 20). The Showroom (page 46) uncovers the fundamental role pictures have in mathematics, including patterns, graphs, functions and fractals. This issue includes a wide variety of mathematical articles, problems and puzzles, diagrams, movie and book reviews. Some are more entertaining, such as Bayesian Bets (page 10), some are more technical, such as Impossible Integrals (page 80), or more philosophical, such as How to teach Physics to Mathematicians (page 42).
    [Show full text]
  • Using Formal Concept Analysis in Mathematical Discovery
    Using Formal Concept Analysis in Mathematical Discovery Simon Colton and Daniel Wagner sgc, [email protected] Combined Reasoning Group Department of Computing Imperial College, London http://www.doc.ic.ac.uk/crg/ Abstract. Formal concept analysis (FCA) comprises a set of powerful algorithms which can be used for data analysis and manipulation, and a set of visualisation tools which enable the discovery of meaningful re- lationships between attributes of the data. We explore the potential of combining FCA and mathematical discovery tools in order to better fa- cilitate discovery tasks. In particular, we propose a novel lookup method for the Encyclopedia of Integer Sequences, and we show how conjectures from the Graffiti discovery program can be better understood using FCA visualisation tools. We argue that, not only can FCA tools greatly en- hance the management and visualisation of mathematical knowledge, but they can also be used to drive exploratory processes. 1 Introduction Formal Concept Analysis (FCA) consists of a set of well established techniques for the analysis and manipulation of data. FCA has a strong theoretical un- derpinning, efficient implementations of fast algorithms, and useful visualisation tools. There are strong links between FCA and machine learning, and the con- nection of both fields is an active area of research [8,12,13]. We concentrate here on the combination of FCA tools with systems developed to aid mathemat- ical discovery. In particular, we are interested in addressing (i) whether FCA algorithms can be used to enhance the discovery process and (ii) whether FCA visualisation tools can enable better understanding of the discoveries made.
    [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]
  • Discriminators of Integer Sequences
    Discriminators of Integer Sequences by Sajed Haque A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Computer Science Waterloo, Ontario, Canada, 2017 c Sajed Haque 2017 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract The discriminator of an integer sequence s = (s(n))n≥0, first introduced by Arnold, Benkoski and McCabe in 1985, is the function Ds(n) that maps the integer n ≥ 1 to the smallest positive integer m such that the first n terms of s are pairwise incongruent modulo m. In this thesis, we provide a basic overview of discriminators, examining the background literature on the topic and presenting some general properties of discriminators. We also venture into various computational aspects relating to discriminators, such as providing algorithms to compute the discriminator, and establishing an upper bound on the discriminator growth rate. We provide a complete characterization of sequences whose discriminators are themselves, and also explore the problem of determining whether a given sequence is a discriminator of some other sequence with some partial results and algorithms. We briefly discuss some k-regular sequences, characterizing the discriminators for the evil and odious numbers, and show that k-regular sequences do not necessarily have k- regular discriminators. We introduce the concept of shift-invariant discriminators, i.e.
    [Show full text]
  • Dynamical Generalizations of the Prime Number Theorem And
    Dynamical generalizations of the Prime Number Theorem and disjointness of additive and multiplicative semigroup actions Vitaly Bergelson Florian K. Richter February 11, 2020 Abstract We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theo- rem, a theorem of Pillai-Selberg, a theorem of Erd˝os-Delange, the mean value theorem of Wirsing, and special cases of the mean value theorem of Hal´asz. By building on the ideas behind our ergodic results, we recast Sarnak’s M¨obius disjointness conjec- ture in a new dynamical framework. This naturally leads to an extension of Sarnak’s conjecture which focuses on the disjointness of additive and multiplicative semigroup actions. We substantiate this extension by providing proofs of several special cases thereof. Contents 1 Introduction 1 1.1 Dynamical generalizations of the Prime Number Theorem ................ 2 1.2 A wider framework for Sarnak’s conjecture ........................ 9 2 Distribution of orbits along Ω(n) 16 2.1 Proof of Theorem A .................................... 16 2.2 Proofs of Proposition 2.1 and Lemmas 2.2 and 2.3 .................... 19 3 Finitely generated and strongly uniquley ergodic systems 23 3.1 A counterexample ..................................... 23 3.2 Proof of Theorem B .................................... 23 3.3 Proof of Proposition 3.2 .................................. 25 4 Applications of Theorems A and B 32 5 Disjointness of additive and multiplicative semigroup actions 36 arXiv:2002.03498v1 [math.DS] 10 Feb 2020 5.1 Nilsystems, nilsequences, and a proof of Theorem C ................... 36 5.2 Horocyclic flow and a proof of Theorem D .......................
    [Show full text]
  • GEMATRIA: a Preliminary Investigation of the Cabala
    Update: February 13th, 2005 GEMATRIA A Preliminary Investigation of The Cabala contained in the Coptic Gnostic Books and of a similar Gematria in the Greek text of the New Testament SHOWING THE PRESENCE OF A SYSTEM OF TEACHING BY MEANS OF THE DOCTRINAL SIGNIFICANCE OF NUMBERS, BY WHICH THE HOLY NAMES ARE CLEARLY SEEN TO REPRESENT AEONIAL RELATIONSHIPS WHICH CAN BE CONCEIVED IN A GEOMETRIC SENSE AND ARE CAPABLE OF A TYPICAL EXPRESSION OF THAT ORDER. BY FREDERICK BLIGH BOND, F.R.I.B.A. AND THOMAS SIMCOX LEA, D.D. First Published 1917 Annotated and Transcribed for the WorldWideWeb by Peter Wakefield Sault 2002-2003 1 EPIGRAPH. ‘... numbers are the thoughts of God ... The Divine Wisdom is reflected in the numbers impressed upon all things ... the construction of the physical and moral world alike is based upon eternal numbers.’ St Augustine 2 CONTENTS Preface The Method of Gematria Chapter I A Brief Outline of the Gematria II The Existence of the Gnosis III The Uses of Gematria IV The Key Applied Note on Digamma Appendix A The Number 485 B Of the Square and Circle Contained C Names of Christ as Multiples of 37 D Schema of the Numbers of Jesus E The Decree of the First Mystery F Of the Three Primary Figures G Cabala of the Cosmos H The Cube of Light Supplement I On the Symbolism of Numbers II On Geometric Truth The Geometric Cubit as a Basis of Proportion in the Plans of Mediaeval Buildings IIIby Frederick Bligh Bond F.R.I.B.A. (From The Builder, Third Series, Vol.
    [Show full text]
  • Hockey Line Nicknames Based on Jersey Numbers
    The Mathematics Enthusiast Volume 14 Number 1 Numbers 1, 2, & 3 Article 21 1-2017 Numberlines: Hockey Line Nicknames Based on Jersey Numbers Egan J. Chernoff Follow this and additional works at: https://scholarworks.umt.edu/tme Part of the Mathematics Commons Let us know how access to this document benefits ou.y Recommended Citation Chernoff, Egan J. (2017) "Numberlines: Hockey Line Nicknames Based on Jersey Numbers," The Mathematics Enthusiast: Vol. 14 : No. 1 , Article 21. Available at: https://scholarworks.umt.edu/tme/vol14/iss1/21 This Article is brought to you for free and open access by ScholarWorks at University of Montana. It has been accepted for inclusion in The Mathematics Enthusiast by an authorized editor of ScholarWorks at University of Montana. For more information, please contact [email protected]. TME, vol. 14, nos1,2&.3, p. 371 Numberlines: Hockey Line Nicknames Based on Jersey Numbers Egan J Chernoff1 University of Saskatchewan, Canada Abstract: The purpose of this article, in general, is to expound Chernoff’s (2016) notion of numberlines, that is, hockey line nicknames based on jersey numbers. The article begins with a brief discussion of the history of hockey line nicknames, which allows for the parsing of numberlines and quasi-numberlines (nicknames based on numbers associated with hockey players). Focusing, next, on jersey number restrictions for the National Hockey League (NHL), a repeated calculation of the number of possible numberlines winnows down the number from a theoretical upper bound to a practical upper bound. Moving beyond the numbers, the names of natural numbers – those with a certain panache (e.g., Untouchable, McNugget, Frugal, Hoax, Narcissistic, Unhappy, Superperfect and Powerul numbers) – act as a gateway to the notion of numberlining, the process of attempting to coin a numberline.
    [Show full text]
  • E.W. Bullinger: Number in Scripture
    Number in Scripture Its Supernatural Design and Spiritual Significance By E. W. Bullinger (1837-1913) Fourth Edition, Revised London Eyre & Spottiswoode (Bible Warehouse) Ltd. 33. Paternoster Row, E.C. 1921 This book is in the Public Domain.Copy Freely More Freeware from www.levendwater.org Table of Contents Preface PART I SUPERNATURAL DESIGN CHAPTER 1 THE WORKS OF GOD The Heavens Chronology Nature The Vegetable Kingdom Physiology Chemistry Sound and Music Colour CHAPTER II THE WORD OF GOD The Books of the Bible The Writers Occurrences of Words in Old Testament Occurrences of Words in New Testament Occurrences of Words in the Apocalypse Occurrences of Phrases Evidence as to Authorship of Hebrews and 2 Peter Occurrences of Words and Phrases in Old and New Testaments combined PART II SPIRITUAL SIGNIFICANCE Introduction One Two Three Four Five Six Seven Six and Seven together Seven by itself Eight Eight and Seven together Eight by itself Eight and Thirteen together Nine Ten Eleven Twelve Thirteen Fourteen Fifteen Seventeen Nineteen Twenty Twenty-one Twenty-two Twenty-four Twenty-five Twenty-seven Twenty-eight Twenty-nine Thirty Thirty-one Forty Forty-two Fifty Fifty-one Sixty-five Seventy One hundred and twenty One hundred and fifty and three Two hundred Three hundred and ninety Four hundred Four hundred and thirty Four hundred and ninety Six hundred and sixty-six Conclusion Preface Many writers, from the earliest times, have called attention to the importance of the great subject of Number in Scripture. It has been dealt with, for the most part, in a fragmentary way. One has dealt with some particular number, such as "seven"; another has been content with a view of the primary numbers, and even when defining their significance, has given only one or two examples by way of illustration; another has confined himself to "symbolical numbers," such as 10, 40, 666, etc.; another has taken up such symbolical numbers in their relation to chronology or to prophecy; another has collected examples, but has dealt little with their meaning.
    [Show full text]
  • Tutorme Subjects Covered.Xlsx
    Subject Group Subject Topic Computer Science Android Programming Computer Science Arduino Programming Computer Science Artificial Intelligence Computer Science Assembly Language Computer Science Computer Certification and Training Computer Science Computer Graphics Computer Science Computer Networking Computer Science Computer Science Address Spaces Computer Science Computer Science Ajax Computer Science Computer Science Algorithms Computer Science Computer Science Algorithms for Searching the Web Computer Science Computer Science Allocators Computer Science Computer Science AP Computer Science A Computer Science Computer Science Application Development Computer Science Computer Science Applied Computer Science Computer Science Computer Science Array Algorithms Computer Science Computer Science ArrayLists Computer Science Computer Science Arrays Computer Science Computer Science Artificial Neural Networks Computer Science Computer Science Assembly Code Computer Science Computer Science Balanced Trees Computer Science Computer Science Binary Search Trees Computer Science Computer Science Breakout Computer Science Computer Science BufferedReader Computer Science Computer Science Caches Computer Science Computer Science C Generics Computer Science Computer Science Character Methods Computer Science Computer Science Code Optimization Computer Science Computer Science Computer Architecture Computer Science Computer Science Computer Engineering Computer Science Computer Science Computer Systems Computer Science Computer Science Congestion Control
    [Show full text]
  • Package 'Zseq'
    Package ‘Zseq’ February 3, 2018 Type Package Title Integer Sequence Generator Version 0.2.0 Description Generates well-known integer sequences. 'gmp' package is adopted for comput- ing with arbitrarily large numbers. Every function has hyperlink to its correspond- ing item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the func- tion help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306). License GPL (>= 3) Encoding UTF-8 LazyData true Imports gmp RoxygenNote 6.0.1 NeedsCompilation no Author Kisung You [aut, cre] (<https://orcid.org/0000-0002-8584-459X>) Maintainer Kisung You <[email protected]> Repository CRAN Date/Publication 2018-02-02 23:07:14 UTC R topics documented: Zseq-package . .2 Abundant . .3 Achilles . .3 Bell .............................................4 Carmichael . .5 Catalan . .5 Composite . .6 Deficient . .7 Equidigital . .7 Evil .............................................8 Extravagant . .9 1 2 Zseq-package Factorial . .9 Factorial.Alternating . 10 Factorial.Double . 11 Fibonacci . 11 Frugal . 12 Happy............................................ 13 Juggler . 13 Juggler.Largest . 14 Juggler.Nsteps . 15 Lucas . 15 Motzkin . 16 Odious . 17 Padovan........................................... 17 Palindromic . 18 Palindromic.Squares . 19 Perfect . 19 Perrin . 20 Powerful . 21 Prime . 21 Regular . 22 Square . 23 Squarefree . 23 Telephone . 24 Thabit . 25 Triangular . 25 Unusual . 26 Index 27 Zseq-package Zseq : Integer Sequence Generator Description The world of integer sequence has long history, which has been accumulated in OEIS. Even though R is not a first pick for many number theorists, we introduce our package to enrich the R ecosystem as well as provide pedagogical toolset. We adopted gmp for flexible large number computations in that users can easily experience large number sequences on a non-exclusive generic computing platform.
    [Show full text]