DOCSLIB.ORG

DSA-Dozenalfaqs.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DSA-Dozenalfaqs.Pdf The Dozenal Society of America Dozenal FAQs Michael Thomas De Vlieger 30 November 2011 The following ten questions were sent in recently by a stu- (12 inches to the foot, 12 original ounces to a pound, ‘inch’ dent. These lucid questions are some of those most frequently and ‘ounce’ both deriving from Roman uncia.) asked. The Dozenal Society of America is furnishing the full The integer twelve has six divisors {1, 2, 3, 4, 6, 12} while responses to these questions complete with illustrations and the number ten only has four {1, 2, 5, 10}. Divisors are im- references. Thanks to Mr. Israeli for questions 1–10! portant because they exhibit relatively brief and predict- 0. What is the number one reason why one believes base 12 is able patterns in arithmetic in a number base they divide. superior to decimal? We can see this when we look at the decimal multiplica- A. Briefly, twelve is a highly divisible yet compact num- tion products for the number 5. Decimal products of the ber; it has more divisors than ten. This facilitates learn- number 5 and an integer x have a least significant digit that ing and using arithmetic, and simplifies the natural is one of {0, 5}. Because of this, we understand any integer fractions [1, 2, 3]. This observation dates as far back as the mid- ending with -0 or -5 is some multiple x of 5. Decimal is also dle ages, involving luminaries of mathematics such as Blaise an even base: because of this, the multiplication products Pascal [4, 5] and Laplace [6]. Dozens have been used since an- of 2 end in one of {0, 2, 4, 6, 8}. In decimal, we can test for cient times; the Roman usage as “unciæ”[7, 8, 9] strongly affect- evenness and divisibility by 5 simply by examining the last ing systems of currency (12 pence to a shilling) and measure digit of an integer. The number twelve has two additional divisors than ten. 1 2 3 4 5 6 7 8 9 10 In duodecimal, the number 6 behaves much like 5 in the 2 4 6 8 10 12 14 16 18 20 multiplication table. In duodecimal, any product of 6 and an integer x will have a least significant digit that is one of 3 6 9 12 15 18 21 24 27 30 {0, 6}. Like decimal, duodecimal is even, so any product of 4 8 12 16 20 24 28 32 36 40 2 and an integer x will end with one of {0, 2, 4, 6, 8, a}. 5 10 15 20 25 30 35 40 45 50 Because twelve has two more divisors, users of duo- 6 12 18 24 30 36 42 48 54 60 decimal enjoy two other divisor product lines in the multiplication table. Any product 3x will end in one of 7 14 21 28 35 42 49 56 63 70 {0, 3, 6, 9}, and any product 4x will end in one of {0, 4, 8}. 8 16 24 32 40 48 56 64 72 80 Because twelve has six divisors, with the smallest four con- 9 18 27 36 45 54 63 72 81 90 secutive, it presents a multiplication table featuring brief 10 20 30 40 50 60 70 80 90 100 patterns in the product lines of many numbers. (See page 4 for a study of patterns in the decimal and duodecimal mul- Figure 0.1. The decimal multiplication table. tiplication tables and Appendix A for bases 8 ≤ r ≤ 16.) 1 2 3 4 5 6 7 8 9 a b 10 The divisors of a base have a second important effect. Ev- ery divisor d of base r has a complement d′ [10] such that 2 4 6 8 a 10 12 14 16 18 1a 20 3 6 9 10 13 16 19 20 23 26 29 30 (0.1) r = d × d′ 4 8 10 14 18 20 24 28 30 34 38 40 This relationship between a divisor and its complement 5 a 13 18 21 26 2b 34 39 42 47 50 can be seen in the multiplication table: the decimal prod- ucts of five have 2 possible end digits (10 = 5 × 2), the 6 10 16 20 26 30 36 40 46 50 56 60 duodecimal products of four have three possible end digits 7 12 19 24 2b 36 41 48 53 5a 65 70 (12 = 4 × 3). The relationship also appears in digital ex- 8 14 20 28 34 40 48 54 60 68 74 80 pansions of fractions. Generally, 9 16 23 30 39 46 53 60 69 76 83 90 (0.2) 1∕d = d′∕r a 18 26 34 42 50 5a 68 76 84 92 a0 thus we will see the digit d′ following the radix point. In b 1a 29 38 47 56 65 74 83 92 a1 b0 base ten we have 1∕2 = 0.5 and 1∕5 = 0.2. In base twelve we 10 20 30 40 50 60 70 80 90 a0 b0 100 will have 1∕2 = 0.6, 1∕3 = 0.4, 1∕4 = 0.3 and 1∕6 = 0.2. Thus duo- decimal features single-place terminating fractions for all [11, 12] Figure 0.2. The duodecimal multiplication table. the ‘natural fractions’ : Dozenal FAQs · De Vlieger The Dozenal Society of America Page 1 ½ ⅓ ⅔ ¼ ¾ Twelve gives us the ability to access the power of 6 divisors Decimal .5 .333… .666… .25 .75 with a magnitude of number base that is not much larger than decimal. The dozen gives us clean natural fractions, Duodecimal .6 .4 .8 .3 .9 incorporating these into its digital representation. Duo- Figure 0.3. The natural fractions in decimal and duodecimal notation. decimal divisors are by far the very most important reason One might raise the question, “granted, twelve has more divi- why duodecimal is the optimum number base for general sors than ten, but what about the other numbers?” First, let’s human intuitive computation. acknowledge that number bases fit for general human compu- 1. Other then having more factors than 10 does, what other ma- tation must lie in a certain range. If a number base is too small, jor properties make 12 a better base for a number system? we’ll need many digits to express even a relatively small quan- A. Briefly, twelve has proportionally fewer totatives (digits tity. Imagine a binary speed limit sign said “1000000 kph”! A that have 1 as the greatest common divisor with the num- driver would need to slow down and peruse the sign to be sure ber base) than ten, minimizing resistance to human intu- not to be speeding at double or bumbling at half the posted ition in computation and manipulation of numbers. Fewer limit! The seven decimal-digit telephone number would be- totatives means fewer “difficult” product lines in the mul- come nearly a two-dozen-bit string of 1’s and 0’s. It would be tiplication table, fewer occasions of recurrent fractions, a easy to miss out on a hot date if one made a transcription er- more organized arrangement of primes, and a smaller pro- ror somewhere. If a number base is too large, then one would portion of other digits and numbers that have recurrent need to memorize a larger multiplication table, for example, reciprocals. Dozenal has a denser set of regular numbers, in order to perform arithmetic. If the Mayans multiplied us- aiding human intuition in computation. Regular numbers ing modern techniques, would they need to spend more than have terminating digital fractions and divisibility tests akin double the time a decimal society would in mastering their to that of divisors. multiplication tables? There are 20 digits in the vigesimal (base-20) system, each with 20 combinations. There are 55 These features are not as easily summarized as the fact unique products in the decimal multiplication table vs. 210 in that twelve has more divisors than ten, but are just as im- the vigesimal and 78 in the duodecimal. portant. The following pages attempt to explain the brief synopsis above, and prove it using mathematics. The ex- Let’s presume a number base will need to be between about 7 planation can get technical. The terms used in the above or 8 through about 16, possibly including 18 and 20. Here is a [13, 14] synopsis are explained in the following text. Let’s begin by list of divisor counts and ratios for bases 2 through 20: examining the digits of a number base, since many of the r σ (r) σ (r)/r properties can be summarized by such an examination. r σ (r) σ (r)/r 0 0 0 0 11 2 18 2∕11 Five Universal Types of Digits 2 2 100 12 6 50 The digits of a number base are important because a num- 3 2 66 ⅔ 13 2 15 5∕13 ber base “sees” the world through its digits. Let the integer 4 3 75 [19, 14 4 28 4∕7 r ≥ 2 be a number base. A digit is an integer 0 ≤ n < r 5 2 40 20]. Using digits, we can express the arbitrary integer x as a 15 4 26 ⅔ 6 4 66 ⅔ product of the integers q and r plus the digit n [21, 22, 23]: 16 5 31 ¼ 7 2 28 4∕7 17 2 11 15∕17 x = qr + n 8 4 50 18 6 33 ⅓ The digit “0” signifies congruence with the number base; 9 3 33 ⅓ [24] 19 2 10 10∕19 it will be interpreted as signifying r itself as a digit .
Load more

Recommended publications
  • 13054-Duodecimal.Pdf
    Universal Multiple-Octet Coded Character Set International Organization for Standardization Organisation Internationale de Normalisation Международная организация по стандартизации Doc Type: Working Group Document Title: Proposal to encode Duodecimal Digit Forms in the UCS Author: Karl Pentzlin Status: Individual Contribution Action: For consideration by JTC1/SC2/WG2 and UTC Date: 2013-03-30 1. Introduction The duodecimal system (also called dozenal) is a positional numbering system using 12 as its base, similar to the well-known decimal (base 10) and hexadecimal (base 16) systems. Thus, it needs 12 digits, instead of ten digits like the decimal system. It is used by teachers to explain the decimal system by comparing it to an alternative, by hobbyists (see e.g. fig. 1), and by propagators who claim it being superior to the decimal system (mostly because thirds can be expressed by a finite number of digits in a "duodecimal point" presentation). • Besides mathematical and hobbyist publications, the duodecimal system has appeared as subject in the press (see e.g. [Bellos 2012] in the English newspaper "The Guardian" from 2012-12-12, where the lack of types to represent these digits correctly is explicitly stated). Such examples emphasize the need of the encoding of the digit forms proposed here. While it is common practice to represent the extra six digits needed for the hexadecimal system by the uppercase Latin capital letters A,B.C,D,E,F, there is no such established convention regarding the duodecimal system. Some proponents use the Latin letters T and E as the first letters of the English names of "ten" and "eleven" (which obviously is directly perceivable only for English speakers).
    [Show full text]
  • Define Composite Numbers and Give Examples
    Define Composite Numbers And Give Examples Hydrotropic and amphictyonic Noam upheaves so injunctively that Hudson charcoal his nymphomania. immanently,Chase eroding she her shells chorine it transiently. bluntly, tameless and scenographic. Ethan bargees her stalagmometers Transponder much money frank had put up by our counselor will tell the numbers and composite number is called the whole or a number of improved methods capable of To give examples. Similarly, when subtraction is performed, the similar pattern is observed. Explicit Teach section and bill discuss the difference between composite and prime numbers. What bout the difference between a prime number does a composite number. That captures the hour well school is said a job enough definition because it. Cite Nimisha Kaushik Difference Between road and Composite Numbers. Write down the multiplication facts as you do this. When we talk getting the divisors of another prime number we had always talking a natural numbers whole numbers greater than 0 Examples of Prime Numbers 2. But opting out of some of these cookies may have an effect on your browsing experience. All of that the positive integer a paragraph in this is already registered with multiple. Are there for prime numbers? The side number is incorrect. Find our prime factorization of whole numbers. Example 11 is a prime number field the only numbers it quiz be divided by evenly is 1 and 11 What is Composite Number Composite numbers has. Lorem ipsum dolor in a composite and gives you know if you. See more ideas about surface and composite numbers prime and composite 4th grade.
    [Show full text]
  • An Analysis of Primality Testing and Its Use in Cryptographic Applications
    An Analysis of Primality Testing and Its Use in Cryptographic Applications Jake Massimo Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Information Security Royal Holloway, University of London 2020 Declaration These doctoral studies were conducted under the supervision of Prof. Kenneth G. Paterson. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Department of Mathe- matics as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Jake Massimo April, 2020 2 Abstract Due to their fundamental utility within cryptography, prime numbers must be easy to both recognise and generate. For this, we depend upon primality testing. Both used as a tool to validate prime parameters, or as part of the algorithm used to generate random prime numbers, primality tests are found near universally within a cryptographer's tool-kit. In this thesis, we study in depth primality tests and their use in cryptographic applications. We first provide a systematic analysis of the implementation landscape of primality testing within cryptographic libraries and mathematical software. We then demon- strate how these tests perform under adversarial conditions, where the numbers being tested are not generated randomly, but instead by a possibly malicious party. We show that many of the libraries studied provide primality tests that are not pre- pared for testing on adversarial input, and therefore can declare composite numbers as being prime with a high probability.
    [Show full text]
  • The Hexadecimal Number System and Memory Addressing
    C5537_App C_1107_03/16/2005 APPENDIX C The Hexadecimal Number System and Memory Addressing nderstanding the number system and the coding system that computers use to U store data and communicate with each other is fundamental to understanding how computers work. Early attempts to invent an electronic computing device met with disappointing results as long as inventors tried to use the decimal number sys- tem, with the digits 0–9. Then John Atanasoff proposed using a coding system that expressed everything in terms of different sequences of only two numerals: one repre- sented by the presence of a charge and one represented by the absence of a charge. The numbering system that can be supported by the expression of only two numerals is called base 2, or binary; it was invented by Ada Lovelace many years before, using the numerals 0 and 1. Under Atanasoff’s design, all numbers and other characters would be converted to this binary number system, and all storage, comparisons, and arithmetic would be done using it. Even today, this is one of the basic principles of computers. Every character or number entered into a computer is first converted into a series of 0s and 1s. Many coding schemes and techniques have been invented to manipulate these 0s and 1s, called bits for binary digits. The most widespread binary coding scheme for microcomputers, which is recog- nized as the microcomputer standard, is called ASCII (American Standard Code for Information Interchange). (Appendix B lists the binary code for the basic 127- character set.) In ASCII, each character is assigned an 8-bit code called a byte.
    [Show full text]
  • Abstract of Counting Systems of Papua New Guinea and Oceania
    Abstract of http://www.uog.ac.pg/glec/thesis/ch1web/ABSTRACT.htm Abstract of Counting Systems of Papua New Guinea and Oceania by Glendon A. Lean In modern technological societies we take the existence of numbers and the act of counting for granted: they occur in most everyday activities. They are regarded as being sufficiently important to warrant their occupying a substantial part of the primary school curriculum. Most of us, however, would find it difficult to answer with any authority several basic questions about number and counting. For example, how and when did numbers arise in human cultures: are they relatively recent inventions or are they an ancient feature of language? Is counting an important part of all cultures or only of some? Do all cultures count in essentially the same ways? In English, for example, we use what is known as a base 10 counting system and this is true of other European languages. Indeed our view of counting and number tends to be very much a Eurocentric one and yet the large majority the languages spoken in the world - about 4500 - are not European in nature but are the languages of the indigenous peoples of the Pacific, Africa, and the Americas. If we take these into account we obtain a quite different picture of counting systems from that of the Eurocentric view. This study, which attempts to answer these questions, is the culmination of more than twenty years on the counting systems of the indigenous and largely unwritten languages of the Pacific region and it involved extensive fieldwork as well as the consultation of published and rare unpublished sources.
    [Show full text]
  • 2 1 2 = 30 60 and 1
    Math 153 Spring 2010 R. Schultz SOLUTIONS TO EXERCISES FROM math153exercises01.pdf As usual, \Burton" refers to the Seventh Edition of the course text by Burton (the page numbers for the Sixth Edition may be off slightly). Problems from Burton, p. 28 3. The fraction 1=6 is equal to 10=60 and therefore the sexagesimal expression is 0;10. To find the expansion for 1=9 we need to solve 1=9 = x=60. By elementary algebra this means 2 9x = 60 or x = 6 3 . Thus 6 2 1 6 40 1 x = + = + 60 3 · 60 60 60 · 60 which yields the sexagsimal expression 0; 10; 40 for 1/9. Finding the expression for 1/5 just amounts to writing this as 12/60, so the form here is 0;12. 1 1 30 To find 1=24 we again write 1=24 = x=60 and solve for x to get x = 2 2 . Now 2 = 60 and therefore we can proceed as in the second example to conclude that the sexagesimal form for 1/24 is 0;2,30. 1 One proceeds similarly for 1/40, solving 1=40 = x=60 to get x = 1 2 . Much as in the preceding discussion this yields the form 0;1,30. Finally, the same method leads to the equation 5=12 = x=60, which implies that 5/12 has the sexagesimal form 0;25. 4. We shall only rewrite these in standard base 10 fractional notation. The answers are in the back of Burton. (a) The sexagesimal number 1,23,45 is equal to 1 3600 + 23 60 + 45.
    [Show full text]
  • Duodecimalbulletinissue521.Pdf
    The Duodecimal Bulletin THETHE DuodecimalDuodecimal BulletinBulletin Vol. 52z (62d), No. 1 • July 11EEz (2015d) • Volume 52 z (62 d ), Number 1 • Whole Number X 2 z (122 d ) • July 11 Base Annotation Schemes Whole Number EE z (2015 X d ) z (122 ) ISSN 0046-0826d 2d X ETY Volume Five Dozen Two (52z) Number 1 Whole Number Ten Dozen Two ( 2z) CI O The Dozenal Society of America • • O F is a voluntary, nonprofit corporation, organized to S E 0 1 A L conduct research and educate the public in the use X 2 M The DuodecimalDuodecimal A of base twelve in calculations, mathematics, weights DuodecimalDuodecimalDuodecimal 9 3 E N R and measures, and other branches of pure and ap- E 8 4 I Bulletin Z BulletinBulletin C BulletinBulletin 7 5 plied science. BulletinBulletinBulletinBulletin A O 6 D Volume Sixty Two (62 ) Number 1 Whole No. One Hundred Twenty Two (122 ) d • • d S Basic membership is free, but as a nonprofit we de- pend upon the generosity of our members to continue operating. An annual subscription of US$18.00d B Table of Contents C The Duodecimal Bulletin (US$16.00z) entitles the member to delivery of pa- is an official publication of: per copies of The Duodecimal Bulletin. President’s Message by Donald Goodman ....................................................2z Officers The Dozenal Society Editorial: Radically Conventional ..................................3z Board Chair Jay Schiffman of America, Inc. New Members ...........................................................7z 13510 Photo Drive President Donald Goodman Accuracy of Common Roundings Vice President Graham Steele Woodbridge, VA 22193 by Donald Goodman ....................................................8z Secretary Jen Seron Base Annotation Schemes Treasurer Jay Schiffman Founded: 1160z (1944d) by John Volan.........................................................10z Patterns and Palatable Morsels in Duodecimal Official Website: Board of Directors by Prof.
    [Show full text]
  • Number Theory.Pdf
    Number Theory Number theory is the study of the properties of numbers, especially the positive integers. In this exercise, you will write a program that asks the user for a positive integer. Then, the program will investigate some properties of this number. As a guide for your implementation, a skeleton Java version of this program is available online as NumberTheory.java. Your program should determine the following about the input number n: 1. See if it is prime. 2. Determine its prime factorization. 3. Print out all of the factors of n. Also count them. Find the sum of the proper factors of n. Note that a “proper” factor is one that is less than n itself. Once you know the sum of the proper factors, you can classify n as being abundant, deficient or perfect. 4. Determine the smallest positive integer factor that would be necessary to multiply n by in order to create a perfect square. 5. Verify the Goldbach conjecture: Any even positive integer can be written as the sum of two primes. It is sufficient to find just one such pair. Here is some sample output if the input value is 360. Please enter a positive integer n: 360 360 is NOT prime. Here is the prime factorization of 360: 2 ^ 3 3 ^ 2 5 ^ 1 Here is a list of all the factors: 1 2 3 4 5 6 8 9 10 12 15 18 20 24 30 36 40 45 60 72 90 120 180 360 360 has 24 factors. The sum of the proper factors of 360 is 810.
    [Show full text]
  • Ramanujan, Robin, Highly Composite Numbers, and the Riemann Hypothesis
    Contemporary Mathematics Volume 627, 2014 http://dx.doi.org/10.1090/conm/627/12539 Ramanujan, Robin, highly composite numbers, and the Riemann Hypothesis Jean-Louis Nicolas and Jonathan Sondow Abstract. We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical background of our subject. The second part is on its history, which includes several surprises. 1. Mathematical Background Definition. The sum-of-divisors function σ is defined by 1 σ(n):= d = n . d d|n d|n In 1913, Gr¨onwall found the maximal order of σ. Gr¨onwall’s Theorem [8]. The function σ(n) G(n):= (n>1) n log log n satisfies lim sup G(n)=eγ =1.78107 ... , n→∞ where 1 1 γ := lim 1+ + ···+ − log n =0.57721 ... n→∞ 2 n is the Euler-Mascheroni constant. Gr¨onwall’s proof uses: Mertens’s Theorem [10]. If p denotes a prime, then − 1 1 1 lim 1 − = eγ . x→∞ log x p p≤x 2010 Mathematics Subject Classification. Primary 01A60, 11M26, 11A25. Key words and phrases. Riemann Hypothesis, Ramanujan’s Theorem, Robin’s Theorem, sum-of-divisors function, highly composite number, superabundant, colossally abundant, Euler phi function. ©2014 American Mathematical Society 145 This is a free offprint provided to the author by the publisher. Copyright restrictions may apply. 146 JEAN-LOUIS NICOLAS AND JONATHAN SONDOW Figure 1. Thomas Hakon GRONWALL¨ (1877–1932) Figure 2. Franz MERTENS (1840–1927) Nowwecometo: Ramanujan’s Theorem [2, 15, 16].
    [Show full text]
  • Generation of Pseudoprimes Section 1:Introduction
    Generation of Pseudoprimes Danielle Stewart Swenson College of Science and Engineering University of Minnesota [email protected] Section 1:Introduction: Number theory is a branch of mathematics that looks at the many properties of integers. The properties that are looked at in this paper are specifically related to pseudoprime numbers. Positive integers can be partitioned into three distinct sets. The unity, composites, and primes. It is much easier to prove that an integer is composite compared to proving primality. Fermat’s Little Theorem p If p is prime and a is any integer, then a − a is divisible by p. This theorem is commonly used to determine if an integer is composite. If a number does not pass this test, it is shown that the number must be composite. On the other hand, if a number passes this test, it does not prove this integer is prime (Anderson & Bell, 1997) . An example 5 would be to let p = 5 and let a = 2. Then 2 − 2 = 32 − 2 = 30 which is divisible by 5. Since p = 5 5 is prime, we can choose any a as a positive integer and a − a is divisible by 5. Now let p = 4 and 4 a = 2 . Then 2 − 2 = 14 which is not divisible by 4. Using this theorem, we can quickly see if a number fails, then it must be composite, but if it does not fail the test we cannot say that it is prime. This is where pseudoprimes come into play. If we know that a number n is composite but n n divides a − a for some positive integer a, we call n a pseudoprime.
    [Show full text]
  • Ternary and Senary Representations Using DNA Double-Crossover Tiles
    Ternary and senary representations using DNA double-crossover tiles Byeonghoon Kim1,5, Soojin Jo2,5, Junyoung Son1,5, Junghoon Kim1,5, Min Hyeok Kim2, Si Un Hwang1, Sreekantha Reddy Dugasani1, Byung-Dong Kim3, Wing Kam Liu4, Moon Ki Kim2,6 and Sung Ha Park1,6 1 Sungkyunkwan Advanced Institute of Nanotechnology (SAINT) and Department of Physics, Sungkyunkwan University, Suwon 440-746, Korea 2 Sungkyunkwan Advanced Institute of Nanotechnology (SAINT) and School of Mechanical Engineering, Sungkyunkwan University, Suwon 440-746, Korea 3 Department of Plant Science and Plant Genomics and Breeding Institute, Seoul National University, Seoul 151-921, Korea 4 Department of Mechanical Engineering, Northwestern University, Evanston, IL 60208, USA 5 These authors contributed equally. 6 Address for correspondence: School of Mechanical Engineering, Sungkyunkwan University, Suwon 440-746, Korea (MKK) or Department of Physics, Sungkyunkwan University, Suwon 440-746, Korea (SHP). E-mails: [email protected] (MKK) and [email protected] (SHP) Abstract. The information capacity of DNA double-crossover (DX) tiles was successfully increased beyond a binary representation to higher base representations. By controlling the length and the position of DNA hairpins on the DX tile, ternary and senary (base-3 and base-6) digit representations were realized and verified by atomic force microscopy (AFM). Also, normal mode analysis (NMA) was carried out to study the mechanical characteristics of each structure. Online supplementary data available from stacks.iop.org/Nano/XX/XXXXXX/mmedia 1 DNA tiles have played a central role in the development of DNA nanotechnology. Of the many types of tiles created to date [1-8], one of the most versatile has been the double-crossover (DX) tile, having been used in a multitude of ways, from constructing one-, two-, and quasi-two-dimensional lattices [9- 11] to creating space-time representations of algorithms by acting as Wang tiles [12-15].
    [Show full text]
  • History of Binary and Other Nondecimal Numeration
    HISTORY OF BINARY AND OTHER NONDECIMAL NUMERATION BY ANTON GLASER Professor of Mathematics, Pennsylvania State University TOMASH PUBLISHERS Copyright © 1971 by Anton Glaser Revised Edition, Copyright 1981 by Anton Glaser All rights reserved Printed in the United States of America Library of Congress Cataloging in Publication Data Glaser, Anton, 1924- History of binary and other nondecimal numeration. Based on the author's thesis (Ph. D. — Temple University), presented under the title: History of modern numeration systems. Bibliography: p. 193 Includes Index. 1. Numeration — History. I. Title QA141.2.G55 1981 513'.5 81-51176 ISBN 0-938228-00-5 AACR2 To My Wife, Ruth ACKNOWLEDGMENTS THIS BOOK is based on the author’s doctoral dissertation, History of Modern Numeration Systems, written under the guidance of Morton Alpren, Sara A. Rhue, and Leon Steinberg of Temple University in Philadelphia, Pa. Extensive help was received from the libraries of the Academy of the New Church (Bryn Athyn, Pa.), the American Philosophical Society, Pennsylvania State University, Temple University, the University of Michigan, and the University of Pennsylvania. The photograph of Figure 7 was made available by the New York Public Library; the library of the University of Pennsylvania is the source of the photographs in Figures 2 and 6. The author is indebted to Harold Hanes, Joseph E. Hofmann, Donald E. Knuth, and Brian J. Winkel, who were kind enough to communicate their comments about the strengths and weaknesses of the original edition. The present revised edition is the better for it. A special thanks is also owed to John Wagner for his careful editorial work and to Adele Clark for her thorough preparation of the Index.
    [Show full text]