A Brief Introduction to Ancient Counting Systems for Non-Mathematicians
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Numbers - the Essence
Numbers - the essence A computer consists in essence of a sequence of electrical on/off switches. Big question: How do switches become a computer? ITEC 1000 Introduction to Information Technologies 1 Friday, September 25, 2009 • A single switch is called a bit • A sequence of 8 bits is called a byte • Two or more bytes are often grouped to form word • Modern laptop/desktop standardly will have memory of 1 gigabyte = 1,000,000,000 bytes ITEC 1000 Introduction to Information Technologies 2 Friday, September 25, 2009 Question: How do encode information with switches ? Answer: With numbers - binary numbers using only 0’s and 1’s where for each switch on position = 1 off position = 0 ITEC 1000 Introduction to Information Technologies 3 Friday, September 25, 2009 • For a byte consisting of 8 bits there are a total of 28 = 256 ways to place 0’s and 1’s. Example 0 1 0 1 1 0 1 1 • For each grouping of 4 bits there are 24 = 16 ways to place 0’s and 1’s. • For a byte the first and second groupings of four bits can be represented by two hexadecimal digits • this will be made clear in following slides. ITEC 1000 Introduction to Information Technologies 4 Friday, September 25, 2009 Bits & Bytes imply creation of data and computer analysis of data • storing data (reading) • processing data - arithmetic operations, evaluations & comparisons • output of results ITEC 1000 Introduction to Information Technologies 5 Friday, September 25, 2009 Numeral systems A numeral system is any method of symbolically representing the counting numbers 1, 2, 3, 4, 5, . -
Early Etruscan Inscriptions
ja trvw (λ^ J uu^aunA oWVtC OnXv ^^a^JV /yu* A^-vr^ EARLY ETRUSCAN INSCRIPTIONS FABRETTI 2343-2346 GEORGE HEMPL THIS PAPER IS REPRINTED FROM THE MATZKE MEMORIAL VOLUME PUBLISHED BY THE UNIVERSITY XTbe TUntpereitp prese STANFORD UNIVERSITY CALIFORNIA 1911 IN MEMORY OF JOHN ERNST MATZKE EARLY ETRUSCAN INSCRIPTIONS FABRETTI 2342-2346 How I, a Germanic scholar, came to be interested in Venetic and Etrus- can, I have told in my report on the results of my Italic studies. This report has been delayed, chiefly by the difficulties inherent in such an under- taking, but it will now be published in a very short time. The present paper is an abstract from it. A few weeks before his death, Professor Matzke urged me to hasten the publication of my report. He said that my silence was being misinterpreted, and that I owed it not only to myself but also to my friends to publish something at once—if only a fragment. I was touched by what he said and the way in which he said it. It was almost exactly what another friend, Otto Jespersen, had written me from Copenhagen not long before, and what still others, as if by concert, now began to urge upon me. I saw the force of their arguments and decided to drop everything else and complete my report. And now that Fate has sud- denly cut short the life of one of them, I can find no more appropriate tribute to lay on his grave than the fragment he so recently urged me to publish. -
On the Origin of the Indian Brahma Alphabet
- ON THE <)|{I<; IN <>F TIIK INDIAN BRAHMA ALPHABET GEORG BtfHLKi; SECOND REVISED EDITION OF INDIAN STUDIES, NO III. TOGETHER WITH TWO APPENDICES ON THE OKU; IN OF THE KHAROSTHI ALPHABET AND OF THK SO-CALLED LETTER-NUMERALS OF THE BRAHMI. WITH TIIKKK PLATES. STRASSBUKi-. K A K 1. I. 1 1M I: \ I I; 1898. I'lintccl liy Adolf Ilcil/.haiisi'ii, Vicniiii. Preface to the Second Edition. .As the few separate copies of the Indian Studies No. Ill, struck off in 1895, were sold very soon and rather numerous requests for additional ones were addressed both to me and to the bookseller of the Imperial Academy, Messrs. Carl Gerold's Sohn, I asked the Academy for permission to issue a second edition, which Mr. Karl J. Trlibner had consented to publish. My petition was readily granted. In addition Messrs, von Holder, the publishers of the Wiener Zeitschrift fur die Kunde des Morgenlandes, kindly allowed me to reprint my article on the origin of the Kharosthi, which had appeared in vol. IX of that Journal and is now given in Appendix I. To these two sections I have added, in Appendix II, a brief review of the arguments for Dr. Burnell's hypothesis, which derives the so-called letter- numerals or numerical symbols of the Brahma alphabet from the ancient Egyptian numeral signs, together with a third com- parative table, in order to include in this volume all those points, which require fuller discussion, and in order to make it a serviceable companion to the palaeography of the Grund- riss. -
0. Introduction L2/12-386
Doc Type: Working Group Document Title: Revised Proposal to Encode Additional Old Italic Characters Source: UC Berkeley Script Encoding Initiative (Universal Scripts Project) Author: Christopher C. Little ([email protected]) Status: Liaison Contribution Action: For consideration by JTC1/SC2/WG2 and UTC Replaces: N4046 (L2/11-146R) Date: 2012-11-06 0. Introduction The existing Old Italic character repertoire includes 31 letters and 4 numerals. The Unicode Standard, following the recommendations in the proposal L2/00-140, states that Old Italic is to be used for the encoding of Etruscan, Faliscan, Oscan, Umbrian, North Picene, and South Picene. It also specifically states that Old Italic characters are inappropriate for encoding the languages of ancient Italy north of Etruria (Venetic, Raetic, Lepontic, and Gallic). It is true that the inscriptions of languages north of Etruria exhibit a number of common features, but those features are often exhibited by the other scripts of Italy. Only one of these northern languages, Raetic, requires the addition of any additional characters in order to be fully supported by the Old Italic block. Accordingly, following the addition of this one character, the Unicode Standard should be amended to recommend the encoding of Venetic, Raetic, Lepontic, and Gallic using Old Italic characters. In addition, one additional character is necessary to encode South Picene inscriptions. This proposal is divided into five parts: The first part (§1) identifies the two unencoded characters (Raetic Ɯ and South Picene Ũ) and demonstrates their use in inscriptions. The second part (§2) examines the use of each Old Italic character, as it appears in Etruscan, Faliscan, Oscan, Umbrian, South Picene, Venetic, Raetic, Lepontic, Gallic, and archaic Latin, to demonstrate the unifiability of the northern Italic languages' scripts with Old Italic. -
Section 4.2 Counting
Section 4.2 Counting CS 130 – Discrete Structures Counting: Multiplication Principle • The idea is to find out how many members are present in a finite set • Multiplication Principle: If there are n possible outcomes for a first event and m possible outcomes for a second event, then there are n*m possible outcomes for the sequence of two events. • From the multiplication principle, it follows that for 2 sets A and B, |A x B| = |A|x|B| – A x B consists of all ordered pairs with first component from A and second component from B CS 130 – Discrete Structures 27 Examples • How many four digit number can there be if repetitions of numbers is allowed? • And if repetition of numbers is not allowed? • If a man has 4 suits, 8 shirts and 5 ties, how many outfits can he put together? CS 130 – Discrete Structures 28 Counting: Addition Principle • Addition Principle: If A and B are disjoint events with n and m outcomes, respectively, then the total number of possible outcomes for event “A or B” is n+m • If A and B are disjoint sets, then |A B| = |A| + |B| using the addition principle • Example: A customer wants to purchase a vehicle from a dealer. The dealer has 23 autos and 14 trucks in stock. How many selections does the customer have? CS 130 – Discrete Structures 29 More On Addition Principle • If A and B are disjoint sets, then |A B| = |A| + |B| • Prove that if A and B are finite sets then |A-B| = |A| - |A B| and |A-B| = |A| - |B| if B A (A-B) (A B) = (A B) (A B) = A (B B) = A U = A Also, A-B and A B are disjoint sets, therefore using the addition principle, |A| = | (A-B) (A B) | = |A-B| + |A B| Hence, |A-B| = |A| - |A B| If B A, then A B = B Hence, |A-B| = |A| - |B| CS 130 – Discrete Structures 30 Using Principles Together • How many four-digit numbers begin with a 4 or a 5 • How many three-digit integers (numbers between 100 and 999 inclusive) are even? • Suppose the last four digit of a telephone number must include at least one repeated digit. -
180: Counting Techniques
180: Counting Techniques In the following exercise we demonstrate the use of a few fundamental counting principles, namely the addition, multiplication, complementary, and inclusion-exclusion principles. While none of the principles are particular complicated in their own right, it does take some practice to become familiar with them, and recognise when they are applicable. I have attempted to indicate where alternate approaches are possible (and reasonable). Problem: Assume n ≥ 2 and m ≥ 1. Count the number of functions f :[n] ! [m] (i) in total. (ii) such that f(1) = 1 or f(2) = 1. (iii) with minx2[n] f(x) ≤ 5. (iv) such that f(1) ≥ f(2). (v) that are strictly increasing; that is, whenever x < y, f(x) < f(y). (vi) that are one-to-one (injective). (vii) that are onto (surjective). (viii) that are bijections. (ix) such that f(x) + f(y) is even for every x; y 2 [n]. (x) with maxx2[n] f(x) = minx2[n] f(x) + 1. Solution: (i) A function f :[n] ! [m] assigns for every integer 1 ≤ x ≤ n an integer 1 ≤ f(x) ≤ m. For each integer x, we have m options. As we make n such choices (independently), the total number of functions is m × m × : : : m = mn. (ii) (We assume n ≥ 2.) Let A1 be the set of functions with f(1) = 1, and A2 the set of functions with f(2) = 1. Then A1 [ A2 represents those functions with f(1) = 1 or f(2) = 1, which is precisely what we need to count. We have jA1 [ A2j = jA1j + jA2j − jA1 \ A2j. -
The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes
Portland State University PDXScholar Mathematics and Statistics Faculty Fariborz Maseeh Department of Mathematics Publications and Presentations and Statistics 3-2018 The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes Xu Hu Sun University of Macau Christine Chambris Université de Cergy-Pontoise Judy Sayers Stockholm University Man Keung Siu University of Hong Kong Jason Cooper Weizmann Institute of Science SeeFollow next this page and for additional additional works authors at: https:/ /pdxscholar.library.pdx.edu/mth_fac Part of the Science and Mathematics Education Commons Let us know how access to this document benefits ou.y Citation Details Sun X.H. et al. (2018) The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes. In: Bartolini Bussi M., Sun X. (eds) Building the Foundation: Whole Numbers in the Primary Grades. New ICMI Study Series. Springer, Cham This Book Chapter is brought to you for free and open access. It has been accepted for inclusion in Mathematics and Statistics Faculty Publications and Presentations by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Authors Xu Hu Sun, Christine Chambris, Judy Sayers, Man Keung Siu, Jason Cooper, Jean-Luc Dorier, Sarah Inés González de Lora Sued, Eva Thanheiser, Nadia Azrou, Lynn McGarvey, Catherine Houdement, and Lisser Rye Ejersbo This book chapter is available at PDXScholar: https://pdxscholar.library.pdx.edu/mth_fac/253 Chapter 5 The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes Xu Hua Sun , Christine Chambris Judy Sayers, Man Keung Siu, Jason Cooper , Jean-Luc Dorier , Sarah Inés González de Lora Sued , Eva Thanheiser , Nadia Azrou , Lynn McGarvey , Catherine Houdement , and Lisser Rye Ejersbo 5.1 Introduction Mathematics learning and teaching are deeply embedded in history, language and culture (e.g. -
UNIT 1: Counting and Cardinality
Grade: K Unit Number: 1 Unit Name: Counting and Cardinality Instructional Days: 40 days EVERGREEN SCHOOL K DISTRICT GRADE Unit 1 Unit 2 Unit 3 Unit 4 Unit 5 Unit 6 Counting Operations Geometry Measurement Numbers & Algebraic Thinking and and Data Operations in Cardinality Base 10 8 weeks 4 weeks 8 weeks 3 weeks 4 weeks 5 weeks UNIT 1: Counting and Cardinality Dear Colleagues, Enclosed is a unit that addresses all of the Common Core Counting and Cardinality standards for Kindergarten. We took the time to analyze, group and organize them into a logical learning sequence. Thank you for entrusting us with the task of designing a rich learning experience for all students, and we hope to improve the unit as you pilot it and make it your own. Sincerely, Grade K Math Unit Design Team CRITICAL THINKING COLLABORATION COMMUNICATION CREATIVITY Evergreen School District 1 MATH Curriculum Map aligned to the California Common Core State Standards 7/29/14 Grade: K Unit Number: 1 Unit Name: Counting and Cardinality Instructional Days: 40 days UNIT 1 TABLE OF CONTENTS Overview of the grade K Mathematics Program . 3 Essential Standards . 4 Emphasized Mathematical Practices . 4 Enduring Understandings & Essential Questions . 5 Chapter Overviews . 6 Chapter 1 . 8 Chapter 2 . 9 Chapter 3 . 10 Chapter 4 . 11 End-of-Unit Performance Task . 12 Appendices . 13 Evergreen School District 2 MATH Curriculum Map aligned to the California Common Core State Standards 7/29/14 Grade: K Unit Number: 1 Unit Name: Counting and Cardinality Instructional Days: 40 days Overview of the Grade K Mathematics Program UNIT NAME APPROX. -
Writing the History of Mathematics: Interpretations of the Mathematics of the Past and Its Relation to the Mathematics of Today
Writing the History of Mathematics: Interpretations of the Mathematics of the Past and Its Relation to the Mathematics of Today Johanna Pejlare and Kajsa Bråting Contents Introduction.................................................................. 2 Traces of Mathematics of the First Humans........................................ 3 History of Ancient Mathematics: The First Written Sources........................... 6 History of Mathematics or Heritage of Mathematics?................................. 9 Further Views of the Past and Its Relation to the Present.............................. 15 Can History Be Recapitulated or Does Culture Matter?............................... 19 Concluding Remarks........................................................... 24 Cross-References.............................................................. 24 References................................................................... 24 Abstract In the present chapter, interpretations of the mathematics of the past are problematized, based on examples such as archeological artifacts, as well as written sources from the ancient Egyptian, Babylonian, and Greek civilizations. The distinction between history and heritage is considered in relation to Euler’s function concept, Cauchy’s sum theorem, and the Unguru debate. Also, the distinction between the historical past and the practical past,aswellasthe distinction between the historical and the nonhistorical relations to the past, are made concrete based on Torricelli’s result on an infinitely long solid from -
Inventing Your Own Number System
Inventing Your Own Number System Through the ages people have invented many different ways to name, write, and compute with numbers. Our current number system is based on place values corresponding to powers of ten. In principle, place values could correspond to any sequence of numbers. For example, the places could have values corre- sponding to the sequence of square numbers, triangular numbers, multiples of six, Fibonacci numbers, prime numbers, or factorials. The Roman numeral system does not use place values, but the position of numerals does matter when determining the number represented. Tally marks are a simple system, but representing large numbers requires many strokes. In our number system, symbols for digits and the positions they are located combine to represent the value of the number. It is possible to create a system where symbols stand for operations rather than values. For example, the system might always start at a default number and use symbols to stand for operations such as doubling, adding one, taking the reciprocal, dividing by ten, squaring, negating, or any other specific operations. Create your own number system. What symbols will you use for your numbers? How will your system work? Demonstrate how your system could be used to perform some of the following functions. • Count from 0 up to 100 • Compare the sizes of numbers • Add and subtract whole numbers • Multiply and divide whole numbers • Represent fractional values • Represent irrational numbers (such as π) What are some of the advantages of your system compared with other systems? What are some of the disadvantages? If you met aliens that had developed their own number system, how might their mathematics be similar to ours and how might it be different? Make a list of some math facts and procedures that you have learned. -
AVRIGA Zprávy Jednoty Klasických Filologů
AVRIGA Zprávy Jednoty klasických filologů XLVI (2004) 1-2 JEDNOTA KLASICKÝCH FILOLOGU Praha FECE QUOD POTUE FACIANT MELIORA POTENTES» Ignotus © Jednota klasických filologů, 2004 ISSN 1211-3379 ISBN 80-86791-14-9 ČLÁNKY - COMMENTATIONES ETRUSKE číslovky {status quaestionis^ Vladimír SLUNEČKO (Praha) Přejděme nyní k ne zcela jednoduché otázce etruské číslovky „10“. S. P. CoRTSEN (1932^: 59), navrhl etruský výraz jar jako číslovku „10“. Za její doklad považoval uvedené spojení v textu plátěné knihy cis saris (LL VIII. 1), které interpretoval jako další kalendářní datum.^ S tímto názorem se však nejednou polemizovalo (např. E. Goldmann 1934'**: 200 n., M. Durante 1965^: 315 n.). Neutěšený stav v otázce etruské číslovky „10“ lze ostatně dobře demonstrovat na diskusích z nedávné doby věnované tomuto tématu. Důkaz pro rovnost výrazu jar s číslovkou „10“ se pokusil mj. nabídnout H. Rix <1969®: 853 nn.), který chtěl podobu římské číslice X „10“ odvodit na základě akrofonního principu. Je totiž prokázáno,’ že na několika archaic kých nápisech jižní Etrurie bylo použito (místo zde obvyklé sigmy) západo- řecké chí - X - pro transkripci etruského sibilantu „s“. Dříve než však tato nezdařená inovace jihoetruské písařské školy ve Vejích opět vyšla z běžného užívání, tj. nejpozději v 6. stol. př. n. 1., muselo být podle Rixe toto písmeno po vzoru akrofonního principu při tvorbě řeckých číslic použito pro označe ní etruské číslovky jar „10“, takže vznikla římská číslice X. Tento výklad (a zároveň důkaz pro jar „10“) se však nezdá být příliš přesvědčivý.^ ‘ Tento článek je pokračováním článku uveřejněného pod týmž názvem v ZJKF (Auriga) 45, 2003, s. 25-34. ’ Zur etruskischen Sprachkunde, in: Symbolae Philologicae O. -
STRUCTURE ENUMERATION and SAMPLING Chemical Structure Enumeration and Sampling Have Been Studied by Mathematicians, Computer
STRUCTURE ENUMERATION AND SAMPLING MARKUS MERINGER To appear in Handbook of Chemoinformatics Algorithms Chemical structure enumeration and sampling have been studied by 5 mathematicians, computer scientists and chemists for quite a long time. Given a molecular formula plus, optionally, a list of structural con- straints, the typical questions are: (1) How many isomers exist? (2) Which are they? And, especially if (2) cannot be answered completely: (3) How to get a sample? 10 In this chapter we describe algorithms for solving these problems. The techniques are based on the representation of chemical compounds as molecular graphs (see Chapter 2), i.e. they are mainly applied to constitutional isomers. The major problem is that in silico molecular graphs have to be represented as labeled structures, while in chemical 15 compounds, the atoms are not labeled. The mathematical concept for approaching this problem is to consider orbits of labeled molecular graphs under the operation of the symmetric group. We have to solve the so–called isomorphism problem. According to our introductory questions, we distinguish several dis- 20 ciplines: counting, enumerating and sampling isomers. While counting only delivers the number of isomers, the remaining disciplines refer to constructive methods. Enumeration typically encompasses exhaustive and non–redundant methods, while sampling typically lacks these char- acteristics. However, sampling methods are sometimes better suited to 25 solve real–world problems. There is a wide range of applications where counting, enumeration and sampling techniques are helpful or even essential. Some of these applications are closely linked to other chapters of this book. Counting techniques deliver pure chemical information, they can help to estimate 30 or even determine sizes of chemical databases or compound libraries obtained from combinatorial chemistry.