DOCSLIB.ORG

Appendix a Useful Notions and Facts

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Appendix a Useful Notions and Facts Appendix A Useful notions and facts In this appendix we introduce most of the statistics on permutations and words ap- pearing in this book, as well as several well-known sequences of numbers and certain lattice paths. Also, we state in Table A.7 several classes of restricted permutations together with references and initial values of the corresponding sequences. A.1 Statistics on permutations and words Definition A.1.1. In a permutation π = π1π2 : : : πn, πi is a left-to-right maximum (resp., left-to-right minimum) if πi ≥ πj (resp., πi ≤ πj) for 1 ≤ j ≤ i. Also, πi is a right-to-left maximum (resp., right-to-left minimum) if πi ≥ πj (resp., πi ≤ πj) for i ≤ j ≤ n. Example A.1.2. If π = 3152647 then the left-to-right maxima are 3, 5, 6 and 7, the left-to-right minima are 3 and 1, the right-to-left maximum is 7, and the right-to-left minima are 7, 4, 2 and 1. In Table A.1 we define all permutation statistics appearing in the book. The list of statistics is essentially taken from [259]. Note that many of the statistics defined make sense for words, though not all. For example, the statistic head :i, the position of the smallest letter, is not defined for words as we may have several instances of the smallest letter. The expression π1 appearing in Table A.1 means the permutation beginning with π and ending with a letter that is larger that any letter in π. Remark A.1.3. Six statistics in Table A.1 have complex names like comp :r or last :i, which stands for respective compositions (see Definition 1.0.12 for meaning of the trivial bijections i and r). For example, to calculate the value of the statistic S. Kitaev, Patterns in Permutations and Words, Monographs in Theoretical Computer Science. 387 An EATCS Series, DOI 10.1007/978-3-642-17333-2, © Springer-Verlag Berlin Heidelberg 2011 388 Appendix A. Useful notions and facts Statistic Description asc # of ascents (letters followed by a larger letter = occurrences of 12) comp # of components (ways to factor π = στ so that each letter in non-empty σ is smaller than any letter in τ; the empty τ gives one such factorization) comp :r # of reverse components (ways to factor π = στso that each letter in non- empty σis larger than any letter in τ; the empty τgives one factorization) cyc # of cycles dasc # of double ascents (# of occurrences of the pattern 123) ddes # of double descents (# of occurrences of the pattern 321) des # of descents (letters followed by a smaller letter = occurrences of 21) exc # of excedances (positions i in π = π1π2 : : : πn such that πi > i) fp # of fixed points (positions i in π = π1π2 : : : πn such that πi = i) head the first (leftmost) letter head :i position of the smallest letter inv # of inversions (pairs i < j such that πi > πj in π = π1π2 : : : πn) last the last (rightmost) letter last :i position of the largest letter ldr length of leftmost decreasing run (largest i such that π1 > π2 > ··· > πi) lds length of the longest decreasing subsequence length # of letters lir length of leftmost increasing run (largest i such that π 1 < π2 < ··· < πi) lir :i = zeil:c, largest i such that 12 ··· i is a subsequence in π lis length of the longest increasing subsequence lmax # of left-to-right maxima lmin # of left-to-right minima maj sum of positions in which descents occur peak # of peaks (positions i in π such that πi−1 < πi > πi+1) peak :i #f i j i is to the right of both i − 1 and i + 1g slmax largest i such that π1 ≥ π1, π1 ≥ π2,..., π1 ≥ πi (# of letters to the left of second left-to-right maximum in π1) rank for π = π1π2 : : : πn, largest k such that πi > k for all i ≤ k (see [361]) rdr = lir:r, length of the rightmost decreasing run rmax # of right-to-left maxima rmin # of right-to-left minima rir = ldr:r, length of the rightmost increasing run valley # of valleys (positions i in π such that πi−1 > πi < πi+1) valley :i #f i j i is to the left of both i − 1 and i + 1g zeil length of longest subsequence n(n − 1) ··· i in π of length n (see [815]) Table A.1: Definitions of permutation statistics appearing in the book. A.2 Numbers and lattice paths of interest 389 For π = 4523176 For π = 3265714 asc(π) = 3, comp(π) = 3, des(π) = 3 asc(π) = 3, comp(π) = 2, des(π) = 3 comp :r(π) = 1, exc(π) = 3, fp(π) = 0 comp :r(π) = 1, exc(π) = 4, fp(π) = 1 head(π) = 4, head :i(π) = 5, last(π) = 6 head(π) = 3, head :i(π) = 6, last(π) = 4 last :i(π) = 6, ldr(π) = 1, lds(π) = 3 last :i(π) = 5, ldr(π) = 2, lds(π) = 3 lir(π) = 2, lir :i(π) = 1, slmax(π) = 1 lir(π) = 1, lir :i(π) = 1, slmax(π) = 2 lmax(π) = 3, lmin(π) = 3, peak(π) = 3 lmax(π) = 3, lmin(π) = 3, peak(π) = 2 peak :i(π) = 1, lis(π) = 3, rdr(π) = 2 peak :i(π) = 2, lis(π) = 3, rdr(π) = 1 rmax(π) = 2, rmin(π) = 2, cyc(π) = 2 rmax(π) = 2, rmin(π) = 2, cyc(π) = 3 rir(π) = 1, valley :i(π) = 2, zeil(π) = 2 rir(π) = 2, valley :i(π) = 2, zeil(π) = 1 dasc(π) = 0, ddes(π) = 0, maj(π) = 12 dasc(π) = 0, ddes(π) = 0, maj(π) = 9 inv(π) = 9, valley(π) = 2, rank(π) = 2 inv(π) = 10, valley(π) = 3, rank(π) = 1 Table A.2: Values of permutation statistics introduced in Table A.1 on the permu- tations 4523176 and 3265714 (length(π) = 7 in both cases). comp :r we can either follow the direct description of it in Table A.1, or we can take a permutation, apply to it the reverse operation r and calculate the value of the statistic comp on the obtained permutation. Similarly, a way to calculate last :i is to take a permutation, apply to it the inverse operation i, and to calculate the value of the statistic last on the obtained permutation. Table A.2 provides examples supporting the definitions in Table A.1. Remark A.1.4. As noted, not all permutation statistics can be translated into statistics for words. Similarly, not all word statistics can be translated into permu- tation statistics. For example, the statistic lev, which is the number of levels, is defined on words as the number of times two equal letters stay next to each other (e.g., lev(3114244333) = 4), is of interest in words, but has the trivial value zero on permutations. A.2 Numbers and lattice paths of interest In this section we collect definitions and some basic facts on selected numbers appear- ing in this book. For more information on particular objects of interest discussed below, one should consult other sources, such as standard texts in combinatorics (e.g., [743, 745]). 390 Appendix A. Useful notions and facts A.2.1 Numbers involved The Fibonacci numbers are named after Leonardo of Pisa (c. 1170 - c. 1250), who was known as Fibonacci. The Fibonacci numbers were known in ancient India, and there are many applications of these numbers. The n-th Fibonacci number is defined recursively as follows. F0 = 0, F1 = 1, and for n ≥ 2, Fn = Fn−1 + Fn−2. These numbers satisfy a countless number of identities. Letting p 1 + 5 ' = ≈ 1:6180339887 ··· 2 denote the golden ratio, the n-th Fibonacci number is given by 'n − (1 − ')n 'n − (−1=')n Fn = p = p : 5 5 p n Thus, asymptotically Fn ∼ ' = 5. The generating function for the Fibonacci numbers is given by X x F (x) = F xn = : n 1 − x − x2 n≥0 The first few Fibonacci numbers, for n = 0; 1; 2;:::, are 0; 1; 1; 2; 3; 5; 8; 13; 21; 34; 55; 89; 144;:::: The Catalan numbers are named after the Belgian mathematician Eug´ene Charles Catalan (1814{1894) and they appear in many counting problems. Catalan defined these numbers in [235] in 1838. For n ≥ 0, the n-th Catalan number is given by 1 2n (2n)! C = = : n n + 1 n (n + 1)!n! A recursive way to define the Catalan numbers is as follows: C0 = 1 and Cn+1 = Pn i=0 CiCn−i for n ≥ 0, and asymptotically, the Catalan numbers grow as 4n C ∼ p : n n3=2 π The generating function for the Catalan numbers is p X 1 − 1 − 4x C(x) = C xn = : n 2x n≥0 The first few Catalan numbers, for n = 0; 1; 2;:::, are 1; 1; 2; 5; 14; 42; 132; 429; 1430; 4862; 16796; 58786; 208012; 742900;:::: A.2 Numbers and lattice paths of interest 391 We refer the reader to www-math.mit.edu/~rstan/ec/catadd.pdf for an impres- sive collection by Stanley of different structures counted by the Catalan numbers. The Bell numbers are named after Eric Temple Bell (1883-1960). The n-th Bell number gives the number of partitions of a set with n elements. For example, there are five partitions for the 3-element set fa; b; cg: ffag; fbg; fcgg, ffag; fb; cgg, ffbg; fa; cgg, ffcg; fa; bgg, and ffa; b; cgg.
Load more

Recommended publications
  • Motzkin Paths, Motzkin Polynomials and Recurrence Relations
    Motzkin paths, Motzkin polynomials and recurrence relations Roy Oste and Joris Van der Jeugt Department of Applied Mathematics, Computer Science and Statistics Ghent University B-9000 Gent, Belgium [email protected], [email protected] Submitted: Oct 24, 2014; Accepted: Apr 4, 2015; Published: Apr 21, 2015 Mathematics Subject Classifications: 05A10, 05A15 Abstract We consider the Motzkin paths which are simple combinatorial objects appear- ing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polyno- mials) have been studied before, but here we deduce some properties based on recurrence relations. The recurrence relations proved here also allow an efficient computation of the Motzkin polynomials. Finally, we show that the matrix en- tries of powers of an arbitrary tridiagonal matrix are essentially given by Motzkin polynomials, a property commonly known but usually stated without proof. 1 Introduction Catalan numbers and Motzkin numbers have a long history in combinatorics [19, 20]. 1 2n A lot of enumeration problems are counted by the Catalan numbers Cn = n+1 n , see e.g. [20]. Closely related to Catalan numbers are Motzkin numbers M , n ⌊n/2⌋ n M = C n 2k k Xk=0 similarly associated to many counting problems, see e.g. [9, 1, 18]. For example, the number of different ways of drawing non-intersecting chords between n points on a circle is counted by the Motzkin numbers.
    [Show full text]
  • Motzkin Paths
    Discrete Math. 312 (2012), no. 11, 1918-1922 Noncrossing Linked Partitions and Large (3; 2)-Motzkin Paths William Y.C. Chen1, Carol J. Wang2 1Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.R. China 2Department of Mathematics Beijing Technology and Business University Beijing 100048, P.R. China emails: [email protected], wang [email protected] Abstract. Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and (3; 2)-Motzkin paths, where a (3; 2)-Motzkin path can be viewed as a Motzkin path for which there are three types of horizontal steps and two types of down steps. A large (3; 2)-Motzkin path is a (3; 2)-Motzkin path for which there are only two types of horizontal steps on the x-axis. We establish a one-to-one correspondence between the set of noncrossing linked partitions of f1; : : : ; n + 1g and the set of large (3; 2)- Motzkin paths of length n, which leads to a simple explanation of the well-known relation between the large and the little Schr¨odernumbers. Keywords: Noncrossing linked partition, Schr¨oderpath, large (3; 2)-Motzkin path, Schr¨odernumber AMS Classifications: 05A15, 05A18. 1 1 Introduction The notion of noncrossing linked partitions was introduced by Dykema [5] in the study of the unsymmetrized T-transform in free probability theory. Let [n] denote f1; : : : ; ng. It has been shown that the generating function of the number of noncrossing linked partitions of [n + 1] is given by 1 p X 1 − x − 1 − 6x + x2 F (x) = f xn = : (1.1) n+1 2x n=0 This implies that the number of noncrossing linked partitions of [n + 1] is equal to the n-th large Schr¨odernumber Sn, that is, the number of large Schr¨oderpaths of length 2n.
    [Show full text]
  • Algoritmi Za Sortiranje U Programskom Jeziku C++ Završni Rad
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repository of the University of Rijeka SVEUČILIŠTE U RIJECI FILOZOFSKI FAKULTET U RIJECI ODSJEK ZA POLITEHNIKU Algoritmi za sortiranje u programskom jeziku C++ Završni rad Mentor završnog rada: doc. dr. sc. Marko Maliković Student: Alen Jakus Rijeka, 2016. SVEUČILIŠTE U RIJECI Filozofski fakultet Odsjek za politehniku Rijeka, Sveučilišna avenija 4 Povjerenstvo za završne i diplomske ispite U Rijeci, 07. travnja, 2016. ZADATAK ZAVRŠNOG RADA (na sveučilišnom preddiplomskom studiju politehnike) Pristupnik: Alen Jakus Zadatak: Algoritmi za sortiranje u programskom jeziku C++ Rješenjem zadatka potrebno je obuhvatiti sljedeće: 1. Napraviti pregled algoritama za sortiranje. 2. Opisati odabrane algoritme za sortiranje. 3. Dijagramima prikazati rad odabranih algoritama za sortiranje. 4. Opis osnovnih svojstava programskog jezika C++. 5. Detaljan opis tipova podataka, izvedenih oblika podataka, naredbi i drugih elemenata iz programskog jezika C++ koji se koriste u rješenjima odabranih problema. 6. Opis rješenja koja su dobivena iz napisanih programa. 7. Cjelokupan kôd u programskom jeziku C++. U završnom se radu obvezno treba pridržavati Pravilnika o diplomskom radu i Uputa za izradu završnog rada sveučilišnog dodiplomskog studija. Zadatak uručen pristupniku: 07. travnja 2016. godine Rok predaje završnog rada: ____________________ Datum predaje završnog rada: ____________________ Zadatak zadao: Doc. dr. sc. Marko Maliković 2 FILOZOFSKI FAKULTET U RIJECI Odsjek za politehniku U Rijeci, 07. travnja 2016. godine ZADATAK ZA ZAVRŠNI RAD (na sveučilišnom preddiplomskom studiju politehnike) Pristupnik: Alen Jakus Naslov završnog rada: Algoritmi za sortiranje u programskom jeziku C++ Kratak opis zadatka: Napravite pregled algoritama za sortiranje. Opišite odabrane algoritme za sortiranje.
    [Show full text]
  • Some Identities on the Catalan, Motzkin and Schr¨Oder Numbers
    Discrete Applied Mathematics 156 (2008) 2781–2789 www.elsevier.com/locate/dam Some identities on the Catalan, Motzkin and Schroder¨ numbers Eva Y.P. Denga,∗, Wei-Jun Yanb a Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, PR China b Department of Foundation Courses, Neusoft Institute of Information, Dalian 116023, PR China Received 19 July 2006; received in revised form 1 September 2007; accepted 18 November 2007 Available online 3 January 2008 Abstract In this paper, some identities between the Catalan, Motzkin and Schroder¨ numbers are obtained by using the Riordan group. We also present two combinatorial proofs for an identity related to the Catalan numbers with the Motzkin numbers and an identity related to the Schroder¨ numbers with the Motzkin numbers, respectively. c 2007 Elsevier B.V. All rights reserved. Keywords: Catalan number; Motzkin number; Schroder¨ number; Riordan group 1. Introduction The Catalan, Motzkin and Schroder¨ numbers have been widely encountered and widely investigated. They appear in a large number of combinatorial objects, see [11] and The On-Line Encyclopedia of Integer Sequences [8] for more details. Here we describe them in terms of certain lattice paths. A Dyck path of semilength n is a lattice path from the origin (0, 0) to (2n, 0) consisting of up steps (1, 1) and down steps (1, −1) that never goes below the x-axis. The set of Dyck paths of semilength n is enumerated by the n-th Catalan number 1 2n cn = n + 1 n (sequence A000108 in [8]). The generating function for the Catalan numbers (cn)n∈N is √ 1 − 1 − 4x c(x) = .
    [Show full text]
  • Longest Increasing Subsequence
    Longest increasing subsequence Longest increasing subsequence. Given a sequence of elements c1, c2, …, cn from a totally-ordered universe, find the longest increasing subsequence. Ex. 7 2 8 1 3 4 10 6 9 5. Maximum Unique Match finder Application. Part of MUMmer system for aligning entire genomes. O(n 2) dynamic programming solution. LIS is a special case of edit-distance. ・x = c1 c2 ⋯ cn. ・y = sorted sequence of ck, removing any duplicates. ・Mismatch penalty = ∞; gap penalty = 1. 1 Patience solitaire Patience. Deal cards c1, c2, …, cn into piles according to two rules: ・Can't place a higher-valued card onto a lowered-valued card. ・Can form a new pile and put a card onto it. Goal. Form as few piles as possible. first card to deal 2 Patience: greedy algorithm Greedy algorithm. Place each card on leftmost pile that fits. first card to deal 3 Patience: greedy algorithm Greedy algorithm. Place each card on leftmost pile that fits. Observation. At any stage during greedy algorithm, top cards of piles increase from left to right. first card to deal top cards 4 Patience-LIS: weak duality Weak duality. In any legal game of patience, the number of piles ≥ length of any increasing subsequence. Pf. ・Cards within a pile form a decreasing subsequence. ・Any increasing sequence can use at most one card from each pile. ▪ decreasing subsequence 5 Patience-LIS: strong duality Theorem. [Hammersley 1972] Min number of piles = max length of an IS; moreover greedy algorithm finds both. at time of insertion Pf. Each card maintains a pointer to top card in previous pile.
    [Show full text]
  • Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression
    1 2 Journal of Integer Sequences, Vol. 10 (2007), 3 Article 07.7.4 47 6 23 11 Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression Toufik Mansour Department of Mathematics University of Haifa Haifa 31905 Israel [email protected] Matthias Schork1 Camillo-Sitte-Weg 25 60488 Frankfurt Germany [email protected] Yidong Sun Department of Mathematics Dalian Maritime University 116026 Dalian P. R. China [email protected] Abstract The generating function for the (colored) Motzkin numbers of higher rank intro- duced recently is discussed. Considering the special case of rank one yields the corre- sponding results for the conventional colored Motzkin numbers for which in addition a recursion relation is given. Some explicit expressions are given for the higher rank case in the first few instances. 1All correspondence should be directed to this author. 1 1 Introduction The classical Motzkin numbers (A001006 in [1]) count the numbers of Motzkin paths (and are also related to many other combinatorial objects, see Stanley [2]). Let us recall the definition of Motzkin paths. We consider in the Cartesian plane Z Z those lattice paths starting from (0, 0) that use the steps U, L, D , where U = (1, 1) is× an up-step, L = (1, 0) a level-step and D = (1, 1) a down-step.{ Let} M(n, k) denote the set of paths beginning in (0, 0) and ending in (n,− k) that never go below the x-axis. Paths in M(n, 0) are called Motzkin paths and m := M(n, 0) is called n-th Motzkin number.
    [Show full text]
  • Number Pattern Hui Fang Huang Su Nova Southeastern University, [email protected]
    Transformations Volume 2 Article 5 Issue 2 Winter 2016 12-27-2016 Number Pattern Hui Fang Huang Su Nova Southeastern University, [email protected] Denise Gates Janice Haramis Farrah Bell Claude Manigat See next page for additional authors Follow this and additional works at: https://nsuworks.nova.edu/transformations Part of the Curriculum and Instruction Commons, Science and Mathematics Education Commons, Special Education and Teaching Commons, and the Teacher Education and Professional Development Commons Recommended Citation Su, Hui Fang Huang; Gates, Denise; Haramis, Janice; Bell, Farrah; Manigat, Claude; Hierpe, Kristin; and Da Silva, Lourivaldo (2016) "Number Pattern," Transformations: Vol. 2 : Iss. 2 , Article 5. Available at: https://nsuworks.nova.edu/transformations/vol2/iss2/5 This Article is brought to you for free and open access by the Abraham S. Fischler College of Education at NSUWorks. It has been accepted for inclusion in Transformations by an authorized editor of NSUWorks. For more information, please contact [email protected]. Number Pattern Cover Page Footnote This article is the result of the MAT students' collaborative research work in the Pre-Algebra course. The research was under the direction of their professor, Dr. Hui Fang Su. The ap per was organized by Team Leader Denise Gates. Authors Hui Fang Huang Su, Denise Gates, Janice Haramis, Farrah Bell, Claude Manigat, Kristin Hierpe, and Lourivaldo Da Silva This article is available in Transformations: https://nsuworks.nova.edu/transformations/vol2/iss2/5 Number Patterns Abstract In this manuscript, we study the purpose of number patterns, a brief history of number patterns, and classroom uses for number patterns and magic squares.
    [Show full text]
  • A Generalization of Square-Free Strings a GENERALIZATION of SQUARE-FREE STRINGS
    A Generalization of Square-free Strings A GENERALIZATION OF SQUARE-FREE STRINGS BY NEERJA MHASKAR, B.Tech., M.S. a thesis submitted to the department of Computing & Software and the school of graduate studies of mcmaster university in partial fulfillment of the requirements for the degree of Doctor of Philosophy c Copyright by Neerja Mhaskar, August, 2016 All Rights Reserved Doctor of Philosophy (2016) McMaster University (Dept. of Computing & Software) Hamilton, Ontario, Canada TITLE: A Generalization of Square-free Strings AUTHOR: Neerja Mhaskar B.Tech., (Mechanical Engineering) Jawaharlal Nehru Technological University Hyderabad, India M.S., (Engineering Science) Louisiana State University, Baton Rouge, USA SUPERVISOR: Professor Michael Soltys CO-SUPERVISOR: Professor Ryszard Janicki NUMBER OF PAGES: xiii, 116 ii To my family Abstract Our research is in the general area of String Algorithms and Combinatorics on Words. Specifically, we study a generalization of square-free strings, shuffle properties of strings, and formalizing the reasoning about finite strings. The existence of infinitely long square-free strings (strings with no adjacent re- peating word blocks) over a three (or more) letter finite set (referred to as Alphabet) is a well-established result. A natural generalization of this problem is that only sub- sets of the alphabet with predefined cardinality are available, while selecting symbols of the square-free string. This problem has been studied by several authors, and the lowest possible bound on the cardinality of the subset given is four. The problem remains open for subset size three and we investigate this question. We show that square-free strings exist in several specialized cases of the problem and propose ap- proaches to solve the problem, ranging from patterns in strings to Proof Complexity.
    [Show full text]
  • Some Recent Results on Squarefree Words
    Some recent results on squarefree words by Jean Berstel Universit~ Pierre et Marie Curie and L.I.T.P Paris "F~r die Entwicklung der logischen Wissenschaften wird es, ohne ROcksicht auf etwaige Anwendungen, yon Bedeutung sein, ausgedehnte Felder f~r Spekulation Ober schwierige Probleme zu finden." Axel Thue, 1912. I. Introduction. When Axel Thue wrote these lines in the introduction to his 1912 paper on squarefree words, he certainly did not feel as a theoretical computer scientist. During the past seventy years, there was an increasing interest in squarefree words and more generally in repetitions in words. However, A. Thue's sentence seems still to hold : in some sense, he said that there is no reason to study squarefree words, excepted that it's a difficult question, and that it is of primary importance to investigate new domains. Seventy years later, these questions are no longer new, and one may ask if squarefree words served already. First, we observe that infinite squarefree, overlap-free or cube-free words indeed served as examples or counter-examples in several, quite different domains. In symbolic dynamics, they were introduced by Morse in 1921 [36] . Another use is in group theory, where an infinite square-free word is one (of the numerous) steps in disproving the Burnside conjecture (see Adjan[2]). Closer to computer science is Morse and Hedlund's interpretatio~ in relation with chess [37]. We also mention applications to formal language theory : Brzozowsky, K. Culik II and Gabriellian [7] use squarefree words in connection with noncounting languages, J. Goldstine uses the Morse sequence to show that a property of some family of languages [22].
    [Show full text]
  • Digit Problems
    Chapter 1 Digit problems 1.1 When can you cancel illegitimately and yet get the correct answer? Let ab and bc be 2-digit numbers. When do such illegitimate cancella- tions as ab ab a bc = bc6 = c , 6 a allowing perhaps further simplifications of c ? 16 1 19 1 26 2 49 4 Answer. 64 = 4 , 95 = 5 , 65 = 5 , 98 = 8 . Solution. We may assume a, b, c not all equal. 10a+b a Suppose a, b, c are positive integers 9 such that 10b+c = c . (10a + b)c = a(10b + c), or (9a + b≤)c = 10ab. If any two of a, b, c are equal, then all three are equal. We shall therefore assume a, b, c all distinct. 9ac = b(10a c). If b is not divisible− by 3, then 9 divides 10a c = 9a +(a c). It follows that a = c, a case we need not consider. − − It remains to consider b =3, 6, 9. Rewriting (*) as (9a + b)c = 10ab. If c is divisible by 5, it must be 5, and we have 9a + b = 2ab. The only possibilities are (b, a)=(6, 2), (9, 1), giving distinct (a, b, c)=(1, 9, 5), (2, 6, 5). 102 Digit problems If c is not divisible by 5, then 9a + b is divisible by 5. The only possibilities of distinct (a, b) are (b, a) = (3, 8), (6, 1), (9, 4). Only the latter two yield (a, b, c)=(1, 6, 4), (4, 9, 8). Exercise 1. Find all possibilities of illegitimate cancellations of each of the fol- lowing types, leading to correct results, allowing perhaps further simplifications.
    [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]
  • Resource Guide to the Arkansas Curriculum Framework for Students with Disabilities for Literacy, Mathematics, and Science
    Resource Guide to the Arkansas Curriculum Framework for Students with Disabilities for Literacy, Mathematics, and Science Summer 2006 Purpose and Process The Individuals with Disabilities Education Act and No Child Left Behind mandates that schools provide access to the general education curriculum for all students receiving special education services. In recognizing the challenge of providing opportunities for students with disabilities to access general education curriculum, it is the desire of the Arkansas Department of Education to assist educators with this process. The goal is to assist school personnel who serve children with disabilities in conceptualizing, planning, and implementing activities that are aligned to the Arkansas Curriculum Framework. The following document contains ideas for linking activities to the same literacy, mathematics, and science frameworks used for the general education curriculum. When selecting appropriate activities, decisions must be based on individual student needs and abilities. Collaboration with general education personnel will provide assistance in linking curriculum with the state framework. The Arkansas Alternate Portfolio Assessment must have alignment to the Arkansas Curriculum Frameworks for English Language Arts, Mathematics, and Science. The Alternate Portfolio Assessment for Students with Disabilities must align with the same content standards used by other students. The following are the strands used in each Content area. English Language Arts Curriculum Framework Oral and Visual Communications
    [Show full text]