DOCSLIB.ORG

Notes - Unit 4

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Notes - Unit 4 ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-278: Digital Logic Design Fall 2016 Notes - Unit 4 UNSIGNED INTEGER NUMBERS DECIMAL NUMBER SYSTEM DIGIT . A decimal digit can take values from 0 to 9: 0 1 2 3 4 5 6 7 8 9 . Digit-by-digit representation of a positive integer number (powers of 10): Number: 9372 hundreds tens thousands units 9 3 7 2 9 thousands, 3 hundreds, 7 tens, and 2 units 103 102 101 100 9372 = 9×103 + 3×102 + 7×101 + 2×100 POSITIONAL NUMBER REPRESENTATION . Let’s consider the numbers from 0 to 999. We represent these numbers with 3 digits (each digit being a number between 0 and 9). We show a 3-digit number using the positional number representation: MATHEMATICAL REPRESENTATION EXAMPLE 3-digit d2 d1 d0 2 0 9 Third Digit Second Digit First Digit Third Digit Second Digit First Digit 2 1 . The positional number representation allows us to express the decimal value using powers of ten: 푑2 × 10 + 푑1 × 10 + 0 푑0 × 10 . Example: Decimal 3-digit representation Powers of 10: 2 1 0 Number d2d1d0 d2 10 + d1 10 + d0 10 0 000 0 102 + 0 101 + 0 100 9 009 0 102 + 0 101 + 9 100 2 1 0 11 011 0 10 + 1 10 + 1 10 2 1 0 25 025 0 10 + 2 10 + 5 10 90 090 0 102 + 9 101 + 0 100 128 128 1 102 + 2 101 + 8 100 2 1 0 255 255 2 10 + 5 10 + 5 10 Exercise: Write down the 3-digit and the powers of ten representations for the following numbers: 2 1 0 Decimal Number 3-digit representation 푑2 × 10 + 푑1 × 10 + 푑0 × 10 5 254 100 99 1 Instructor: Daniel Llamocca ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-278: Digital Logic Design Fall 2016 General Case: . Positional number representation for an integer positive number with 푛 digits: dn-1dn-2 ... d1d0 Decimal Value: 푖=푛−1 푖 푛−1 푛−2 1 0 퐷 = ∑ 푑푖 × 10 = 푑푛−1 × 10 + 푑푛−2 × 10 + ⋯ + 푑1 × 10 + 푑0 × 10 푖=0 . Example: 1098324 (7 digits). 1098324 1106 0 105 9 104 8 103 3102 2 101 4 100 203476 (6 digits). 203476 2 105 0 104 3103 4 102 7 101 6 100 Maximum value: . The table presents the maximum attainable value for a given number of digits. What pattern do you find? Can you complete it for the highlighted cases (4 and 6)? Number of digits Maximum value Range 1 9 = 101-1 0 9 0 101-1 2 99 = 102-1 0 99 0 102-1 3 999 = 103-1 0 999 0 103-1 4 5 99999 = 105-1 0 99999 0 105-1 6 … n 999…999 = 10n-1 0 999…999 0 10n-1 . Maximum value for a number with ‘n’ digits: Based on the table, the maximum decimal value for a number with ‘n’ digits is given by: n-1 n-2 1 0 n D = 999...999 = 9 10 + 9 10 + ... + 9 10 + 9 10 = 10 -1 n digits With ‘n’ digits, we can represent 10n positive integer numbers from 0 to 10n-1. With 7 digits, what is the range (starting from 0) of positive numbers that we can represent? How many different numbers can we represent? BINARY NUMBER SYSTEM . We are used to the decimal number system. However, there exist other number DIGIT BIT systems: octal, hexadecimal, vigesimal, binary, etc. In particular, binary numbers are very practical as they are used by digital computers. For binary numbers, the counterpart of the decimal digit (that can take values from 0 to 9) 0 1 2 3 4 5 6 7 8 9 0 1 is the binary digit, or bit (that can take the value of 0 or 1). Bit: Unit of information that a computer uses to process and retrieve data. It can also be used as a Boolean variable (see Unit 1). Binary number: This is represented by a string of bits using the positional number representation: 푏푛−1푏푛−2 … 푏1푏0 . Converting a binary number into a decimal number: The following figure depicts two cases: 2-bit numbers and 3-bit numbers. Note that the positional representation with powers of two let us obtain the decimal value (integer positive) of the binary number. 2 Instructor: Daniel Llamocca ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-278: Digital Logic Design Fall 2016 Binary number Powers of 2: Decimal MATHEMATICAL REPRESENTATION b b b 21 + b 20 1 0 1 0 Number 2-bit 1 0 b b 00 0 2 + 0 2 0 1 0 01 0 21 + 1 20 1 1 0 10 1 2 + 0 2 2 1 0 Second Bit First Bit 11 1 2 + 1 2 3 Binary number Powers of 2: Decimal 2 1 0 b2b1b0 b2 2 + b1 2 + b0 2 Number 000 0 22 + 0 21 + 0 20 0 MATHEMATICAL REPRESENTATION 001 0 22 + 0 21 + 1 20 1 3-bit 2 1 0 b b b 010 0 2 + 1 2 + 0 2 2 2 1 0 011 0 22 + 1 21 + 1 20 3 100 1 22 + 0 21 + 0 20 4 2 1 0 Third Bit Second Bit First Bit 101 1 2 + 0 2 + 1 2 5 110 1 22 + 1 21 + 0 20 6 2 1 0 111 1 2 + 1 2 + 1 2 7 General case: . Positional number representation for a binary number with ‘n’ bits: b b ... b b n-1 n-2 1 0 Most significant Least significant (leftmost) bit (rightmost) bit The binary number can be converted to a positive decimal number by using the following formula: 푖=푛−1 푖 푛−1 푛−2 1 0 퐷 = ∑ 푏푖 × 2 = 푏푛−1 × 2 + 푏푛−2 × 2 + ⋯ + 푏1 × 2 + 푏0 × 2 푖=0 . To avoid confusion, we usually write a binary number and attach a suffix ‘2’: (푏푛−1푏푛−2 … 푏1푏0)2 5 4 3 2 1 0 . Example: 6 푏푡푠: (101011)2 ≡ 퐷 = 1 × 2 + 0 × 2 + 1 × 2 + 0 × 2 + 1 × 2 + 1 × 2 = 43 3 2 1 0 4 푏푡푠: (1011)2 ≡ 퐷 = 1 × 2 + 0 × 2 + 1 × 2 + 1 × 2 = 11 . Maximum value for a given number of bits. Complete the tables for the highlighted cases (4 and 6): Number of bits Maximum value Range 1 1 1 12 2 -1 0 12 0 2 -1 2 2 2 112 2 -1 0 112 0 2 -1 3 3 3 1112 2 -1 0 1112 0 2 -1 4 5 5 5 111112 2 -1 0 111112 0 2 -1 6 … n n n 111…1112 2 -1 0 111…1112 0 2 -1 . Maximum value for ‘n’ bits: The maximum binary number is given by an n-bit string of 1’s: 111…111. Then, the maximum decimal numbers is given by: n-1 n-2 1 0 n D = 111...111 = 1 2 + 1 2 + ... + 1 2 + 1 2 = 2 -1 n bits With ‘n’ bits, we can represent 2n positive integer numbers from 0 to 2n-1. 3 Instructor: Daniel Llamocca ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-278: Digital Logic Design Fall 2016 . The case n=8 bits is of particular interest, as a string of 8 bits is called a byte. For 8-bit numbers, we have 256 numbers in the range 0 to 28-1 0 to 255. b b b b b b b7 6 5 4 3 2 1b0 Most significant Least significant (leftmost) bit (rightmost) bit . The table shows some examples: 8-bit format Decimal 7 6 5 4 3 2 1 0 b b b b b b d d b7 2 + b6 2 + b5 2 + b4 2 + b3 2 + b2 2 + b1 2 + b0 2 Number 7 6 5 4 3 2 1 0 0 00000000 0 27 + 0 26 + 0 25 + 0 24 + 0 23 + 0 22 + 0 21 + 0 20 9 00001001 0 27 + 0 26 + 0 25 + 0 24 + 1 23 + 0 22 + 0 21 + 1 20 11 00001011 0 27 + 0 26 + 0 25 + 0 24 + 1 23 + 0 22 + 1 21 + 1 20 25 00011001 0 27 + 0 26 + 0 25 + 1 24 + 1 23 + 0 22 + 0 21 + 1 20 90 01011010 0 27 + 1 26 + 0 25 + 1 24 + 1 23 + 0 22 + 1 21 + 0 20 128 10000000 1 27 + 0 26 + 0 25 + 0 24 + 0 23 + 0 22 + 0 21 + 0 20 255 11111111 1 27 + 1 26 + 1 25 + 1 24 + 1 23 + 1 22 + 1 21 + 1 20 Exercise: Convert the following binary numbers (positive integers) to their decimal values: Decimal 8-bit representation 푏 × 27 + 푏 × 26 + 푏 × 25 + 푏 × 24 + 푏 × 23 + 푏 × 22 + 푏 × 21 + 푏 × 20 7 6 5 4 3 2 1 0 Number 00000001 00001001 10000101 10000111 11110011 CONVERSION OF A NUMBER IN ANY BASE TO THE DECIMAL SYSTEM . To convert a number of base 'r' (r = 2, 3,4 ,…) to decimal, we use the following formula: Number in base 'r': (푟푛−1푟푛−2 … 푟1푟0)푟 Conversion to decimal: 푖=푛−1 푖 푛−1 푛−2 1 0 퐷 = ∑ 푟푖 × 푟 = 푟푛−1 × 푟 + 푟푛−2 × 푟 + ⋯ + 푟1 × 푟 + 푟0 × 푟 푖=0 Also, the maximum decimal value for a number in base 'r' with 'n' digits is: 푛−1 푛−2 1 0 푛 퐷 = 푟푟푟 … 푟푟푟 = 푟 × 푟 + 푟푛−2 × 푟 + ⋯ + 푟 × 푟 + 푟 × 푟 = 푟 − 1 . Example: Base-8: Number of digits Maximum value Range 1 1 1 78 8 -1 0 78 0 8 -1 2 2 2 778 8 -1 0 778 0 8 -1 3 3 3 7778 8 -1 0 7778 0 8 -1 … n n n 777…7778 8 -1 0 777…7778 0 8 -1 Examples: .
Load more

Recommended publications
  • Vigesimal Numerals on Ifẹ̀ (Togo) and Ifẹ̀ (Nigeria) Dialects of Yorùbá
    Vigesimal Numerals on Ifẹ̀ (Togo) and Ifẹ̀ (Nigeria) Dialects of Yorùbá Felix Abídèmí Fábùnmi (Ilé-Ifẹ̀) Abstract This study intends to bring Ifẹ̀ (Togo) into a linguistic limelight using the numeral systems. Numerals are a very important aspect of the day to day socio-economic and linguistic life of Ifẹ̀ (Togo) people. The traditional Ifẹ̀ (Togo) number system is vigesimal. In this study, forty- two different number words are listed for Yorùbá Ifẹ̀ (Nigeria) and Yorùbá Ifẹ̀ (Togo) and compared with Standard Yorùbá. We compared the Ifẹ̀ (Togo) number words and counting patterns with that of the Standard Yorùbá and Ifẹ̀ (Nigeria) and discovered that, by the nature of the components of these numbers, majority of the basic number words are either bisyllabic or trisyllabic, each syllable having the form VCV for the cardinals, and CVCV for the ordinals. There are irregularities in tonality; there are also alternations in the sequences of the vowel (oral and nasalized) and consonant sounds. This work finds out that Ifẹ̀ (Togo) has two counting patterns. In the first pattern, it uses addition solely to derive the number words but with a counting pattern where 'ten', 'twenty' and the added number units are taken as a whole. In the second counting pattern, subtraction is used to derive number words but this is applicable only to three numbers i. e. seventeen – /mɛ́ɛtadínóɡú/, eighteen – /méèʤìdínóɡu/ and nineteen – /mɔ̀kɔ̃dínoɡ́ u/. The Ifẹ̀ (Togo) dialect of Yorùbá mostly uses additive number positions. The dialect favours additive number positions more than the subtractive and the multiplicative positions. In other words, higher numbers are frequently used as bases for addition not as bases for multiplication in Ifẹ̀ (Togo).
    [Show full text]
  • Bits, Data Types, and Operations
    Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Agenda 1. Data Types 2. Unsigned & Signed Integers 3. Arithmetic Operations Chapter 2 4. Logical Operations 5. Shifting Bits, Data Types, 6. Hexadecimal & Octal Notation and Operations 7. Other Data Types COMPSCI210 S1C 2009 2 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1. Data Types Computer is a binary digital system. How do we represent data in a computer? Digital system: Binary (base two) system: At the lowest level, a computer is an electronic machine. • finite number of symbols • has two states: 0 and 1 • works by controlling the flow of electrons Easy to recognize two conditions: 1. presence of a voltage – we’ll call this state “1” 2. absence of a voltage – we’ll call this state “0” Basic unit of information is the binary digit, or bit. Values with more than two states require multiple bits. • A collection of two bits has four possible states: Could base state on value of voltage, 00, 01, 10, 11 but control and detection circuits more complex. • A collection of three bits has eight possible states: • compare turning on a light switch to 000, 001, 010, 011, 100, 101, 110, 111 measuring or regulating voltage • A collection of n bits has 2n possible states. COMPSCI210 S1C 2009 3 COMPSCI210 S1C 2009 4 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
    [Show full text]
  • 1. Understanding Decimal, Binary, Octal and Hexadecimal Numbers
    Objectives: 1. Understanding decimal, binary, octal and hexadecimal numbers. 2. Counting in decimal, binary, octal and hexadecimal systems. 3. Convert a number from one number system to another system. 4. Advantage of octal and hexadecimal systems. 1. Understanding decimal, binary, octal and hexadecimal numbers Decimal number systems: Decimal numbers are made of decimal digits: (0,1,2,3,4,5,6,7,8,9 --------10-base system) The decimal system is a "positional-value system" in which the value of a digit depends on its position. Examples: 453→4 hundreds, 5 tens and 3 units. 4 is the most weight called "most significant digit" MSD. 3 carries the last weight called "least significant digit" LSD. number of items that a decimal number represent: 9261= (9× )+(2× )+(6× )+(1× ) The decimal fractions: 3267.317= (3× )+(2× )+(6× )+(7× )+ (3× ) + (6× ) + (1× ) Decimal point used to separate the integer and fractional part of the number. Formal notation→ . Decimal position values of powers of (10). Positional values "weights" 2 7 7 8 3 . 2 3 4 5 MSD LSD Binary numbers: . Base-2 system (0 or 1). We can represent any quantity that can be represented in decimal or other number systems using binary numbers. Binary number is also positional–value system (power of 2). Example: 1101.011 1 1 0 1 . 0 1 1 MSD LSD Notes: . To find the equivalent of binary numbers in decimal system , we simply take the sum of products of each digit value (0,1)and its positional value: Example: = (1× ) + (0× ) + (1× ) + (1× )+ (1× )+ (0× ) +(1× ) = 8 + 0 + 2 + 1 + + 0 + = In general, any number (decimal, binary, octal and hexadecimal) is simply the sum of products of each digit value and its positional value.
    [Show full text]
  • Chapter 6 MISCELLANEOUS NUMBER BASES. the QUINARY
    The Number Concept: Its Origin and Development By Levi Leonard Conant Ph. D. Chapter 6 MISCELLANEOUS NUMBER BASES. THE QUINARY SYSTEM. The origin of the quinary mode of counting has been discussed with some fulness in a preceding chapter, and upon that question but little more need be said. It is the first of the natural systems. When the savage has finished his count of the fingers of a single hand, he has reached this natural number base. At this point he ceases to use simple numbers, and begins the process of compounding. By some one of the numerous methods illustrated in earlier chapters, he passes from 5 to 10, using here the fingers of his second hand. He now has two fives; and, just as we say “twenty,” i.e. two tens, he says “two hands,” “the second hand finished,” “all the fingers,” “the fingers of both hands,” “all the fingers come to an end,” or, much more rarely, “one man.” That is, he is, in one of the many ways at his command, saying “two fives.” At 15 he has “three hands” or “one foot”; and at 20 he pauses with “four hands,” “hands and feet,” “both feet,” “all the fingers of hands and feet,” “hands and feet finished,” or, more probably, “one man.” All these modes of expression are strictly natural, and all have been found in the number scales which were, and in many cases still are, in daily use among the uncivilized races of mankind. In its structure the quinary is the simplest, the most primitive, of the natural systems.
    [Show full text]
  • Number Systems and Number Representation Aarti Gupta
    Number Systems and Number Representation Aarti Gupta 1 For Your Amusement Question: Why do computer programmers confuse Christmas and Halloween? Answer: Because 25 Dec = 31 Oct -- http://www.electronicsweekly.com 2 Goals of this Lecture Help you learn (or refresh your memory) about: • The binary, hexadecimal, and octal number systems • Finite representation of unsigned integers • Finite representation of signed integers • Finite representation of rational numbers (if time) Why? • A power programmer must know number systems and data representation to fully understand C’s primitive data types Primitive values and the operations on them 3 Agenda Number Systems Finite representation of unsigned integers Finite representation of signed integers Finite representation of rational numbers (if time) 4 The Decimal Number System Name • “decem” (Latin) => ten Characteristics • Ten symbols • 0 1 2 3 4 5 6 7 8 9 • Positional • 2945 ≠ 2495 • 2945 = (2*103) + (9*102) + (4*101) + (5*100) (Most) people use the decimal number system Why? 5 The Binary Number System Name • “binarius” (Latin) => two Characteristics • Two symbols • 0 1 • Positional • 1010B ≠ 1100B Most (digital) computers use the binary number system Why? Terminology • Bit: a binary digit • Byte: (typically) 8 bits 6 Decimal-Binary Equivalence Decimal Binary Decimal Binary 0 0 16 10000 1 1 17 10001 2 10 18 10010 3 11 19 10011 4 100 20 10100 5 101 21 10101 6 110 22 10110 7 111 23 10111 8 1000 24 11000 9 1001 25 11001 10 1010 26 11010 11 1011 27 11011 12 1100 28 11100 13 1101 29 11101 14 1110 30 11110 15 1111 31 11111 ..
    [Show full text]
  • 1 Evolution and Base Conversion
    Indian Institute of Information Technology Design and Manufacturing, Kancheepuram logo.png Chennai { 600 127, India Instructor An Autonomous Institute under MHRD, Govt of India N.Sadagopan http://www.iiitdm.ac.in Computational Engineering Objectives: • To learn to work with machines (computers, ATMs, Coffee vending machines). • To understand how machines think and work. • To design instructions which machines can understand so that a computational task can be performed. • To learn a language which machines can understand so that human-machine interaction can take place. • To understand the limitations of machines: what can be computed and what can not be computed using machines. Outcome: To program a computer for a given computational task involving one or more of arithmetic, algebraic, logical, relational operations. 1 Evolution and Base Conversion Why Machines ? We shall now discuss the importance of automation; human-centric approach (manual) versus machines. Although machines are designed by humans, for many practical reasons, machines are superior to humans as far as problem solving is concerned. We shall highlight below commonly observed features that make machines powerful. • Reliable, accurate and efficient. • Can do parallel tasks if trained. • Efficient while peforming computations with large numbers. If designed correctly, then there is no scope for error. • Good at micro-level analysis with precision. • Consistent It is important to highlight that not all problems can be solved using machines (computers). For example, (i) whether a person is happy (ii) whether a person is lying (not speaking the truth) (iii) reciting the natural number set (iv) singing a song in a particular raga. Computer: A computational machine In this lecture, we shall discuss a computational machine called computer.
    [Show full text]
  • About Numbers How These Basic Tools Appeared and Evolved in Diverse Cultures by Allen Klinger, Ph.D., New York Iota ’57
    About Numbers How these Basic Tools Appeared and Evolved in Diverse Cultures By Allen Klinger, Ph.D., New York Iota ’57 ANY BIRDS AND Representation of quantity by the AUTHOR’S NOTE insects possess a The original version of this article principle of one-to-one correspondence 1 “number sense.” “If is on the web at http://web.cs.ucla. was undoubtedly accompanied, and per- … a bird’s nest con- edu/~klinger/number.pdf haps preceded, by creation of number- mtains four eggs, one may be safely taken; words. These can be divided into two It was written when I was a fresh- but if two are removed, the bird becomes man. The humanities course had an main categories: those that arose before aware of the fact and generally deserts.”2 assignment to write a paper on an- the concept of number unrelated to The fact that many forms of life “sense” thropology. The instructor approved concrete objects, and those that arose number or symmetry may connect to the topic “number in early man.” after it. historic evolution of quantity in differ- At a reunion in 1997, I met a An extreme instance of the devel- classmate from 1954, who remem- ent human societies. We begin with the bered my paper from the same year. opment of number-words before the distinction between cardinal (counting) As a pack rat, somehow I found the abstract concept of number is that of the numbers and ordinal ones (that show original. Tsimshian language of a tribe in British position as in 1st or 2nd).
    [Show full text]
  • Curiosities Regarding the Babylonian Number System
    Curiosities Regarding the Babylonian Number System Sherwin Doroudi April 12, 2007 By 2000 bce the Babylonians were already making significant progress in the areas of mathematics and astronomy and had produced many elaborate mathematical tables on clay tablets. Their sexagecimal (base-60) number system was originally inherited from the Sumerian number system dating back to 3500 bce. 1 However, what made the Babylonian number system superior to its predecessors, such as the Egyptian number system, was the fact that it was a positional system not unlike the decimal system we use today. This innovation allowed for the representation of numbers of virtually any size by reusing the same set of symbols, while also making it easier to carry out arithmetic operations on larger numbers. Its superiority was even clear to later Greek astronomers, who would use the sexagecimal number system as opposed to their own native Attic system (the direct predecessor to Roman numerals) when making calculations with large numbers. 2 Most other number systems throughout history have made use of a much smaller base, such as five (quinary systems), ten (decimal systems), or in the case of the Mayans, twenty (vigesimal systems), and such choices for these bases are all clearly related to the fingers on the hands. The choice (though strictly speaking, it's highly unlikely that any number system was directly \chosen") of sixty is not immediately apparent, and at first, it may even seem that sixty is a somewhat large and unwieldy number. Another curious fact regarding the ancient number system of the Babylonians is that early records do not show examples of a \zero" or null place holder, which is an integral part of our own positional number system.
    [Show full text]
  • Conversion from Decimal There Is a Simple Method That Allows Conversions from the Decimal to a Target Number System
    APPENDICES A Number Systems This appendix introduces background material on various number systems and representations. We start the appendix with a discussion of various number systems, including the binary and hexadecimal systems. When we use multiple number systems, we need to convert numbers from system to another We present details on how such number conversions are done. We then give details on integer representations. We cover both unsigned and signed integer representations. We close the appendix with a discussion of the floating-point numbers. Positional Number Systems The number systems that we discuss here are based on positional number systems. The decimal number system that we are already familiar with is an example of a positional number system. In contrast, the Roman numeral system is not a positional number system. Every positional number system has a radix or base, and an alphabet. The base is a positive number. For example, the decimal system is a base-10 system. The number of symbols in the alphabet is equal to the base of the number system. The alphabet of the decimal system is 0 through 9, a total of 10 symbols or digits. In this appendix, we discuss four number systems that are relevant in the context of computer systems and programming. These are the decimal (base-10), binary (base-2), octal (base-8), and hexadecimal (base-16) number systems. Our intention in including the familiar decimal system is to use it to explain some fundamental concepts of positional number systems. Computers internally use the binary system. The remaining two number systems—octal and hexadecimal—are used mainly for convenience to write a binary number even though they are number systems on their own.
    [Show full text]
  • Altaic Numerals
    102 ALTAIC NUMERALS For Karl H. Menges to his 90th birthday (April 22,1998) The Altaic hypothesis supposes a genetic relationship of Turkic, Mongo­ lian, Tungus, Korean and Japanese. One of the most frequent arguments of its opponents (Clauson, Scerbak) is based on an imaginary absence of common numerals. The presence of common (= inherited) numerals represents certainly an important argument for a genetic relationship. But its absence has no de­ claring value — there are more safely related languages without any related numerals. The recent progress in a comparative historical phonology of Altaic languages allows to identify more inherited numerals and to differentiate them from the numerals of substratal or adstratal origin. The most promising set of regular correspondences among Altaic branches and the reconstruction of the Proto-Altaic consonantism was made by Sta- rostin (1986: 104 and 1991: 21) and Vovin (1994: 100): Rule Proto- Proto-Tuikic Common Proto- Middle Proto-Japanese - Altaic Mongolian Tungus Korean 1. V *0-,*-p- V > h-, -b- *P p-.p(h) *P 2. *p *b h-, -r-/-w- *p-. *-b- p-, -w- */>-, -m- 3. *b *b b-,-y- *b-, *-w- P *p/*b(-m-/-r-) 4. *-w- *-b-/*-0- -b-l-y- *-w/*-y-•0- / *-0- 5. *m *b-, *m m *m m *m/*-0 6. +t *t t. m *t. V;'- t-. t(h) *t 7. *t *d-, *-t- d.Sd) *d; *Sl-.- t-, -r- *t/*d t- 8. *d *d- d,S(0 *d. *Si- t-, -r- *t/*d, -y-l-0 9. *n *-n- n *n n *n/*-0 10. *-rr *-r- -r- *-r- -r- *-t-/*-r-/*-0 11.
    [Show full text]
  • V : Number Systems and Set Theory
    V : Number systems and set theory Any reasonable framework for mathematics should include the fundamental number systems which arise in the subject: 1. The natural numbers N (also known as the nonnegative integers). 2. The (signed) integers Z obtained by adjoining negative numbers to N. 3. The rational numbers Q obtained by adjoining reciprocals of nonzero integers to Z. 4. The real numbers R, which should include fundamental constructions like nth roots of positive rational numbers for an arbitrary integer n > 1, and also –1 –2 –k ⋅ ⋅ ⋅ all “infinite decimals” of the form b1 10 + b2 10 + … + bk 10 + … where each bi belongs to {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. Up to this point we have tacitly assumed that such number systems are at our disposal. However, in both the naïve and axiomatic approaches to set theory it is eventually necessary to say more about them. The naïve approach. In naïve set theory it is necessary to do two things. First, one must describe the properties that the set – theoretic versions of these number systems should satisfy. Second, something should be said to justify our describing such systems as THE natural numbers, THE integers, THE rational numbers, and THE real numbers. This usage suggests that we have completely unambiguous descriptions of the number systems in terms of their algebraic and other properties. One way of stating this is that any system satisfying all the conditions for one of the standard systems N, Z, Q or R should be the same as N, Z, Q or R for all mathematical purposes, with some explicit means for mechanical translation from the given system to the appropriate standard model.
    [Show full text]
  • Non-Power Positional Number Representation Systems, Bijective Numeration, and the Mesoamerican Discovery of Zero
    Non-Power Positional Number Representation Systems, Bijective Numeration, and the Mesoamerican Discovery of Zero Berenice Rojo-Garibaldia, Costanza Rangonib, Diego L. Gonz´alezb;c, and Julyan H. E. Cartwrightd;e a Posgrado en Ciencias del Mar y Limnolog´ıa, Universidad Nacional Aut´onomade M´exico, Av. Universidad 3000, Col. Copilco, Del. Coyoac´an,Cd.Mx. 04510, M´exico b Istituto per la Microelettronica e i Microsistemi, Area della Ricerca CNR di Bologna, 40129 Bologna, Italy c Dipartimento di Scienze Statistiche \Paolo Fortunati", Universit`adi Bologna, 40126 Bologna, Italy d Instituto Andaluz de Ciencias de la Tierra, CSIC{Universidad de Granada, 18100 Armilla, Granada, Spain e Instituto Carlos I de F´ısicaTe´oricay Computacional, Universidad de Granada, 18071 Granada, Spain Keywords: Zero | Maya | Pre-Columbian Mesoamerica | Number rep- resentation systems | Bijective numeration Abstract Pre-Columbian Mesoamerica was a fertile crescent for the development of number systems. A form of vigesimal system seems to have been present from the first Olmec civilization onwards, to which succeeding peoples made contributions. We discuss the Maya use of the representational redundancy present in their Long Count calendar, a non-power positional number representation system with multipliers 1, 20, 18× 20, :::, 18× arXiv:2005.10207v2 [math.HO] 23 Mar 2021 20n. We demonstrate that the Mesoamericans did not need to invent positional notation and discover zero at the same time because they were not afraid of using a number system in which the same number can be written in different ways. A Long Count number system with digits from 0 to 20 is seen later to pass to one using digits 0 to 19, which leads us to propose that even earlier there may have been an initial zeroless bijective numeration system whose digits ran from 1 to 20.
    [Show full text]