DOCSLIB.ORG

Recursion Lecture 9

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Recursion Lecture 9 Recursion Lecture 9 Justin Stevens Justin Stevens Recursion (Lecture 9) 1 / 26 Outline 1 Strong Induction Induction Strong Induction 2 Recursion 3 Parting Shots Justin Stevens Recursion (Lecture 9) 2 / 26 Base Case: Show P(1). Inductive Step: Show P(k) implies P(k + 1) for any integer k ≥ 1. The assumption we make is known as the induction hypothesis. Induction Theorem. Suppose we have a statement P that we wish to show is true for all positive integers at least 1. We can prove this in two steps: Justin Stevens Recursion (Lecture 9) 3 / 26 Induction Theorem. Suppose we have a statement P that we wish to show is true for all positive integers at least 1. We can prove this in two steps: Base Case: Show P(1). Inductive Step: Show P(k) implies P(k + 1) for any integer k ≥ 1. The assumption we make is known as the induction hypothesis. Justin Stevens Recursion (Lecture 9) 3 / 26 h i k(k + 1)2 13 + 23 + 33 + ··· + k3 + (k + 1)3 = + (k + 1)3 2 ! k2 = (k + 1)2 + k + 1 4 (k + 1)(k + 2)2 = . 2 This is the sum of cubes formula for n = k + 1, hence the identity holds. Proof. When n = 1, 1 = 12. We assume the formula is true for n = k: k(k + 1)2 13 + 23 + 33 + ··· + k3 = . (Hypothesis) 2 Adding the next cube to both sides of our assumption gives: Sum of Cubes Identity 2 3 3 3 3 h n(n+1) i Example. Prove the identity 1 + 2 + 3 + ··· + n = 2 . Justin Stevens Recursion (Lecture 9) 4 / 26 h i k(k + 1)2 13 + 23 + 33 + ··· + k3 + (k + 1)3 = + (k + 1)3 2 ! k2 = (k + 1)2 + k + 1 4 (k + 1)(k + 2)2 = . 2 This is the sum of cubes formula for n = k + 1, hence the identity holds. Adding the next cube to both sides of our assumption gives: Sum of Cubes Identity 2 3 3 3 3 h n(n+1) i Example. Prove the identity 1 + 2 + 3 + ··· + n = 2 . Proof. When n = 1, 1 = 12. We assume the formula is true for n = k: k(k + 1)2 13 + 23 + 33 + ··· + k3 = . (Hypothesis) 2 Justin Stevens Recursion (Lecture 9) 4 / 26 ! k2 = (k + 1)2 + k + 1 4 (k + 1)(k + 2)2 = . 2 This is the sum of cubes formula for n = k + 1, hence the identity holds. Sum of Cubes Identity 2 3 3 3 3 h n(n+1) i Example. Prove the identity 1 + 2 + 3 + ··· + n = 2 . Proof. When n = 1, 1 = 12. We assume the formula is true for n = k: k(k + 1)2 13 + 23 + 33 + ··· + k3 = . (Hypothesis) 2 Adding the next cube to both sides of our assumption gives: h i k(k + 1)2 13 + 23 + 33 + ··· + k3 + (k + 1)3 = + (k + 1)3 2 Justin Stevens Recursion (Lecture 9) 4 / 26 (k + 1)(k + 2)2 = . 2 This is the sum of cubes formula for n = k + 1, hence the identity holds. Sum of Cubes Identity 2 3 3 3 3 h n(n+1) i Example. Prove the identity 1 + 2 + 3 + ··· + n = 2 . Proof. When n = 1, 1 = 12. We assume the formula is true for n = k: k(k + 1)2 13 + 23 + 33 + ··· + k3 = . (Hypothesis) 2 Adding the next cube to both sides of our assumption gives: h i k(k + 1)2 13 + 23 + 33 + ··· + k3 + (k + 1)3 = + (k + 1)3 2 ! k2 = (k + 1)2 + k + 1 4 Justin Stevens Recursion (Lecture 9) 4 / 26 This is the sum of cubes formula for n = k + 1, hence the identity holds. Sum of Cubes Identity 2 3 3 3 3 h n(n+1) i Example. Prove the identity 1 + 2 + 3 + ··· + n = 2 . Proof. When n = 1, 1 = 12. We assume the formula is true for n = k: k(k + 1)2 13 + 23 + 33 + ··· + k3 = . (Hypothesis) 2 Adding the next cube to both sides of our assumption gives: h i k(k + 1)2 13 + 23 + 33 + ··· + k3 + (k + 1)3 = + (k + 1)3 2 ! k2 = (k + 1)2 + k + 1 4 (k + 1)(k + 2)2 = . 2 Justin Stevens Recursion (Lecture 9) 4 / 26 Sum of Cubes Identity 2 3 3 3 3 h n(n+1) i Example. Prove the identity 1 + 2 + 3 + ··· + n = 2 . Proof. When n = 1, 1 = 12. We assume the formula is true for n = k: k(k + 1)2 13 + 23 + 33 + ··· + k3 = . (Hypothesis) 2 Adding the next cube to both sides of our assumption gives: h i k(k + 1)2 13 + 23 + 33 + ··· + k3 + (k + 1)3 = + (k + 1)3 2 ! k2 = (k + 1)2 + k + 1 4 (k + 1)(k + 2)2 = . 2 This is the sum of cubes formula for n = k + 1, hence the identity holds. Justin Stevens Recursion (Lecture 9) 4 / 26 Proof Without Words of Sum of Cubes Figure 1: Alan L. Fry, Mathematical Association of America (1985) Justin Stevens Recursion (Lecture 9) 5 / 26 Solution. We begin by showing the first 4 base cases: 5, 75, 375, 9375. k k Assume that the number N = a1a2a3 ··· ak is divisible by 5 , so N = 5 A. Consider the k + 1-digit number for i ∈ {1, 3, 5, 7, 9}: k k k k Ni = ia1a2a3 ··· ak = i · 10 + 5 A = 5 i · 2 + A . From the reduced residue system, there exists i with i · 2k + A ≡ 0 (mod 5). k+1 Then Ni is a k + 1-digit number divisible by 5 all of whose digits are odd. n Digit Number Divisible by 5n Example. (USAMO) Prove that for every positive integer n, there exists an n-digit number divisible by 5n all of whose digits are odd. Justin Stevens Recursion (Lecture 9) 6 / 26 k k Assume that the number N = a1a2a3 ··· ak is divisible by 5 , so N = 5 A. Consider the k + 1-digit number for i ∈ {1, 3, 5, 7, 9}: k k k k Ni = ia1a2a3 ··· ak = i · 10 + 5 A = 5 i · 2 + A . From the reduced residue system, there exists i with i · 2k + A ≡ 0 (mod 5). k+1 Then Ni is a k + 1-digit number divisible by 5 all of whose digits are odd. n Digit Number Divisible by 5n Example. (USAMO) Prove that for every positive integer n, there exists an n-digit number divisible by 5n all of whose digits are odd. Solution. We begin by showing the first 4 base cases: 5, 75, 375, 9375. Justin Stevens Recursion (Lecture 9) 6 / 26 k k k k Ni = ia1a2a3 ··· ak = i · 10 + 5 A = 5 i · 2 + A . From the reduced residue system, there exists i with i · 2k + A ≡ 0 (mod 5). k+1 Then Ni is a k + 1-digit number divisible by 5 all of whose digits are odd. n Digit Number Divisible by 5n Example. (USAMO) Prove that for every positive integer n, there exists an n-digit number divisible by 5n all of whose digits are odd. Solution. We begin by showing the first 4 base cases: 5, 75, 375, 9375. k k Assume that the number N = a1a2a3 ··· ak is divisible by 5 , so N = 5 A. Consider the k + 1-digit number for i ∈ {1, 3, 5, 7, 9}: Justin Stevens Recursion (Lecture 9) 6 / 26 From the reduced residue system, there exists i with i · 2k + A ≡ 0 (mod 5). k+1 Then Ni is a k + 1-digit number divisible by 5 all of whose digits are odd. n Digit Number Divisible by 5n Example. (USAMO) Prove that for every positive integer n, there exists an n-digit number divisible by 5n all of whose digits are odd. Solution. We begin by showing the first 4 base cases: 5, 75, 375, 9375. k k Assume that the number N = a1a2a3 ··· ak is divisible by 5 , so N = 5 A. Consider the k + 1-digit number for i ∈ {1, 3, 5, 7, 9}: k k k k Ni = ia1a2a3 ··· ak = i · 10 + 5 A = 5 i · 2 + A . Justin Stevens Recursion (Lecture 9) 6 / 26 k+1 Then Ni is a k + 1-digit number divisible by 5 all of whose digits are odd. n Digit Number Divisible by 5n Example. (USAMO) Prove that for every positive integer n, there exists an n-digit number divisible by 5n all of whose digits are odd. Solution. We begin by showing the first 4 base cases: 5, 75, 375, 9375. k k Assume that the number N = a1a2a3 ··· ak is divisible by 5 , so N = 5 A. Consider the k + 1-digit number for i ∈ {1, 3, 5, 7, 9}: k k k k Ni = ia1a2a3 ··· ak = i · 10 + 5 A = 5 i · 2 + A . From the reduced residue system, there exists i with i · 2k + A ≡ 0 (mod 5). Justin Stevens Recursion (Lecture 9) 6 / 26 n Digit Number Divisible by 5n Example. (USAMO) Prove that for every positive integer n, there exists an n-digit number divisible by 5n all of whose digits are odd. Solution. We begin by showing the first 4 base cases: 5, 75, 375, 9375. k k Assume that the number N = a1a2a3 ··· ak is divisible by 5 , so N = 5 A. Consider the k + 1-digit number for i ∈ {1, 3, 5, 7, 9}: k k k k Ni = ia1a2a3 ··· ak = i · 10 + 5 A = 5 i · 2 + A . From the reduced residue system, there exists i with i · 2k + A ≡ 0 (mod 5).
Load more

Recommended publications
  • Large but Finite
    Department of Mathematics MathClub@WMU Michigan Epsilon Chapter of Pi Mu Epsilon Large but Finite Drake Olejniczak Department of Mathematics, WMU What is the biggest number you can imagine? Did you think of a million? a billion? a septillion? Perhaps you remembered back to the time you heard the term googol or its show-off of an older brother googolplex. Or maybe you thought of infinity. No. Surely, `infinity' is cheating. Large, finite numbers, truly monstrous numbers, arise in several areas of mathematics as well as in astronomy and computer science. For instance, Euclid defined perfect numbers as positive integers that are equal to the sum of their proper divisors. He is also credited with the discovery of the first four perfect numbers: 6, 28, 496, 8128. It may be surprising to hear that the ninth perfect number already has 37 digits, or that the thirteenth perfect number vastly exceeds the number of particles in the observable universe. However, the sequence of perfect numbers pales in comparison to some other sequences in terms of growth rate. In this talk, we will explore examples of large numbers such as Graham's number, Rayo's number, and the limits of the universe. As well, we will encounter some fast-growing sequences and functions such as the TREE sequence, the busy beaver function, and the Ackermann function. Through this, we will uncover a structure on which to compare these concepts and, hopefully, gain a sense of what it means for a number to be truly large. 4 p.m. Friday October 12 6625 Everett Tower, WMU Main Campus All are welcome! http://www.wmich.edu/mathclub/ Questions? Contact Patrick Bennett ([email protected]) .
    [Show full text]
  • Parameter Free Induction and Provably Total Computable Functions
    Parameter free induction and provably total computable functions Lev D. Beklemishev∗ Steklov Mathematical Institute Gubkina 8, 117966 Moscow, Russia e-mail: [email protected] November 20, 1997 Abstract We give a precise characterization of parameter free Σn and Πn in- − − duction schemata, IΣn and IΠn , in terms of reflection principles. This I − I − allows us to show that Πn+1 is conservative over Σn w.r.t. boolean com- binations of Σn+1 sentences, for n ≥ 1. In particular, we give a positive I − answer to a question, whether the provably recursive functions of Π2 are exactly the primitive recursive ones. We also characterize the provably − recursive functions of theories of the form IΣn + IΠn+1 in terms of the fast growing hierarchy. For n = 1 the corresponding class coincides with the doubly-recursive functions of Peter. We also obtain sharp results on the strength of bounded number of instances of parameter free induction in terms of iterated reflection. Keywords: parameter free induction, provably recursive functions, re- flection principles, fast growing hierarchy Mathematics Subject Classification: 03F30, 03D20 1 Introduction In this paper we shall deal with the first order theories containing Kalmar ele- mentary arithmetic EA or, equivalently, I∆0 + Exp (cf. [11]). We are interested in the general question how various ways of formal reasoning correspond to models of computation. This kind of analysis is traditionally based on the con- cept of provably total recursive function (p.t.r.f.) of a theory. Given a theory T containing EA, a function f(~x) is called provably total recursive in T , iff there is a Σ1 formula φ(~x, y), sometimes called specification, that defines the graph of f in the standard model of arithmetic and such that T ⊢ ∀~x∃!y φ(~x, y).
    [Show full text]
  • Simple Statements, Large Numbers
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2007 Simple Statements, Large Numbers Shana Streeks University of Nebraska-Lincoln Follow this and additional works at: https://digitalcommons.unl.edu/mathmidexppap Part of the Science and Mathematics Education Commons Streeks, Shana, "Simple Statements, Large Numbers" (2007). MAT Exam Expository Papers. 41. https://digitalcommons.unl.edu/mathmidexppap/41 This Article is brought to you for free and open access by the Math in the Middle Institute Partnership at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in MAT Exam Expository Papers by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Master of Arts in Teaching (MAT) Masters Exam Shana Streeks In partial fulfillment of the requirements for the Master of Arts in Teaching with a Specialization in the Teaching of Middle Level Mathematics in the Department of Mathematics. Gordon Woodward, Advisor July 2007 Simple Statements, Large Numbers Shana Streeks July 2007 Page 1 Streeks Simple Statements, Large Numbers Large numbers are numbers that are significantly larger than those ordinarily used in everyday life, as defined by Wikipedia (2007). Large numbers typically refer to large positive integers, or more generally, large positive real numbers, but may also be used in other contexts. Very large numbers often occur in fields such as mathematics, cosmology, and cryptography. Sometimes people refer to numbers as being “astronomically large”. However, it is easy to mathematically define numbers that are much larger than those even in astronomy. We are familiar with the large magnitudes, such as million or billion.
    [Show full text]
  • Big Numbers Tom Davis [email protected] September 21, 2011
    Big Numbers Tom Davis [email protected] http://www.geometer.org/mathcircles September 21, 2011 1 Introduction The problem is that we tend to live among the set of puny integers and generally ignore the vast infinitude of larger ones. How trite and limiting our view! — P.D. Schumer It seems that most children at some age get interested in large numbers. “What comes after a thousand? After a million? After a billion?”, et cetera, are common questions. Obviously there is no limit; whatever number you name, a larger one can be obtained simply by adding one. But what is interesting is just how large a number can be expressed in a fairly compact way. Using the standard arithmetic operations (addition, subtraction, multiplication, division and exponentia- tion), what is the largest number you can make using three copies of the digit “9”? It’s pretty clear we should just stick to exponents, and given that, here are some possibilities: 999, 999, 9 999, and 99 . 9 9 Already we need to be a little careful with the final one: 99 . Does this mean: (99)9 or 9(9 )? Since (99)9 = 981 this interpretation would gain us very little. If this were the standard definition, then why c not write ab as abc? Because of this, a tower of exponents is always interpreted as being evaluated from d d c c c (c ) right to left. In other words, ab = a(b ), ab = a(b ), et cetera. 9 With this definition of towers of exponents, it is clear that 99 is the best we can do.
    [Show full text]
  • Primality Testing for Beginners
    STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker http://dx.doi.org/10.1090/stml/070 Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov The cover illustration is a variant of the Sieve of Eratosthenes (Sec- tion 1.5), showing the integers from 1 to 2704 colored by the number of their prime factors, including repeats. The illustration was created us- ing MATLAB. The back cover shows a phase plot of the Riemann zeta function (see Appendix A), which appears courtesy of Elias Wegert (www.visual.wegert.com). 2010 Mathematics Subject Classification. Primary 11-01, 11-02, 11Axx, 11Y11, 11Y16. For additional information and updates on this book, visit www.ams.org/bookpages/stml-70 Library of Congress Cataloging-in-Publication Data Rempe-Gillen, Lasse, 1978– author. [Primzahltests f¨ur Einsteiger. English] Primality testing for beginners / Lasse Rempe-Gillen, Rebecca Waldecker. pages cm. — (Student mathematical library ; volume 70) Translation of: Primzahltests f¨ur Einsteiger : Zahlentheorie - Algorithmik - Kryptographie. Includes bibliographical references and index. ISBN 978-0-8218-9883-3 (alk. paper) 1. Number theory. I. Waldecker, Rebecca, 1979– author. II. Title. QA241.R45813 2014 512.72—dc23 2013032423 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given.
    [Show full text]
  • The Notion Of" Unimaginable Numbers" in Computational Number Theory
    Beyond Knuth’s notation for “Unimaginable Numbers” within computational number theory Antonino Leonardis1 - Gianfranco d’Atri2 - Fabio Caldarola3 1 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy e-mail: [email protected] 2 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy 3 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy e-mail: [email protected] Abstract Literature considers under the name unimaginable numbers any positive in- teger going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathemati- cal definition (it is indeed used in many sources without a proper definition). This simply means that research in this topic must always consider shortened representations, usually involving recursion, to even being able to describe such numbers. One of the most known methodologies to conceive such numbers is using hyper-operations, that is a sequence of binary functions defined recursively starting from the usual chain: addition - multiplication - exponentiation. arXiv:1901.05372v2 [cs.LO] 12 Mar 2019 The most important notations to represent such hyper-operations have been considered by Knuth, Goodstein, Ackermann and Conway as described in this work’s introduction. Within this work we will give an axiomatic setup for this topic, and then try to find on one hand other ways to represent unimaginable numbers, as well as on the other hand applications to computer science, where the algorith- mic nature of representations and the increased computation capabilities of 1 computers give the perfect field to develop further the topic, exploring some possibilities to effectively operate with such big numbers.
    [Show full text]
  • Ackermann and the Superpowers
    Ackermann and the superpowers Ant´onioPorto and Armando B. Matos Original version 1980, published in \ACM SIGACT News" Modified in October 20, 2012 Modified in January 23, 2016 (working paper) Abstract The Ackermann function a(m; n) is a classical example of a total re- cursive function which is not primitive recursive. It grows faster than any primitive recursive function. It is usually defined by a general recurrence together with two \boundary" conditions. In this paper we obtain a closed form of a(m; n), which involves the Knuth superpower notation, namely m−2 a(m; n) = 2 " (n + 3) − 3. Generalized Ackermann functions, that is functions satisfying only the general recurrence and one of the bound- ary conditions are also studied. In particular, we show that the function m−2 2 " (n + 2) − 2 also belongs to the \Ackermann class". 1 Introduction and definitions The \arrow" or \superpower" notation has been introduced by Knuth [1] as a convenient way of expressing very large numbers. It is based on the infinite sequence of operators: +, ∗, ",... We shall see that the arrow notation is closely related to the Ackermann function (see, for instance, [2]). 1.1 The Superpowers Let us begin with the following sequence of integer operators, where all the operators are right associative. a × n = a + a + ··· + a (n a's) a " n = a × a × · · · × a (n a's) 2 a " n = a " a "···" a (n a's) m In general we define a " n as 1 Definition 1 m m−1 m−1 m−1 a " n = a " a "··· " a | {z } n a's m The operator " is not associative for m ≥ 1.
    [Show full text]
  • 53 More Algorithms
    Eric Roberts Handout #53 CS 106B March 9, 2015 More Algorithms Outline for Today • The plan for today is to walk through some of my favorite tree More Algorithms and graph algorithms, partly to demystify the many real-world applications that make use of those algorithms and partly to for Trees and Graphs emphasize the elegance and power of algorithmic thinking. • These algorithms include: – Google’s Page Rank algorithm for searching the web – The Directed Acyclic Word Graph format – The union-find algorithm for efficient spanning-tree calculation Eric Roberts CS 106B March 9, 2015 Page Rank Page Rank Algorithm The heart of the Google search engine is the page rank algorithm, The page rank algorithm gives each page a rating of its importance, which was described in a 1999 by Larry Page, Sergey Brin, Rajeev which is a recursively defined measure whereby a page becomes Motwani, and Terry Winograd. important if other important pages link to it. The PageRank Citation Ranking: One way to think about page rank is to imagine a random surfer on Bringing Order to the Web the web, following links from page to page. The page rank of any page is roughly the probability that the random surfer will land on a January 29, 1998 particular page. Since more links go to the important pages, the Abstract surfer is more likely to end up there. The importance of a Webpage is an inherently subjective matter, which depends on the reader’s interests, knowledge and attitudes. But there is still much that can be said objectively about the relative importance of Web pages.
    [Show full text]
  • The Costs of Inaction
    Climate Change – the Costs of Inaction Report to Friends of the Earth England, Wales and Northern Ireland Frank Ackerman and Elizabeth Stanton Global Development and Environment Institute, Tufts University October 11, 2006 Table of Contents Executive Summary ................................................................................................. iii Introduction................................................................................................................1 Categorizing climate risks........................................................................................................... 2 The UK in 2050: hot, and getting hotter....................................................................7 Impacts of Climate Change......................................................................................11 Agriculture ................................................................................................................................ 11 Industry and infrastructure........................................................................................................ 15 Fresh water................................................................................................................................ 17 Human health............................................................................................................................ 18 Ecosystems and extinctions ...................................................................................................... 22 Summary measures of
    [Show full text]
  • What Fun! It's Practice with Scientific Notation!
    What Fun! It's Practice with Scientific Notation! Review of Scientific Notation Scientific notation provides a place to hold the zeroes that come after a whole number or before a fraction. The number 100,000,000 for example, takes up a lot of room and takes time to write out, while 108 is much more efficient. Though we think of zero as having no value, zeroes can make a number much bigger or smaller. Think about the difference between 10 dollars and 100 dollars. Even one zero can make a big difference in the value of the number. In the same way, 0.1 (one-tenth) of the US military budget is much more than 0.01 (one-hundredth) of the budget. The small number to the right of the 10 in scientific notation is called the exponent. Note that a negative exponent indicates that the number is a fraction (less than one). The line below shows the equivalent values of decimal notation (the way we write numbers usually, like "1,000 dollars") and scientific notation (103 dollars). For numbers smaller than one, the fraction is given as well. smaller bigger Fraction 1/100 1/10 Decimal notation 0.01 0.1 1 10 100 1,000 ____________________________________________________________________________ Scientific notation 10-2 10-1 100 101 102 103 Practice With Scientific Notation Write out the decimal equivalent (regular form) of the following numbers that are in scientific notation. Section A: Model: 101 = 10 1) 102 = _______________ 4) 10-2 = _________________ 2) 104 = _______________ 5) 10-5 = _________________ 3) 107 = _______________ 6) 100 = __________________ Section B: Model: 2 x 102 = 200 7) 3 x 102 = _________________ 10) 6 x 10-3 = ________________ 8) 7 x 104 = _________________ 11) 900 x 10-2 = ______________ 9) 2.4 x 103 = _______________ 12) 4 x 10-6 = _________________ Section C: Now convert from decimal form into scientific notation.
    [Show full text]
  • Ever Heard of a Prillionaire? by Carol Castellon Do You Watch the TV Show
    Ever Heard of a Prillionaire? by Carol Castellon Do you watch the TV show “Who Wants to Be a Millionaire?” hosted by Regis Philbin? Have you ever wished for a million dollars? "In today’s economy, even the millionaire doesn’t receive as much attention as the billionaire. Winners of a one-million dollar lottery find that it may not mean getting to retire, since the million is spread over 20 years (less than $3000 per month after taxes)."1 "If you count to a trillion dollars one by one at a dollar a second, you will need 31,710 years. Our government spends over three billion per day. At that rate, Washington is going through a trillion dollars in a less than one year. or about 31,708 years faster than you can count all that money!"1 I’ve heard people use names such as “zillion,” “gazillion,” “prillion,” for large numbers, and more recently I hear “Mega-Million.” It is fairly obvious that most people don’t know the correct names for large numbers. But where do we go from million? After a billion, of course, is trillion. Then comes quadrillion, quintrillion, sextillion, septillion, octillion, nonillion, and decillion. One of my favorite challenges is to have my math class continue to count by "illions" as far as they can. 6 million = 1x10 9 billion = 1x10 12 trillion = 1x10 15 quadrillion = 1x10 18 quintillion = 1x10 21 sextillion = 1x10 24 septillion = 1x10 27 octillion = 1x10 30 nonillion = 1x10 33 decillion = 1x10 36 undecillion = 1x10 39 duodecillion = 1x10 42 tredecillion = 1x10 45 quattuordecillion = 1x10 48 quindecillion = 1x10 51
    [Show full text]
  • A Topological Regularizer for Classifiers Via Persistent Homology
    A Topological Regularizer for Classifiers via Persistent Homology Chao Chen Xiuyan Ni Qinxun Bai Yusu Wang Stony Brook University City University of New York Hikvision Research America Ohio State University Abstract 2002). Such norms produce a model with relatively less flexibility and thus is less likely to overfit. Regularization plays a crucial role in super- A particularly interesting category of methods is in- vised learning. Most existing methods enforce spired by the geometry. These methods design new a global regularization in a structure agnos- penalty terms to enforce a geometric simplicity of the tic manner. In this paper, we initiate a new classifier. Some methods stipulate that similar data direction and propose to enforce the struc- should have similar score according to the classifier, tural simplicity of the classification boundary and enforce the smoothness of the classifier function by regularizing over its topological complexity. (Belkin et al., 2006; Zhou and Schölkopf, 2005; Bai In particular, our measurement of topologi- et al., 2016). Others directly pursue a simple geom- cal complexity incorporates the importance etry of the classifier boundary, i.e., the submanifold of topological features (e.g., connected com- separating different classes (Cai and Sowmya, 2007; ponents, handles, and so on) in a meaningful Varshney and Willsky, 2010; Lin et al., 2012, 2015). manner, and provides a direct control over These geometry-based regularizers are intuitive and spurious topological structures. We incorpo- have been shown to be useful in many supervised and rate the new measurement as a topological semi-supervised learning settings. However, regulariz- penalty in training classifiers. We also pro- ing total smoothness of the classifier (or that of the pose an efficient algorithm to compute the classification boundary) is not always flexible enough to gradient of such penalty.
    [Show full text]