(eBook PDF) Discrete Structures by Harriet Fellinstant download
(eBook PDF) Discrete Structures by Harriet Fellinstant download
download
https://ebooksecure.com/product/ebook-pdf-discrete-structures-by-
harriet-fell/
http://ebooksecure.com/product/ebook-pdf-discrete-mathematical-
structures-6th-edition-by-bernard/
http://ebooksecure.com/product/ebook-pdf-discrete-mathematics-
with-applications-4th-by-susanna/
http://ebooksecure.com/product/ebook-pdf-electronics-with-
discrete-components-by-enrique-j-galvez/
https://ebooksecure.com/download/discrete-mathematics-ebook-pdf/
(eBook PDF) A Discrete Transition to Advanced
Mathematics by Bettina Richmond
http://ebooksecure.com/product/ebook-pdf-a-discrete-transition-
to-advanced-mathematics-by-bettina-richmond/
http://ebooksecure.com/product/discrete-mathematics-8th-edition-
ebook-pdf/
http://ebooksecure.com/product/ebook-pdf-translational-medicine-
in-cns-drug-development-volume-29/
https://ebooksecure.com/download/progress-in-heterocyclic-
chemistry-ebook-pdf/
http://ebooksecure.com/product/ebook-pdf-discrete-mathematics-
and-its-applications-8th-edition-by-kenneth-rosen/
DISCRETE STRUCTURES
BY HARRIET FELL AND JAVED A. ASLAM
EDITION
-
5.1 Simple Shift Ciphers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
5.1.1 Simple Shift Cipher Toys . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
5.2 Encoding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
5.3 The mod Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
5.3.1 Properties of mod . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
5.4 Simple Substitution Ciphers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
5.4.1 Shift Cipher . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
5.4.2 Linear Ciphers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
5.5 Modular Arithmetic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
5.6 Powers mod n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
5.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
-
7.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
8 Sets 95
8.1 Set Definition and Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
8.2 Set Basics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
8.3 Set-Builder Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
8.4 Venn Diagrams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
8.5 Set Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
8.5.1 ∪ Union . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
8.5.2 ∩ Intersection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
8.5.3 A Complement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
8.5.4 Difference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
8.5.5 Symmetric Difference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
8.5.6 Power Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
8.5.7 Cartesian Product . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
8.6 Computer Representation of Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
8.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106
9 Counting 109
9.1 Basic Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
9.2 Inclusion-exclusion Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
9.3 Pigeonhole Principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
9.3.1 Generalized Pigeonhole Principle . . . . . . . . . . . . . . . . . . . . . . . 118
9.4 Permutations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
9.5 Combinations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
9.6 Binomial Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
9.6.1 Pascal’s Triangle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
9.7 Balls-in-Bins . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
9.8 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128
-
10 Probability 137
10.1 Definitions and Basic Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
10.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
10.2.1 Dice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
10.2.2 Cards . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
10.2.3 Urns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
10.2.4 Bytes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142
10.3 Conditional Probability and Bayes Theorem . . . . . . . . . . . . . . . . . . . . . 143
10.3.1 Conditional Probability . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144
10.3.2 Bayes Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144
10.3.3 Explaining Monty Hall paradox using Bayes Theorem . . . . . . . . . . . 145
10.3.4 Another Application of Bayes Theorem . . . . . . . . . . . . . . . . . . . 145
10.4 Markov Chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
10.4.1 A Practical Method for Estimating the Stationary Distribution . . . . . . 150
10.5 PageRank . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
10.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156
-
11.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
14 Recurrences 197
14.1 Specifying Recurrences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
14.2 Solving Recurrences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
14.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202
16 PCR 207
16.1 Why is PCR Such a Major Breakthrough? . . . . . . . . . . . . . . . . . . . . . . 207
16.2 Why is PCR Controversial? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
16.3 Basic Biology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
16.4 Elementary Transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
16.5 The PCR Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210
-
16.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213
17 Graphs 217
17.1 Simple Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218
17.2 Weighted Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220
17.3 Graph Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
17.3.1 Adjacency List . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
17.3.2 Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222
17.3.3 Adjacency Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223
17.4 Graph Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 224
17.4.1 Graph Traversal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
17.4.2 Any Path . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
17.4.3 Shortest Path . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
17.4.4 Cheapest Path . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
17.4.5 Spanning Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 230
17.5 Graph Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
17.6 Directed Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232
17.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
18 Relations 241
18.1 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
18.1.1 Equality and Inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
18.1.2 Divides . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
18.1.3 Set Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
18.1.4 Congruence mod n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243
18.1.5 Triangles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243
18.1.6 People to People . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244
18.1.7 People to Things . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
18.1.8 Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
18.1.9 Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
18.1.10 Partitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
-
18.1.11 Networks and Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 246
18.2 Properties of Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 246
18.2.1 Reflexive . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
18.2.2 Symmetric . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
18.2.3 Transitive . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
18.3 Equivalence Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248
18.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250
-
Chapter 6 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
Chapter 7 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
Chapter 8 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
Chapter 9 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
Chapter 10 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
Chapter 11 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300
Chapter 12 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
Chapter 13 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310
Chapter 14 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311
Chapter 17 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 312
Chapter A Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317
Chapter B Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317
Chapter C Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 318
Bibliography 319
Index 321
-
Preface
Course Goals
This course introduces the mathematical structures and methods that form the foundation of
computer science. It includes many techniques that students are likely to use throughout their
careers in computer and information science. These techniques are motivated by applications
from computer science and supported by mathematical theory. Students will learn:
• specific skills, e.g., binary and modular arithmetic, set notation, and methods of count-
ing, evaluating sums, solving recurrences, . . .
Topics
The course material is divided into five modules. Each module starts with a motivating ap-
plication then goes into techniques related to that application and the theory behind those
techniques. Each module ends with one or more fairly deep applications based on the material.
xiii
-
! !
#(
$ !
%
We start by discussing how we can represent things on a computer using only 0s and 1s and
how this can be implemented with transistors and switches. This leads naturally into a study
of gates (e.g. AND, OR, NOT gates), the mathematics (Boolean Algebra or Symbolic Logic)
underlying logic gates and how to design circuits based on truth tables. The module ends with
the construction of a ripple-carry adder and even a simple, programmable CPU.
We use the Caesar Cipher and other simple shift ciphers as a link to modular arithmetic. We
then encipher messages with linear functions and see the need to learn more about the algebra
of modular arithmetic. In particular, we need modular multiplicative inverses to decipher mes-
sages and this leads us to primes, prime factorization, the Euclidean Algorithm for efficiently
computing the GCD (greatest common divisor) of two positive integers, and the Extended
-
Euclidean Algorithm to efficiently compute multiplicative inverses modn when they exist. Fi-
nally, we talk about public-key cryptography and apply all of this math to understanding the
RSA (Rivest-Shamir-Adleman) public-key cryptosystem.
We start by evaluating password criteria by counting how many passwords satisfy the given
conditions. Before we can count how many items there are in a set, we find that we need some
of the mathematics of sets e.g, set-builder notation, Venn diagrams, set operations, power sets,
and Cartesian products. Then we really get down to counting. That sounds simple but, for
most students, it is the hardest part of the course. We introduce the sum and product rules,
the inclusion-exclusion principle, the pigeonhole principle, permutations and combinations, the
Binomial theorem, and balls-in-bins alone and together to solve complex problems.
We first introduce probability in spaces where all outcomes are equally likely so that finding
the probability of an event comes down to counting the number of successful occurrences and
dividing by the total number of possible occurrences. This helps reinforce the counting methods.
We go on to conditional probability and Bayes’ theorem and its application to hypothesis testing.
We end with an introduction to Markov chains and their applications.
We begin by describing three algorithms for searching an ordered list of length n that run in time
√
proportional to n, n, and lg(n), respectively, in order to introduce the ideas of algorithmic
analysis. In order to analyze the performance of even for these simple algorithms, we see the
need for some mathematical formalization and tools for sequences and sums. We put these tools
to work for sorting algorithms but also delve into recurrence equations to model and analyze
binary search and merge sort. We introduce mathematical induction to support working with
and solving recurrence equations.
Growth of functions comes up as we discuss what all our analysis of algorithms means on
real computers. We demonstrate that a good algorithm is probably more important than a
faster machine. We also demonstrate that some algorithms are wholly impractical in the real
world because they take too long to run on any conceivable machine.
Networks are ubiquitous these days: the internet, phone networks, the local area network at
your work or school, the subway system in your city are all networks. We use mathematical
graphs to model networks and work with the data structures that are used to represent them on
-
computers. We investigate some graph theory problems that are important in computing, e.g.,
finding the shortest or cheapest path between two nodes and finding a minimal sub network
that connects all the nodes. When you complete this module, you should be able to give the
adjacency list of a graph, use traversal algorithms to visit all the nodes of a graph, and follow
algorithms to find shortest paths and minimal spanning trees.
Acknowledgments
Several people have contributed to this book, and we would like to thank them here. Rajmohan
Rajaraman wrote the chapter on building a CPU. This chapter is based on material from the
course “Great Theoretical Ideas in Computer Science” taught by Steven Rudich at Carnegie
Mellon University. Eric Ropiak added the section on programming the CPU. He also contributed
many of the solutions to exercises. Chris Burrows wrote the chapter on mathematical induction,
and Ravi Sundaram wrote the chapter on PCR (polymerase chain reaction). We would also like
to thank the many instructors who have taught Discrete Structures in the College of Computer
and Information Science at Northeastern University, as well as the students who have taken
this course. Their collective feedback has been invaluable.
-
Part I
-
Chapter 1
Number Representations
Everything on computers is represented using 0s and 1s: positive integers, negative integers,
real numbers, text, all sorts of symbols, images, music, even videos and games. To understand
how we can do everything with just 0s and 1s, we’ll start by seeing how nonnegative integers
(0, 1, 2, and so on) can be represented this way.
We usually use ten digits (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) to represent numbers. If we do not
allow leading zeros, every nonnegative integer has a unique representation as a finite sequence
of digits. This way of representing numbers is called the decimal or base 10 system. This
system seems natural to us, partly because we have grown up with it and partly because we
have ten fingers. The word “digits” comes from the Latin word for finger, digitus. Computers
don’t usually have fingers; they have bits (0, 1) from the words “Binary” and “digIT.” Numbers
on computers are represented with just 0 and 1, using the binary or base 2 system. Before we
look at the binary system let’s remember and formalize how the decimal system works.
Let’s look at the number 35032 in decimal or base 10 notation. We don’t think of this number
as just the digits that make it up. We know that the position of the digits matters. At a glance,
we know this number as “thirty-five thousand thirty-two” Each of the digits represents some
number of ones or tens or hundreds or thousands or ten thousands depending on its position.
There are two 3s in 35032. The leftmost 3 represents three 10-thousands or 3 · 104 and the other
3 represents 3 tens or 3 · 101 . The zero means there are no hundreds and we write it to make
sure that the digits to the left of it land in the right place.
3503210 = 3 · 104 + 5 · 103 + 0 · 102 + 3 · 101 + 2 · 100 (remember that 100 is just 1)
= 30000 + 5000 + 00 + 30 + 2
-
4 Number Representations
We only need the digits 0, 1, ... ,9 to represent all nonnegative integers base 10, and there is
only one way to write each of these integers base 10.
Formally, if d0 , d1 , · · · , dn−1 , dn are digits, then
The following theorem tells us that we can use any integer b as a base for a number
representation system.
n = ak · bk + ak−1 · bk−1 + · · · + a1 · b1 + a0 · b0
We say b is the base of expansion of n and we write n = (ak ak−1 · · · a1 a0 )b . For “short” numbers,
typically those with three digits or less, we often eliminate the parentheses (e.g., 1012 ). When
the base is understood, we do not write it as a subscript.
Example 1.1
2013 = 2 · 32 + 0 · 31 + 1 · 30
= 2·9+0·3+1·1
= 1910
2015 = 2 · 52 + 0 · 51 + 1 · 50
= 2 · 25 + 0 · 5 + 1 · 1
= 5110
We use the decimal (base 10) representation of integers in our everyday lives but as computer
scientists, we will also use binary (base 2) and hexadecimal (base 16) representations. The octal
(base 8) representation is rarely used these days but is included below for historical reasons.
-
1.1 Binary Representation 5
Example 1.2
(100101)2 = 1 · 25 + 0 · 24 + 0 · 23 + 1 · 22 + 0 · 21 + 1 · 20
= 1 · 32 + 0 · 16 + 0 · 8 + 1 · 4 + 0 · 2 + 1 · 1
= 3710
(11010111)2 = 1 · 27 + 1 · 26 + 0 · 25 + 1 · 24 + 0 · 23 + 1 · 22 + 1 · 21 + 1 · 20
= 1 · 128 + 1 · 64 + 0 · 32 + 1 · 16 + 0 · 8 + 1 · 4 + 1 · 2 + 1 · 1
= 21510
The decimal numbers 0 through 15 written in their binary or base 2 representation are:
0, 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111.
Binary Addition
When you add two positive decimal integers by hand, you probably use the addition algorithm
you learned in elementary school. You write the numbers one under the other, right adjusted,
then, starting on the right-hand side, you add the two digits in the ones column. If the sum
is 9 or less, i.e. a single digit, you write the digit and go on to the tens place. If the sum is
10 or greater, you write the ones place digit and carry the tens place digit by writing it above
the tens column. You then add the digits in the tens column as you did with the ones column,
carrying to the hundreds column and so one, until you have no digits left to add.
-
6 Number Representations
Example 1.3
1 1 1
3 8 0 8 5 3
+ 5 4 3 2 9
4 3 5 1 8 2
The same algorithm applies to adding binary integers but when you add the bits in a column,
you either get a sum less than two and you write the single bit, 0 or 1, in that place, or you get
a sum of 2 or 3 and you write the ones bit of the sum in that place and carry the twos bit to
the next place.
Example 1.4
1 1 1 1 1
1 1 0 1 0 1 5 3
⇐⇒
+ 1 0 1 1 1 + 2 3
1 0 0 1 1 0 0 7 6
Binary Subtraction
The subtraction algorithm you learned in elementary school can also be applied to subtracting
binary numbers. Let’s first look at the following example of decimal (base 10) subtraction. We
start on the right-hand side, in the ones place. Since 3 is less than 9, we borrow 1 from the tens
place to make 13. To do this, we replace the 5 in the tens place with a 4. We than subtract 9
from 13 and write down the resulting 4 in the answer’s ones place. We subtract 2 from 4 in the
tens place to get 2. In the hundreds place, we have to borrow again but this time we have to
do a double borrow as there is a 0 in the top number’s thousands place. We borrowed 1 from
the 8 in the ten-thousands place to make 10 in the thousands place and then borrowed 1 from
that ten to make 12 in the hundreds place.
Example 1.5
7 9 4
3 8 10 12 5 13
− 5 4 3 2 9
3 2 5 9 2 4
-
1.1 Binary Representation 7
The following example shows a subtraction of one binary number from another. In the ones
place, 1 take-away 1 results in 0. In the twos place, we have to borrow 1 from the fours place.
Then 102 = 210 take-away 1 results in 1. We now have to subtract 1 from 0 in the fours place
so we have to borrow again and this time it is a double borrow similar to the situation in the
decimal example above.
Example 1.6
1 1
0 1 0
1 1 10 1 10 1 5 3
⇐⇒
− 1 0 1 1 1 − 2 3
1 1 1 1 0 3 0
Binary Multiplication
Once again, let’s start by looking at an example of the multiplication algorithm in standard
decimal (base 10) notation. Below, we compute the product 312 × 2013. We multiply 312 by
each of the digits of 2013, starting at the right and writing the results below the line. Each
successive product is placed one space to the left of the previous product to account for the
extra power of 10 implicit in the computation. When a digit of the multiplier is 0, we usually
just write a single 0 for the product and then place the next product on the same line, as shown
below. Finally, we add the results of our multiplies by one digit to get the desired result.
Example 1.7
3 1 2
× 2 0 1 3
9 3 6
3 1 2
6 2 4 0
6 2 8 0 5 6
Binary multiplication works the same way but it is much easier to do since there are only
0s and 1s to work with. Each little computation is a multiply by 1 where you just copy the
multiplicand or a multiply by 0 where you just write 0 and go on to the next bit. With binary
-
8 Number Representations
arithmetic, you are writing each little result one place further to the left to account for an extra
power of 2. Here is an example of binary multiplication.
Example 1.8
1 1 0
× 1 0 1 1
1 1 0
1 1 0
1 1 0 0
1 0 0 0 0 1 0
When we multiply an integer by ten all we have to do is add a zero to the right side of the
integer’s decimal representation.
10 × 3257 = 32570
Inversely, if a decimal integer ends in a zero, we can easily divide the integer by ten by simply
removing the zero. If the integer does not end in a zero then removing the rightmost digit gives
the integer part of the result of dividing by ten.
Similarly, in binary, we can multiply an integer by two by adding a zero to the right hand side
of its binary representation.
1101012 = 1 · 25 + 1 · 24 + 0 · 23 + 1 · 22 + 0 · 21 + 1 · 20
-
Another Random Document on
Scribd Without Any Related Topics
social, military, and political services, as well as a payment for the
use of land. This system was private ownership, indeed, but if we
apply the Roman notion of ownership we shall find it difficult to
decide whether the tenant or the lord should more properly be called
the owner. At any rate, the right of ownership possessed by the lord
was greatly limited by restrictions which favoured the masses of the
cultivators. In every community there were common wood lands and
pasture lands for the free use of all the inhabitants. Among other
restrictions of private ownership and control in favour of the principle
of equal access to the land by all persons, we may mention the
division of the English villein's holding into several portions,
intermingled with those of his neighbours, so that each would have
about the same amount of good land; and the ancient Hebrew law
whereby alienated land was returned to the descendants of its
original owners every fifty years.[7]
Reckoning the feudal lord, and all other overlords who had the same
control over land, as private proprietors, we may say that in
historical times the arable land of every country has been owned by
a minority of the population. Since the downfall of feudalism, the
tendency in most regions of the Western world has been toward an
increase in the number of owners, and a decrease in the number of
great estates. This tendency has been especially marked during the
last one hundred years. It will, however, need to continue for a very
long time, or else to increase its pace very rapidly, before land
ownership will be diffused in anything like the measure that is
necessary if its benefits are to be shared by all the people. Even in
the United States, where the distribution is perhaps more general
than in any other country, only 38.4 per cent. of the families in
towns and cities owned, in 1910, the homes in which they lived, and
therefore the land upon which their homes were located. In the rural
districts the per cent. of home-owning families was only 62.8.
Arguments by Socialists
"The equal right of all men to the use of land is as clear as their
equal right to breathe the air—it is a right proclaimed by the fact of
their existence. For we cannot suppose that some men have a right
to be in the world, and others no right.
"If we are here by the equal permission of the Creator, we are all
here with an equal title to the enjoyment of his bounty—with an
equal right to the use of all that nature so impartially offers.... There
is in nature no such thing as a fee simple in land. There is on earth
no power which can rightfully make a grant of exclusive ownership
of land. If all existing men were to grant away their equal rights,
they could not grant away the rights of those who follow them. For
what are we but tenants for a day? Have we made the earth that we
should determine the rights of those who after us shall tenant it in
their turn?"[22]
The right to use the goods of nature for the support of life is
certainly a fundamental natural right; and it is substantially equal in
all persons. It arises, on the one hand, from man's intrinsic worth,
his essential needs, and his final destiny; and, on the other hand,
from the fact that nature's bounty has been placed by God at the
disposal of all His children indiscriminately. But this is a general and
abstract right. What does it imply specifically and in the concrete? In
the first place, it includes the actual and continuous use of some
land; for a man cannot support life unless he is permitted to occupy
some portion of the earth for the purposes of working, and eating,
and sleeping. Secondly, it means that in time of extreme need, and
when more orderly methods are not available, a man has the right to
seize sufficient goods, natural or produced, public or private, to
support life. So much is admitted and taught by all Catholic
authorities, and probably by all other authorities. Furthermore, the
abstract right in question seems very clearly to include the concrete
right to obtain on reasonable conditions at least the requisites of a
decent livelihood; for example, by direct access to a piece of land, or
in return for a reasonable amount of useful labour. All of these
particular rights are equally valid in all persons.
Does the equal right to use the bounty of nature include the right to
equal shares of land, or land values, or land advantages? Since the
resources of nature have been given to all men in general, and since
human nature is specifically and juridically equal in all, have not all
persons the right to share equally in these resources? Suppose that
some philanthropist hands over to one hundred persons an
uninhabited island, on condition that they shall divide it among
themselves with absolute justice. Are they not obliged to divide it
equally? On what ground can any person claim or be awarded a
larger share than his fellows? None is of greater intrinsic worth than
another, nor has any one made efforts, or sacrifices, or products
which will entitle him to exceptional treatment. The correct principle
of distribution would seem to be absolute equality, except in so far
as it may be modified on account of varying needs, and varying
capacities for social service. In any just distribution account must be
taken of differences in needs and capacities; for it is not just to treat
men as equal in those respects in which they are unequal, nor is it
fair to deprive the community of those social benefits which can be
obtained only by giving exceptional rewards for exceptional services.
The same amount of food allotted to two persons might leave one
hungry and the other sated; the same amount of land assigned to
two persons might tempt the one to wastefulness and discourage
the other. To be sure, the factor of exceptional capacity should not
figure in the distribution until all persons had received that measure
of natural goods which was in each case sufficient for a decent
livelihood. For the fundamental justification of any distribution is to
be sought in human needs; and among human needs the most
deserving and the most urgent are those which must be satisfied as
a prerequisite to right and reasonable life.
Now it is true that private ownership of land has nowhere realised
this principle of proportional equality and proportional justice. No
such result is possible in a system that, in addition to other
difficulties, would be required to make a new distribution at every
birth and at every death. Private ownership of land can never bring
about ideal justice in distribution. Nevertheless it is not necessarily
out of harmony with the demands of practical justice. A community
that lacks either the knowledge or the power to establish the ideal
system is not guilty of actual injustice because of this failure. In such
a situation the proportionally equal rights of all men to the bounty of
nature are not actual rights. They are conditional, or hypothetical, or
suspended. At best they have no more moral validity than the right
of a creditor to a loan that, owing to the untimely death of the
debtor, he can never recover. In both cases it is misleading to talk of
injustice; for this term always implies that some person or
community is guilty of some action which could have been avoided.
The system of private landownership is not, indeed, perfect; but this
is not exceptional in a world where the ideal is never attained, and
all things are imperfect. Henry George declares that "there is on
earth no power which can rightfully make a grant of exclusive
ownership in land"; but what would he have a community do which
has never heard of his system? Introduce some crude form of
communism, or refrain from using the land at all, and permit the
people to starve to death in the interests of ideal justice? Evidently
such a community must make grants of exclusive ownership, and
these will be as valid in reason and in morals as any other act that is
subject to human limitations which are at the time irremovable.
Perhaps the Single Taxer would admit the force of the foregoing
argument. He might insist that the titles given by the State in such
conditions were not exclusive grants in the strict sense, but were
valid only until a better system could be set up, and the people put
in possession of their natural heritage. Let us suppose, then, that a
nation were shown "a more excellent way." Suppose that the people
of the United States set about to establish Henry George's system in
the way that he himself advocated. They would forthwith impose
upon all land an annual tax equivalent to the annual rent. What
would be the effect upon private land-incomes, and private land-
wealth? Since the first would be handed over to the State in the
form of a tax, the second would utterly disappear. For the value of
land, like the value of any other economic good, depends upon the
utilities that it embodies or produces. Whoever controls these will
control the market value of the land itself. No man will pay anything
for a revenue-producing property if some one else, for example, the
State, is forever to take the revenue. The owner of a piece of land
which brings him an annual revenue or rent of one hundred dollars,
will not find a purchaser for it if the State appropriates the one
hundred dollars in the form of a tax that is to be levied year after
year for all time. On the assumption that the revenue represents a
selling value of two thousand dollars, the private owner will be worth
that much less after the introduction of the new system.
Henry George defends this proceeding as emphatically just, and
denies the justice of compensating the private owners. In the
chapter of "Progress and Poverty" headed, "Claim of Land Owners to
Compensation," he declares that "private property in land is a bold,
bare, enormous wrong, like that of chattel slavery"; and against
Mill's statement that land owners have a right to rent and to the
selling value of their holdings, he exclaims: "If the land of any
country belong to the people of that country, what right, in morality
and justice, have the individuals called land owners to the rent? If
the land belong to the people, why in the name of morality and
justice should the people pay its salable value for their own?"[23]
Here, then, we have the full implication of the Georgean principle
that private property in land is essentially unjust. It is not merely
imperfect,—tolerable while unavoidable. When it can be supplanted
by the right system, its inequalities must not continue under another
form. If inequalities are continued through the compensation of
private owners, individuals are still hindered from enjoying their
equal rights to land, and the State becomes guilty of formal and
culpable injustice. The titles which the State formerly guaranteed to
the private owners did not have in morals the perpetual validity
which they professed to have. Since the State is not the owner of
the land, it was morally powerless to create or sanction titles of this
character. Even if all the citizens at any given time had deliberately
transferred the necessary authorisation to the State, "they could
not," in the words of Henry George, "grant away the right of those
who follow them." The individual's right to land is innate and natural,
not civil or social. The author of "Progress and Poverty" attributes to
the individual's common right to land precisely the same absolute
character that Father Liberatore predicates of the right to become a
private land owner.[24] In the view of Henry George, the State is
merely the trustee of the land, having the duty of distributing its
benefits and values so as to make effective the equal rights of all
individuals. Consequently, the legal titles of private ownership which
it creates or sanctions are valid only so long as nothing better is
available. At best such titles have no greater moral force than the
title by which an innocent purchaser holds a stolen watch; and the
persons who are thereby deprived of their proper shares of land
benefits, have the same right to recover them from the existing
private owners that the watch-owner has to recover his property
from the innocent purchaser. Hence the demand for compensation
has no more merit in the one case than in the other.
To the objection that the civil laws of many civilised countries would
permit the innocent purchaser of the watch to retain it, provided that
sufficient time had elapsed to create a title of prescription, the Single
Taxer would reply that the two kinds of goods are not on the same
moral basis in all respects. He would contend that the natural
heritage of the race is too valuable, and too important for human
welfare to fall under the title of prescription.
To put the matter briefly, then, Henry George contends that the
individual's equal right to land is so much superior to the claim of
the private owner that the latter must give way, even when it
represents an expenditure of money or other valuable goods. The
average opponent does not seem to realise the full force of the
impression which this theory makes upon the man who
overemphasises the innate rights of men to a share in the gifts of
nature. Let us see whether this right has the absolute and
overpowering value which is attributed to it by Henry George.
In considering this question, the supremely important fact to be kept
in mind is that the natural right to land is not an end in itself. It is
not a prerogative that inheres in men, regardless of its purposes or
effects. It has validity only in so far as it promotes individual and
social welfare. As regards individual welfare, we must bear in mind
that this phrase includes the well being of all persons, of those who
do as well as of those who do not at present enjoy the benefits of
private landownership. Consequently the proposal to restore to the
"disinherited" the use of their land rights must be judged by its
effects upon the welfare of all persons. If existing landowners are
not compensated they are deprived, in varying amounts, of the
conditions of material well being to which they have become
accustomed, and are thereby subjected to varying degrees of
positive inconvenience and hardship. The assertion that this loss
would be offset by the moral gain in altruistic feelings and
consciousness, may be passed over as applying to a different race of
beings from those who would be despoiled. The hardship is
aggravated considerably by the fact that very many of the
dispossessed private owners have paid the full value of their land out
of the earnings of labour or capital, and that all of them have been
encouraged by society and the State to regard landed property in
precisely the same way as any other kind of property. In the latter
respect they are not in the same position as the innocent purchaser
of the stolen watch; for they have never been warned by society
that the land might have been virtually stolen, or that the
supposedly rightful claimants might some day be empowered by the
law to recover possession. On the other hand, the persons who own
no land under the present system, the persons who are deprived of
their "birthright," suffer no such degree of hardship when they are
continued in that condition. They are kept out of something which
they have never possessed, which they have never hoped to get by
any such easy method, and from which they have not been
accustomed to derive any benefit. To prolong this condition is not to
inflict upon them any new or positive inconvenience. Evidently their
welfare and claims in the circumstances are not of the same moral
importance as the welfare and claims of persons who would be
called upon to suffer the loss of goods already possessed and
enjoyed, and acquired with the full sanction of society.
Henry George is fond of comparing the private owner of land with
the slave owner, and the landless man with the man enslaved; but
there is a world of difference between their respective positions and
moral claims. Liberty is immeasurably more important than land, and
the hardship suffered by the master when he is compelled to free
the slave is immeasurably less than that endured by the slave who is
forcibly detained in bondage. Moreover, the moral sense of mankind
recognises that it is in accordance with equity to compensate slave
owners when the slaves are legally emancipated. Infinitely stronger
is the claim of the landowner to compensation.
If the Georgeite replies that the landless man is at present kept out
of something to which he has a right, while confiscation would take
from the private owner something which does not really belong to
him, the rejoinder must be that this assertion begs the question. The
question is likewise begged when the unreasonable defender of
private property declares that the right of the landless is vague and
undetermined, and therefore morally inferior to the determinate and
specific right of the individual landowner. This is precisely the
question to be solved. Does the abstract right of the landless man
become a concrete right which is so strong as to justify confiscation?
Is his natural right valid against the acquired right of the private
proprietor? These questions can be answered intelligently only by
applying the test of human welfare, individual and social. To say that
land of its very nature is not morally susceptible of private
ownership, is to make an easy assertion that may be as easily
denied. To interpret man's natural right to land by any other
standard than human welfare, is to make of it a fetish, not a thing of
reason. Henry George himself seemed to recognise this when he
wrote that wonderfully eloquent but overdrawn and one-sided
description of the effects of private ownership which occurs in the
chapter entitled, "Claim of Landowners to Compensation."[25]
When we say that human welfare is the final determinant of the
right to land, we understand this phrase in the widest possible
sense. To divide the goods of the idle rich among the deserving poor,
might be temporarily beneficial to both these classes, but the more
remote and enduring consequences would be individually and
socially disastrous. To restore a legacy to persons who had been
defrauded of it when very young, would probably cause more
hardship to the swindler than the heirs would have suffered had
there been no restitution; nevertheless the larger view of human
welfare requires that the legacy should be restored. When, however,
two or three generations have been kept out of their inheritance, the
civil law permits the children of the swindler to retain the property
by the title of prescription; and for precisely the same reason,
human welfare.
The social consequences of the confiscation of rent and land values,
would be even more injurious than those falling upon the individuals
despoiled. Social peace and order would be gravely disturbed by the
protests and opposition of the landowners, while the popular
conception of property rights, and of the inviolability of property,
would be greatly weakened, if not entirely destroyed. The average
man would not grasp or seriously consider the Georgean distinction
between land and other kinds of property in this connection. He
would infer that purchase, or inheritance, or bequest, or any other
title having the immemorial sanction of the State, does not create a
moral right to movable goods any more than to land. This would be
especially likely in the matter of capital. Why should the capitalist,
who is no more a worker than the landowner, be permitted to
extract revenue from his possessions? In both cases the most
significant and practical feature is that one class of men contributes
to another class an annual payment for the use of socially necessary
productive goods. If rent-confiscation would benefit a large number
of people, why not increase the number by confiscating interest?
Indeed, the proposal to confiscate rent is so abhorrent to the moral
sense of the average man that it could never take place except in
conditions of revolution and anarchy. If that day should ever arrive
the policy of confiscation would not stop with land.
ebooksecure.com