Essential Discrete Mathematics for Computer Science 1st Edition Harry Lewis download
Essential Discrete Mathematics for Computer Science 1st Edition Harry Lewis download
https://textbookfull.com/product/essential-discrete-mathematics-
for-computer-science-1st-edition-harry-lewis/
https://textbookfull.com/product/discrete-mathematics-for-
computer-science-1st-edition-jon-pierre-fortney/
https://textbookfull.com/product/ideas-that-created-the-future-
classic-papers-of-computer-science-1st-edition-harry-r-lewis/
https://textbookfull.com/product/imaginary-mathematics-for-
computer-science-1st-edition-vince/
https://textbookfull.com/product/logic-lecture-notes-for-
philosophy-mathematics-and-computer-science-andrea-iacona/
Discrete Mathematics 8e Richard Johnsonbaugh
https://textbookfull.com/product/discrete-mathematics-8e-richard-
johnsonbaugh/
https://textbookfull.com/product/the-beauty-of-mathematics-in-
computer-science-1st-edition-jun-wu/
https://textbookfull.com/product/journey-into-discrete-
mathematics-1st-edition-owen-byer/
https://textbookfull.com/product/discrete-mathematics-with-ducks-
second-edition-belcastro/
https://textbookfull.com/product/discrete-mathematics-and-
applications-2nd-edition-ferland/
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page i — ©#1Princeton University Press, 2018
i Please do not circulate. i
ESSENTIAL DISCRETE
MATHEMATICS FOR
COMPUTER SCIENCE
−
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page ii — ©#2
Princeton University Press, 2018
i Please do not circulate. i
−1
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page iii —©#3
Princeton University Press, 2018
i Please do not circulate. i
ESSENTIAL DISCRETE
MATHEMATICS FOR
COMPUTER SCIENCE
−
PR I NC ETON U N I V E R SI T Y PR E S S ∼ PR I NC ETON A ND OX FOR D 0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page iv — ©#4
Princeton University Press, 2018
i Please do not circulate. i
Copyright
c 2019 by Harry Lewis and Rachel Zax
press.princeton.edu
LCCN
ISBN 978-0-691-17929-2
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page v — ©#5Princeton University Press, 2018
i Please do not circulate. i
−
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page vi — ©#6
Princeton University Press, 2018
i Please do not circulate. i
−1
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page vii —© #7
Princeton University Press, 2018
i Please do not circulate. i
−
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page viii —© #8
Princeton University Press, 2018
i Please do not circulate. i
−1
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page ix — ©#9
Princeton University Press, 2018
i Please do not circulate. i
CONTENTS
Preface xi
4 Strong Induction 39
5 Sets 49
6 Relations and Functions 59
8 Structural Induction 79
9 Propositional Logic 89
17 Connectivity 173
18 Coloring 179
22 Counting 233
23 Counting Subsets 243 −
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page x — ©#10
Princeton University Press, 2018
i Please do not circulate. i
x contents
24 Series 261
26 Probability 297
Index 381
−1
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:40 — page xi — ©#11
Princeton University Press, 2018
i Please do not circulate. i
PREFACE
This introductory text treats the discrete mathematics that computer scien-
tists should know but generally do not learn in calculus and linear algebra
courses. It aims to achieve breadth rather than depth and to teach reasoning
as well as concepts and skills.
We stress the art of proof in the hope that computer scientists will learn to
think formally and precisely. Almost every formula and theorem is proved
in full. The text teaches the cumulative nature of mathematics; in spite of the
breadth of topics covered, seemingly unrelated results in later chapters rest
on concepts derived early on.
The text requires precalculus and occasionally uses a little bit of calculus.
Chapter 21, on order notation, uses limits, but includes a quick summary of
the needed basic facts. Proofs and exercises that use basic facts about deriva-
tives and integrals, including l’Hôpital’s rule, can be skipped without loss of
continuity.
A fast-paced one-semester course at Harvard covers most of the material
in this book. That course is typically taken by freshmen and sophomores as
a prerequisite for courses on theory of computation (automata, computabil-
ity, and algorithm analysis). The text is also suitable for use in secondary
schools, for students of mathematics or computer science interested in
topics that are mathematically accessible but off the beaten track of the
standard curriculum.
The book is organized as a series of short chapters, each of which might
be the subject of one or two class sessions. Each chapter ends with a brief
summary and about ten problems, which can be used either as homework
or as in-class exercises to be solved collaboratively in small groups.
Instructors who choose not to cover all topics can abridge the book in
several ways. The spine of the book includes Chapters 1–8 on foundational
concepts, Chapters 13–18 on digraphs and graphs, and Chapters 21–25 on
order notation and counting. Four blocks of chapters are optional and can
be included or omitted at the instructor’s discretion and independently of
each other:
• Chapters 9–12 on logic;
−
• Chapters 19–20 on automata and formal languages; 0
1
i i
i i
i i
xii preface
−1
0
1
i i
i i
i i
ESSENTIAL DISCRETE
MATHEMATICS FOR
COMPUTER SCIENCE
−
0
1
i i
i i
i i
−1
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 1 — ©#1Princeton University Press, 2018
i Please do not circulate. i
Chapter 1
How do we know that a computer program produces the right results? How
do we know that a program will run to completion? If we know it will
stop eventually, can we predict whether that will happen in a second, in
an hour, or in a day? Intuition, testing, and “it has worked OK every time
we tried it” should not be accepted as proof of a claim. Proving something
requires formal reasoning, starting with things known to be true and con-
necting them together by incontestable logical inferences. This is a book
about the mathematics that is used to reason about the behavior of computer
programs.
The mathematics of computer science is not some special field. Com-
puter scientists use almost every branch of mathematics, including some
that were never thought to be useful until developments in computer science
created applications for them. So this book includes sections on mathemat-
ical logic, graph theory, counting, number theory, and discrete probability
theory, among other things. From the standpoint of a traditional mathemat-
ics curriculum, this list includes apples and oranges. One common feature
of these topics is that all prove useful in computer science. Moreover, they
are all discrete mathematics, which is to say that they involve quantities that
change in steps, not continuously, or are expressed in symbols and structures
rather than numbers. Of course, calculus is also important in computer sci-
ence, because it assists in reasoning about continuous quantities. But in this
book we will rarely use integrals and derivatives.
.
One of the most important skills of mathematical thinking is the art of
generalization. For example, the proposition
6 is true, but very specific (see Figure 1.1). The sides of lengths 1 and 2 would
Figure 1.1. Can there be a triangle have to join the side of length 6 at its two ends, but the two short sides −
with sides of lengths 1, 2 and 6? together aren’t long enough to meet up at the third corner. 0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 2 — ©#2Princeton University Press, 2018
i Please do not circulate. i
Well, so what? Put two people together and they may or may not have
been born on the same day of the week. Yet there is something going on
here that can be generalized. As long as there are at least eight people, some
two of them must have been born on the same day of the week, since a week
has only seven days. Some statement like (1.1) must be true, perhaps with
a different pair of names and a different day of the week. So here is a more
general proposition.
In any group of eight people, some two of them were born on the
same day of the week.
But even that isn’t really general. The duplication has nothing to do with
properties of people or days of the week, except how many there are of each.
For the same reason, if we put eight cups on seven saucers, some saucer
would have two cups on it. In fact there is nothing magic about “eight” and
“seven,” except that the one is larger than the other. If a hotel has 1000 rooms
and 1001 guests, some room must contain at least two guests. How can we
state a general principle that covers all these cases, without mentioning the
irrelevant specifics of any of them?
First, we need a new concept. A set is a collection of things, or elements.
−1
The elements that belong to the set are called its members. The members of
0
a set must be distinct, which is another way of saying they are all different
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 3 — ©#3Princeton University Press, 2018
i Please do not circulate. i
from each other. So the people mentioned in (1.1) form a set, and the days
of the week form another set. Sometimes we write out the members of a set
explicitly, as a list within curly braces {}:
When we write out the elements of a set, their order does not matter—in any
order it is still the same set. We write x ∈ X to indicate that the element x is
a member of the set X. For example, Charlie ∈ P and Thursday ∈ D.
We need some basic terminology about numbers in order to talk about
sets. An integer is one of the numbers 0, 1, 2, . . . , or −1, −2, . . . . The real
numbers are all the numbers on the number line, including √ all the integers
and also all the numbers in between integers, such as 12 , − 2, and π . A num-
ber is positive if it is greater than 0, negative if it is less than 0, and nonnegative
if it is greater than or equal to 0.
For the time being, we will be discussing finite sets. A finite set is a set that
can (at least in principle) be listed in full. A finite set has a size or cardinality,
which is a nonnegative integer. The cardinality of a set X is denoted |X|.
For example, in the example of people and the days of the week on which
they were born, |P| = 8 and |D| = 7, since eight people are listed and there
are seven days in a week. A set that is not finite—the set of integers, for
example—is said to be infinite. Infinite sets have sizes too—an interesting
subject to which we will return in our discussion of infinite sets in Chapter 7.
Now, a function from one set to another is a rule that associates each
member of the first set with exactly one member of the second set. If f is
a function from X to Y and x ∈ X, then f (x) is the member of Y that the
function f associates with x. We refer to x as the argument of f and f (x)
as the value of f on that argument. We write f : X → Y to indicate that f is
a function from set X to set Y. For example, we could write b : P → D to
denote the function that associates each of the eight friends with the day of
the week on which he or she was born; if Charlie was born on a Thursday,
then b(Charlie) = Thursday.
A function f : X → Y is sometimes called a mapping from X to Y, and f
is said to map an element x ∈ X to the element f (x) ∈ Y. (In the same way, a
real map associates a point on the surface of the earth with a point on a sheet
of paper.)
Finally, we have a way to state the general principle that underlies the
example of (1.1):
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 4 — ©#4Princeton University Press, 2018
i Please do not circulate. i
? pigeonholes and every pigeon goes into a pigeonhole, then some pigeonhole
must have more than one pigeon in it. The pigeons are the members of X and
the pigeonholes are the members of Y (Figure 1.3).
We will provide a formal proof of the Pigeonhole Principle on page 34,
once we have developed some of the basic machinery for doing proofs. For
now, let’s scrutinize the statement of the Pigeonhole Principle with an eye
X Y
Figure 1.3. The Pigeonhole
toward understanding mathematical language. Here are some questions we
Principle. If |X| > |Y| and f is any might ask:
function from X to Y, then the
1. What are X and Y?
values of f must be the same for
some two distinct members of X. They are finite sets. To be absolutely clear, we might have begun the
statement with the phrase, “For any finite sets X and Y,” but the
assertion that f is a function from X to Y makes sense only if X and Y
are sets, and it is understood from context that the sets under
discussion are finite—and we therefore know how to compare their
sizes.
2. Why did we choose “x1 ” and “x2 ” for the names of elements of X?
We could in principle have chosen any variables, “x” and “y” for
example. But using variations on “X” to name elements of the set X
suggests that x1 and x2 are members of the set X rather than the set Y.
So using “x1 ” and “x2 ” just makes our statement easier to read.
3. Was the phrase “such that x1 = x2 ” really necessary? The sentence is
simpler without it, and seems to say the same thing.
Yes, the “x1 = x2 ” is necessary, and no, the sentence doesn’t say the
same thing without it! If we didn’t say “x1 = x2 ,” then “x1 ” and “x2 ”
could have been two names for the same element. If we did not
stipulate that x1 and x2 had to be different, the proposition would not
have been false—only trivial! Obviously if x1 = x2 , then f (x1 ) = f (x2 ).
That is like saying that the mass of Earth is equal to the mass of the
third planet from the sun. Another way to state the Pigeonhole
Principle would be to say, “there are distinct elements x1 , x2 ∈ X such
that f (x1 ) = f (x2 ).”
One more thing is worth emphasizing here. A statement like “there are
elements x1 , x2 ∈ X with property blah” does not mean that there are exactly
two elements with that property. It just means that at least two such elements
exist for sure—maybe more, but definitely not less.
.
Mathematicians always search for the most general form of any principle,
because it can then be used to explain more things. For example, it is equally
obvious that we can’t put 15 pigeons in 7 pigeonholes without putting at least
3 pigeons in some pigeonhole—but there is no way to derive that from the
−1
Pigeonhole Principle as we stated it. Here is a more general version:
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 5 — ©#5Princeton University Press, 2018
i Please do not circulate. i
Theorem 1.3. Extended Pigeonhole Principle. For any finite sets X and Y
and any positive integer k such that |X| > k · |Y|, if f : X → Y, then there are at
least k + 1 distinct members x1 , . . . , xk+1 ∈ X such that f (x1 ) = . . . = f (xk+1 ).
|X|
|Y|
values of x.
Proof. Let m = |X| and n = |Y|.If n | m, then this is the Extended Pigeonhole
Principle with k = m m
n − 1 = n − 1. If n m, then again this is the Extended
Pigeonhole Principle with k = m n − 1, since that is the largest integer less
|X|
than |Y| . ■
.
Once stated in their general form, these versions of the Pigeonhole Prin-
ciple seem to be fancy ways of saying something obvious. In spite of that,
we can use them to explain a variety of different phenomena—once we −
figure out what are the “pigeons” and the “pigeonholes.” Let’s close with an 0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 6 — ©#6Princeton University Press, 2018
i Please do not circulate. i
We’ll prove this theorem in Chapter 4, but make some use of it right now.
The prime decomposition of a number n is that unique product
e
n = pe11 · . . . · pkk , (1.6)
where the pi are primes in increasing order and the ei are positive integers.
e
For example, 180 = 22 · 32 · 51 , and there is no other product pe11 · . . . · pkk
equal to 180, where p1 < p2 < . . . < pk , all the pi are prime, and the ei are
integer exponents.
The prime decomposition of the product of two integers m and n com-
bines the prime decompositions of m and of n—every prime factor of m · n
is a prime factor of one or the other.
where the pi are prime. But then p must be one of the pi , and each pi must
appear in the unique prime decomposition of either m or n. ■
18 = 21 · 32 (exponents of 2, 3, 5 are 1, 2, 0)
1 1
10 = 2 · 5 (exponents of 2, 3, 5 are 1, 0, 1)
2 2 1
−1 180 = 2 · 3 · 5
0 = 21+1 · 32+0 · 50+1 .
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 7 — ©#7Princeton University Press, 2018
i Please do not circulate. i
“Arbitrarily large” means that for every n > 0, there is a prime number
greater than n.
Proof. Pick some value of k for which we know there are at least k primes,
and let p1 , . . . , pk be the first k primes in increasing order. (Since p1 = 2,
p2 = 3, p3 = 5, we could certainly take k = 3.) We’ll show how to find a prime
number greater than pk . Since this process could be repeated indefinitely,
there must be infinitely many primes.
Consider the number N that is one more than the product of the first k
primes:
N = (p1 · p2 · . . . · pk ) + 1. (1.9)
“Between a and b inclusive” means including all numbers that are ≥ a and
also ≤ b—so including both 2 and 40 in this case.
Solution to example. Observe first that there are 12 prime numbers less than
or equal to 40: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, no two of which share
a factor greater than 1. Let’s define P to be this set of 12 prime numbers. −
(We needed to specify that m ≥ 13, because the claim would be false with 0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 8 — ©#8Princeton University Press, 2018
i Please do not circulate. i
Chapter Summary
Problems
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:41 — page 9 — ©#9Princeton University Press, 2018
i Please do not circulate. i
1.2. Let f (n) be the largest prime divisor of n. Can it happen that x < y but
f (x) > f (y)? Give an example or explain why it is impossible.
1.3. Under what circumstances is x = x − 1?
1.4. Imagine a 9 × 9 square array of pigeonholes, with one pigeon in each
pigeonhole. (So 81 pigeons in 81 pigeonholes—see Figure 1.4.) Suppose that all
at once, all the pigeons move up, down, left, or right by one hole. (The pigeons
on the edges are not allowed to move out of the array.) Show that some pigeon-
hole winds up with two pigeons in it. Hint: The number 9 is a distraction. Try
some smaller numbers to see what is going on.
1.5. Show that in any group of people, two of them have the same number of
friends in the group. (Some important assumptions here: no one is a friend of
him- or herself, and friendship is symmetrical—if x is a friend of y then y is a
friend of x.)
1.6. Given any five points on a sphere, show that four of them must lie within a
Figure 1.4. Each pigeonhole in a closed hemisphere, where “closed” means that the hemisphere includes the circle
9 × 9 array has one pigeon. All that divides it from the other half of the sphere. Hint: Given any two points on a
simultaneously move to another sphere, one can always draw a “great circle” between them, which has the same
pigeonhole that is immediately
circumference as the equator of the sphere.
above, below, to the left, or to the
right of its current hole. Must some 1.7. Show that in any group of 25 people, some three of them must have
pigeonhole wind up with two birthdays in the same month.
pigeons?
1.8. A collection of coins contains six different denominations: pennies, nick-
els, dimes, quarters, half-dollars, and dollars. How many coins must the
collection contain to guarantee that at least 100 of the coins are of the same
denomination?
1.9. Twenty-five people go to daily yoga classes at the same gym, which offers
eight classes every day. Each attendee wears either a blue, red, or green shirt to
class. Show that on a given day, there is at least one class in which two people
are wearing the same color shirt.
1.10. Show that if four distinct integers are chosen between 1 and 60 inclusive,
some two of them must differ by at most 19.
1.11. Find a k such that the product of the first k primes, plus 1, is not prime,
but has a prime factor larger than any of the first k primes. (There is no trick for
solving this. You just have to try various possibilities!)
1.12. Show that in any set of 9 positive integers, some two of them share all of
their prime factors that are less than or equal to 5.
1.13. A hash function from strings to numbers derives a numerical hash value
h(s) from a text string s; for example, by adding up the numerical codes for the
characters in s, dividing by a prime number p, and keeping just the remainder.
The point of a hash function is to yield a reproducible result (calculating h(s)
twice for the same string s yields the same numerical value) and to make it likely
that the hash values for different strings will be spread out evenly across the
possible hash values (from 0 to p − 1). If the hash function has identical hash −
values for two different strings, then these two strings are said to collide on that 0
1
i i
i i
i i
hash value. We count the number of collisions on a hash value as 1 less than the
number of strings that have that hash value, so if 2 strings have the same hash
value there is 1 collision on that hash value. If there are m strings and p possible
hash values, what is the minimum number of collisions that must occur on the
hash value with the most collisions? The maximum number of collisions that
might occur on some hash value?
−1
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:42 — page 11 —©#1Princeton University Press, 2018
i Please do not circulate. i
Chapter 2
If there are more pigeons than pigeonholes and every pigeon goes
into a pigeonhole, then some pigeonhole must contain more than
one pigeon.
But suppose your friend did not believe this statement. How could you
convincingly argue that it was true?
You might try to persuade your friend that there is no way the opposite
could be true. You could say, let’s imagine that each pigeonhole has no more
than one pigeon. Then we can count the number of pigeonholes, and since
each pigeonhole contains zero or one pigeons, the number of pigeons can be
at most equal to the number of pigeonholes. But we started with the assump-
tion that there were more pigeons than pigeonholes, so this is impossible!
Since there is no way that every pigeonhole can have at most one pigeon,
some pigeonhole must contain more than one pigeon, and that is what we
were trying to prove.
In this chapter, we’ll discuss how to take informal, specific arguments
like this and translate them into formal, general, mathematical proofs. A
proof is an argument that begins with a proposition (“there are more pigeons
than pigeonholes”) and proceeds using logical rules to establish a conclusion
(“some pigeonhole has more than one pigeon”). Although it may seem easier
to write (and understand!) an argument in plain English, ordinary language
can be imprecise or overly specific. So it is clearer, as well as more general,
to describe a mathematical situation in more formal terms.
For example, what does the statement
mean? It might mean that for every person in the world, there is someone
whom that person loves—so different lovers might have different beloveds.
In semi-mathematical language, we would state that interpretation as −
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:42 — page 12 —©#2Princeton University Press, 2018
i Please do not circulate. i
But there is another interpretation of (2.1), namely that there is some special
person whom everybody loves, or in other words,
There is a big difference between these interpretations, and one of the pur-
poses of mathematical language is to resolve such ambiguities of natural
language.
The phrases “for all,” “for any,” “for every,” “for some,” and “there exists”
are called quantifiers, and their careful use is an important part of mathe-
matical discourse. The symbol ∀ stands for “for all,” “for any,” or “for every,”
and the symbol ∃ stands for “there exists” or “for some.” Using these symbols
saves time, but in writing mathematical prose they can also make statements
more confusing. So we will avoid them until we discuss the formalization of
quantificational logic, in Chapter 12.
Quantifiers modify predicates, such as “A loves B.” A predicate is a tem-
plate for a proposition, taking one or more arguments, in this case A and B.
On its own, a predicate has no truth value: without knowing the values of
A and B, “A loves B” cannot be said to be either true or false. It takes on a
truth value only when quantified (as in (2.2) and (2.3)), or when applied to
specific arguments (for example, “Romeo loves Juliet”), and may be true for
some arguments but false for others.
Let’s continue with a simple example of a mathematical statement and its
proof.
Theorem 2.4. Odd Integers. Every odd integer is equal to the difference
between the squares of two integers.
First, let’s make sure we understand the statement. An odd integer is any
integer that can be written as 2k + 1, where k is also an integer. The square of
an integer n is n2 = n · n. For every value of k, Theorem 2.4 says that there are
two integers—call them m and n—such that if we square them and subtract
one result from the other, the resulting number is equal to 2k + 1. (Note the
quantifiers: for every k, there exist m and n, such that . . . .)
An integer m is said to be a perfect square if it is the square of some integer,
so a compact way to state the theorem is to say that every odd integer is the
difference of two perfect squares. It is typical in mathematics, as in this case,
that defining just the right concepts can result in very simple phrasing of
general truths.
The next step is to convince ourselves of why the statement is true. If the
reason is not obvious, it may help to work out some examples. So let’s start
−1 by listing out the first few squares:
0
1
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:42 — page 13 —©#3Princeton University Press, 2018
i Please do not circulate. i
02 = 0
12 = 1
22 = 4
32 = 9
42 = 16.
We can confirm that the statement is true for a few specific odd integers,
say 1, 3, 5, and 7:
1 = 1 − 0 = 12 − 0 2
3 = 4 − 1 = 2 2 − 12
5 = 9 − 4 = 3 2 − 22
7 = 16 − 9 = 42 − 32 .
After these examples we might notice a pattern: so far, all of the odd integers
are the difference between the squares of two consecutive integers: 0 and 1,
then 1 and 2, 2 and 3, and 3 and 4. Another observation—those consecutive
integers add up to the target odd integer: 0 + 1 = 1, 1 + 2 = 3, 2 + 3 = 5,
and 3 + 4 = 7. So we might conjecture that for the odd integer 2k + 1, the
integers that should be squared and subtracted are k + 1 and k. Let’s try that:
(k + 1)2 − k2 = k2 + 2k + 1 − k2 ,
which simplifies to 2k + 1.
So our guess was right! And by writing it out using the definition of an
odd integer (2k + 1) rather than looking at any specific odd integer, we’ve
confirmed that it works for all odd integers. It even works for negative odd
integers (since those are equal to 2k + 1 for negative values of k), although
the idea was inspired by trying examples of positive odd integers.
This chain of thought shows how we might arrive at the idea, but it’s too
meandering for a formal proof. The actual proof should include only the
details that turned out to be relevant. For instance, the worked-out examples
don’t add anything to the argument—we need to show that the statement is
true all the time, not just for the examples we tried—so they should be left
out. Here is a formal proof of Theorem 2.4:
Proof. Any odd integer can be written as 2k + 1 for some integer k. We can
rewrite that expression:
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:42 — page 14 —©#4Princeton University Press, 2018
i Please do not circulate. i
Before examining the substance of this proof, a few notes about its style.
First, it is written in full sentences. Mathematical expressions are used for
precision and clarity, but the argument itself is written in prose. Second,
its structure is clear: it starts with the given assumption, that the integer is
odd, and clearly identifies when we have reached the end, by noting that m
and n are the two integers that we sought. Third, it is rigorous: it gives a
mathematical definition for the relevant term (“odd integer”), which forces
us to be precise and explicit; and each step of the proof follows logically and
clearly from the previous steps.
Finally, it is convincing. The proof gives an appropriate amount of detail,
enough that the reader can easily understand why each step is correct, but
not so much that it distracts from the overall argument. For example, we
might have skipped writing out some of the arithmetic, and stated just that
2k + 1 = (k + 1)2 − k2 .
But this equality is not obvious, and a careful reader would be tempted
to double-check it. When we include the intermediate step, the arithmetic
is clearly correct. On the other hand, some assumptions don’t need to be
proven—for example, that it is valid to write
2k + 1 = (k2 + 2k + 1) − k2 .
This relies on the fact that if we move the terms around and group them
in different ways, they still add up to the same value. In this context, these
rules seem rather basic and can be assumed; proving them would distract
the reader from the main argument. But in a text on formal arithmetic, these
properties might themselves be the subject of a proof. The amount of detail
to include depends on the context and the proof ’s intended audience; as a
rule of thumb, write as if you are trying to convince a peer.
Let’s return now to the substance of the above proof. First, it is construc-
tive. The statement to be proved merely asserts the existence of something:
it says that for any odd integer, there exist two integers with the prop-
erty that the difference of their squares is equal to the number we started
with. A constructive proof not only demonstrates that the thing exists, but
shows us exactly how to find it. Given a particular odd integer 2k + 1,
the proof of Theorem 2.4 shows us how to find the two integers that have
the property asserted in the statement of the theorem—one is k + 1 and the
other is k. For example, if the odd integer we wanted to express as the differ-
ence of two squares was 341, the proof shows that we can subtract 1 from 341
and divide by 2, and that integer and the next larger integer are the desired
−1 pair—170 and 171. This is easy to check:
0
1 1712 − 1702 = 29241 − 28900 = 341.
i i
i i
i i
Copyright
“525-76072_ch01_1aP” — 2018/10/6 — 14:42 — page 15 —©#5Princeton University Press, 2018
i Please do not circulate. i
There was no real need to check this particular case, but doing so makes us
more confident that we didn’t make an algebraic mistake somewhere.
In general, a procedure for answering a question or solving a problem is
said to be an algorithm if its description is sufficiently detailed and precise
that it could, in principle, be carried out mechanically—by a machine, or
by a human being mindlessly following instructions. A constructive proof
implicitly describes an algorithm for finding the thing that the proof says
exists. In the case of Theorem 2.4, the proof describes an algorithm that,
given an odd integer 2k + 1, finds integers m and n such that m2 − n2 =
2k + 1.
Not every proof is constructive—sometimes it is possible to show that
something exists without showing how to find it. Such a proof is called
nonconstructive. We will see some interesting examples of nonconstructive
proofs—in fact, the proof of the Pigeonhole Principle will be nonconstruc-
tive, since it cannot identify which pigeonhole has more than one pigeon.
But computer scientists love constructive arguments, because a construc-
tive proof that something exists yields an algorithm to find it—one that a
1 A stronger meaning of the term “con- computer could be programmed to carry out.1
structive” is used in the school of con- One final note about Theorem 2.4. The proof not only is constructive,
structive mathematics, which disallows
any mathematical argument that does but proves more than was asked for. It shows not just that every odd integer
not lead to the construction of the thing is the difference of two squares, but that every odd integer is the difference of
that the argument says exists. In con- the squares of two consecutive integers, as we noted while working through
structive mathematics it is impermissi-
ble to infer from the fact that a statement
the examples. After finishing a proof, it is often worth looking back at it to
is demonstrably false that its negation is see if it yields any interesting information beyond the statement it set out to
necessarily true; the truth of the nega- prove.
tion has to be demonstrated directly.
For example, constructive mathemat- .
ics disallows proofs by contradiction
(explained below) and arguments like A common goal in mathematical proof is to establish that two state-
that of Problem 2.14. Computer scien- ments are equivalent—that one statement is true in all the circumstances
tists prefer arguments that yield algo-
rithms, but generally don’t insist on in which the second statement is true, and vice versa. For example, consider
“constructive proofs” in the strict sense the statement
used by constructive mathematicians.
For us, to show something is true it suf-
The square of an integer is odd if and only if the integer itself is
fices to show that its negation is not true.
odd.
i i
i i
Other documents randomly have
different content
Peak, imperial in his majesty, dark below with pines and firs, but his
bald head crowned with eternal snows, looking calmly down, as if
God's sentinel keeping watch and ward over all below. Altogether
the grouping of the landscape there is very fine, as if the gods had
done their best; and on the glorious morning when we saw it,
beneath a perfect September sky, we thought Colorado had indeed
here much to be supremely proud of.
Some three miles farther on, near the banks of the Fontaine qui
Bouilli, which here comes boiling down from the foot of Pike's Peak,
there are several fine natural soda-springs. They come bubbling up
on either side of the stream from the far depths below, and their
overflow during the long ages has deposited large rocks of
calcareous tufa or carbonate of soda all about them. We tried this
soda-water, and found it as cool, and as sharp and titillating as that
from a city-fountain; and when treated with an acid, it effervesced
and vanished quite as freely. H—— and B—— tried it with lemons
and whiskey and reported their cocktails quite unequalled since
leaving New York. Col. Chivington, of Sand Creek memory, had
recently purchased these springs and the land adjacent for three
thousand dollars; but he was now asking ten thousand, though there
had not been a dollar expended for improvements yet. Combined
with Pike's Peak, the Garden of the Gods, and all the unique and
romantic scenery from there to Denver, as well as the general Plains
and Mountains, the investment did not seem to be a bad one, and
no doubt will pay handsomely some day. But it was then waiting the
completion of the Pacific Railroad, and the in-pouring of population,
that all Coloradoans then devoutly hoped and prayed for.[6]
Just beyond the Soda Springs, stood or rather slept Colorado City.
We had been so unfortunate as to break our ambulance-tongue in
pulling out of a mud-hole, and halted there to have a new one
made. In the days of 1857-60, when mining centred at Pike's Peak,
Colorado City was the Denver of southwestern Colorado, and must
have been a place of considerable importance. But the "diggings"
there long since gave out, and C. C. was now in a bad way. Corner-
lots were for sale, dirt-cheap. It had plenty of empty shanties, but
scarcely any population; and what it had, were the sleepiest-looking
Coloradoans we had yet seen anywhere. The "hotel" or tavern, was
forlorn and dirty; the people, idle and listless; and the "City," as a
whole, was evidently hastening fast to the status of Goldsmith's
Deserted Village. Cañon City, farther up in the mountains, they told
us, was even worse off—having no inhabitants at all. It had good
buildings, some even of brick and stone, equal indeed to any in
Colorado; but all stood empty, like "some banquet-hall deserted,"
and the once busy "City" was now as silent as Thebes or Petræ.
Such is life in our mining regions. Population comes and goes, as
restless as the sea, according as the "diggings" promise good "pay-
dirt" or bad. And what are prosperous and busy centres this year,
next year may become empty and deserted.[7] At sunset we went
into camp on the banks of the Fontaine qui Bouilli, while a snow-
squall was careering around Pike's Peak. Several of these had been
prancing about his summit during the afternoon, and about five p.
m., one of them swept down over the foothills and valley, with far
out-stretched wings, giving us a taste of its icy breath as we
journeyed by. At sunset the hues along the mountains and among
the snow-peaks were magnificent and glorious; but the air became
keen and nipping as night fell, and all the evening we hugged the
fire closely. Just before dark, while supper was cooking, two or three
of us tried the Fontaine qui Bouilli for trout, and caught—not a nibble
even!
Soon after leaving Colorado City the mountains trend away to the
southwest, while the road to Fort Garland continues on down the
Fontaine qui Bouilli to the Arkansas. Fording this at Pueblo, and
subsequently its two affluents, the Greenhorn and the Huerfano, you
again strike the mountains, a hundred miles farther south, at the
foot of Sangre del Christo Pass. The high ridges or "divides" between
all of these streams are barren and sterile, to an extent little
imagined in the east; but the streams themselves are bordered by
broad valleys, rich and fertile, that as a rule need only irrigation to
produce luxuriantly. In some seasons they do not require even this,
as their proximity to the mountains affords them rains enough. Still,
no farmer is safe there without his system of acequias or water-
ditches, to irrigate if necessary; and we found these everywhere
constructed, if not in use, where settlements had been made. In all
of these valleys we already had scattered ranches—some of them
very large—and raised wheat, barley, corn, oats, etc. in considerable
quantities. Colorado had formerly imported all her grain and flour
from the Missouri, at an enormous cost; but latterly she had drawn
large supplies from these fertile valleys, and in '66 considered herself
about self-sustaining. Not more than one-tenth, or less, of her arable
land here, however, seemed to be under cultivation, and agriculture
even then was of the rudest and simplest. The ranchmen were
mainly Americans or Germans, but the labor was all performed by
Mexican peons, subjected for generations to but one remove from
slavery. It was the threshing season, and in many places we saw
them treading out their wheat and barley by mules, with a Greaser
on the back of each, lazily whiffing his cigarrito, while his donkey
dozed around. Elsewhere, their threshing done, we saw them
winnowing their grain by hand, as the breeze chanced along. We did
not see or hear of a threshing-machine or a fanning-mill in the whole
region there, and doubt if there was one. The Mexicans do not
comprehend these nineteenth century new-fangled notions, and will
have none of them. They prefer by far their old-time dolce far
niente. Festina lente is their national maxim, and your thorough-bred
peon would choose a broncho rather than a locomotive any day. And
naturally enough, the American settlers here, we found, were mostly
from the south, and during the war had been none too ardent for
the Union.
Most of the farms here were large in size, and in crossing the
Greenhorn we passed through a noble ranch, twelve miles wide by
eighteen long, owned by a Mr. Zan Hincklin. In '65 he sold his crop
of grain for eighty thousand dollars, and in '66 expected to do even
better. He had on hand a thousand horses, three thousand head of
cattle, and six thousand sheep, all of which he grazed the year
round. He lived very plainly, in a rude adobe hut, that we should
think hardly fit for a canal-laborer east; but was as hospitable and
generous as a prince. We had scarcely gone into camp, on the banks
of the rippling Greenhorn, before he sent us over butter, eggs, and
vegetables, and bade us welcome to his heart and home. He
acquired his great estate by marrying one of the half-breed
daughters of the celebrated John Brent, who used to hunt and trap
all through this region, and who lived so long among the Indians
that he became himself half Red-Skin. He died possessed of vast
tracts of land here, acquired chiefly through trading with the Indians,
but his children it appeared, as a rule, had turned out poorly. One of
his sons had returned to Indian life, joining a wandering tribe, and
others still hung about the settlements, of small account to anybody.
From the Arkansas, the country gradually but constantly ascends,
until you strike the mountains again at the foot of Sangre del Christo
Pass. Here you follow up a dashing rivulet, that courses away to the
Huerfano, and advantage is taken of a depression in the main ridge
to cross into San Luis Park. We camped the night before in a
sheltered nook among the foot-hills, surrounded on three sides by
gnarled piñon trees, while the fourth opened on a little plateau
sloping down to a noisy brook, that afforded water and grass in
abundance. The next morning we breakfasted early, and were off up
the Pass soon after sunrise. The morning air was nipping, and as we
advanced we found the mists rolling down the mountains, and so off
over the Plains eastward. The teams being a little slow that morning
in packing up and getting off, some of us concluded to walk on; but
we had not proceeded far, before some one suggested this might be
dangerous, as Indians were reported about, and our arms were all
behind in the ambulances. Halting, therefore, for the rest to come
up, two of us then secured our Spencers and six-shooters, and
mounting one a horse and the other a mule pushed on ahead again.
The ascent, though gentle, we found nevertheless very constant,
and gradually the ambulances dropped much behind. The road led
over a shelving plateau, and up a pretty sharp hill, and then plunged
by a rapid descent into a little valley again. Here we met several
men, with a drove of indifferent cattle and sheep, en route from
Culebra to Denver and a market. Climbing out of this valley, we
struck a sharp ascent, that led southward along and up the ridge,
and then turning west by south struck straight across the summit. As
we raised the summit, a keen, fierce wind met us from the west, and
soon set our teeth to chattering in unison with it. On the tip-top we
found a contractor's train, en route to Fort Garland with supplies,
doubling up ox-teams and doing its "level best" to forge slowly
ahead. The summit or ridge, the tip-top of the Rocky Mountains—the
very backbone of America here—we found only a few hundred yards
across; and then we came out on the western slope, with all the
glories of the San Luis Park nestling at our feet, or uprising
gorgeously before us. Below, the Park lay wrapped in a dreamy
haze, with the Sangre del Christo creek flashing onward through it;
above, peak on peak—huge, snow-white, and sublime—rimmed it
round, as with a crown. Over all, hung one of those blue and
faultless skies, for which the Rocky Mountains are so world-famous,
with the sun sweeping majestically through it, while God himself
seemed ready to speak on every side. This was to the west. Turning
to the east, the view there seemed, if possible, even more grand and
sublime. Peak and ridge, plateau and foot-hill, stretched away
beneath us; in the distance the brace of Spanish Peaks, two bold
"buttes" passed the day before, shot up abruptly six thousand feet
into the sky, from the dead level of the Plains around them; while
beyond and around to the dim horizon, east, north, and south, for
hundreds of miles, outstretched the illimitable Plains. The elevation
of the Pass is given, as about ten thousand feet above the sea. At
our feet, the fog was breaking up and rolling off eastward in sullen
masses, which the morning sun gilded with glory, or here and there
pierced through and through down to the earth beneath. Soon it
passed away into airy clouds, careering along the sky, and presently
vanished altogether. And then the Plains! The Plains! How their
immense outstretch absorbed and overwhelmed the eye! It was not
the ocean, but something much grander and vaster, than even the
ocean seems. If you could view the sea from the same altitude,
doubtless the impression would be much the same. But what is the
loftiest mast-head, compared with the summit of Sangre del Christo?
The grandeur and sublimity of the scene awed one into silence, as if
in the presence of Deity himself, and the great and holy thoughts of
that hour well repaid us for all our toil and fatigue. Say what we
may, there is something gracious and ennobling in such mountain
scenery, which men can illy dispense with. How it deepens and
widens one's feelings! How it broadens and uplifts one's thoughts!
How it strengthens—emboldens—one's manhood! What Switzerland
is to Europe, and New England to the Atlantic States, this and more,
the whole Rocky Mountain region will yet become to America.
Descending the mountains westward, a ride of a mile or two brought
us to a spring, where a Mexican was taking his noon-day meal of
tortillas, while his inevitable mule was cropping the grass near by. H.
dismounted and scooped up a drink with his hands, Indian fashion,
but I was not yet thirsty enough for that. A mile or two farther, still
descending, brought us to the head of Sangre del Christo creek, a
dashing rivulet fed by snow streams, that runs thence to the Rio
Grande. A winding defile or cañon, of steady though not very rapid
descent, affords a bed-way down the Pass and out into the San Luis
Park, and down this the wild little creek shoots very serpentinely. It
crosses the road no less than twenty-six times in ten miles, and
constantly reminds you of the famous Yankee fence, which was
made up of such crooked rails, that when the pigs crept through it
they never exactly knew whether they were inside or out! We jogged
leisurely down the creek, until we judged we were some six or seven
miles from the summit, and perhaps half way down the mountain,
when we halted for the teams to come up. The wind blew sharply up
the Pass still, though it was now much after noon, and we found the
shelter of a neighboring ravine very welcome. Here we unsaddled
our animals, and turned them loose to graze. They fed up and down
the ravine, cropping the rich herbage there, but would never stray
over a hundred yards or so away, when they would turn and graze
back to us again. On such mountain trips saddle-animals become
attached to their riders, and will seldom leave of their own accord.
So, also, they are unerring sentinels, and always announce the
approach of Indians or others with a neigh or bray. Building a royal
fire with the dry fir-trees there, we next spread our saddle-blankets
on the ground, and then with our saddles under our heads, and our
feet Indian-fashion to the fire, smoked and talked until the rest
arrived. About two p. m. I noticed Kate (my mule) stop grazing and
snuff the air, very inquiringly; presently, with a whisk of her tail and
a salutatory bray, she darted down the ravine, as if thoroughly
satisfied; and in a minute or two along came the ambulances, with
our friends chilled through, despite their robes and blankets. All
tumbled out to stretch their benumbed limbs, and we ate lunch
around our impromptu fire grouped very picturesquely.
Meanwhile about everybody nearly had got "trout on the brain." We
had caught frequent glimpses of the speckled beauties, as we
crossed Sangre del Christo creek or rode along its banks, and
concluded to go into camp early, so as to try our luck with a fly or
two. A good camping place was found a mile or two farther on, near
the foot of the Pass, and here while supper was preparing, several of
us rigged up our lines and started off. H. and I were most
unfortunate; we whipped the stream up and down quite a distance,
but came back fishless. H. caught a bite, and I several nibbles, but
neither of us landed a trout. We could see plenty of them, young
dandies, darting about in the black pools, or, old fogies, floating
along by the banks; but they were Arcadian in their tastes, and
disdained the fancy flies we threw them. Dr. M. and L., however, had
better luck. The spirit of good Isaak Walton seemed to rest upon and
abide with them. They caught a dozen or more, of handsome
mountain trout, weighing from two to three pounds each, and the
next morning when brought on our rude table for breakfast, hot and
smoking from the fire, nothing could have been more savory and
delicious. Gen. B. and L. turned cooks for the occasion, and judged
by the result Delmonico might have envied them. Their broiled trout,
fresh from the brook and now piping hot, buttered and steaming,
assailed both eye and palate at once, and we awarded them the
palm, nem. con.
The weather that day, from noon on, had grown steadily colder,
though the sun shone unclouded most of the time, and before we
got our camp well pitched a snow-squall struck us. The flakes came
thick and fast for awhile, but presently passed away, though more or
less continued sifting downward until nightfall. Farther up the Pass,
around the crest of the mountains, snow-squalls marched and
countermarched most of the afternoon, and at sunset the air grew
nippingly cold, even down where we were. We soon pitched our
tent, and built a glorious fire in front of it; but that not sufficing,
supper once over, we carried our sheet-iron cooking-stove inside,
and all huddled about that. When bed-time came, blankets, buffalo-
robes and great-coats were all in demand; yet in spite of all, we
passed a sorry night of it, and morning dawned at last greatly to our
relief.
We reached Fort Garland next day (Sept. 20) about one, p. m.,
without meeting a single Indian, either hostile or friendly. Denver, as
before said, had warned us to be on our guard, and we tried to be;
but all reported dangers vanished as we advanced—Munchausen
after Munchausen exploding in turn. From the Huerfano across the
mountains to Garland, some fifty miles or more, there was but a
single ranch, and scarcely anybody on the road. A Mexican on foot
and another on a donkey were emigrating to the Huerfano, and at
one point we encountered a whole family similarly engaged.
Paterfamilias, whiffing his cigarito, led a diminutive broncho
(Mexican for jackass) about the size of a spring calf, on which sat his
household gods, to wit, his Señora also smoking, with a child before
and another behind her—all of them astride. Another broncho of
about the same size followed on behind, loaded down with clothing,
bedding, and various domestic utensils until there was but little to be
seen of him except his legs. What the locomotive is to the Yankee,
and the horse to the borderer, that the broncho is to the Mexican,
and the two seem alike fitted for each other and inseparable. His
patient little beast costs but little, and when stopping browses by the
wayside the best it may, while Don Quixote himself sits basking in
the sunshine. The serene and infinite content of a Mexican peon, as
he sits thus wrapped in his poncho or serape, sucking his everlasting
cigarrito, no American can imagine. His dignity is as perfect as that
of a Castilian; but the stolidity of his brain, who shall describe?
Some fifteen miles or so from Fort Garland, in the heart of the San
Luis Park, lies San Luis de Culebra, a hamlet of five or six hundred
people, and I believe, the most considerable "city," there. You strike
the Park proper some distance east of Fort Garland, and from there
to Culebra the country is substantially a dead-level. Culebra was
then a genuine Mexican town without an atom of the Yankee in or
about it, and seemed a thousand years old, it was so sleepy, though
comparatively a new settlement. Its houses were all one-story
adobes, with chimneys in the corner, in the true Mexican style, and
were all grouped about a central "plaza," of course, or the town
would not be Mexican. All Southern Colorado, it will be remembered,
formerly belonged to New Mexico, and hence these Mexican
settlements here and beyond. The people raised wheat, barley, and
oats to some extent; but depended on their flocks and herds chiefly
for support. We entered Culebra at dark, amidst a multitudinous
chorus of dogs, and halted at the house of Capt. D. a bright
German, formerly an officer of New Mexican Volunteers, but who
had recently married a Culebra señorita and settled there. He gave
us an excellent supper, after which we all adjourned to a "baille," or
Mexican Ball, gotten up especially in honor of Gen. Sherman and
Gov. Cumming, but which Sherman was unable to attend. Several of
his staff-officers, however, and the governor were present, and these
with the rest of us made up quite a party. These bailles are great
institutions among the New Mexicans, who retain all the old Spanish
fondness for music and dancing, and are ready for a "baille," any
time. The Culebrans had already had two or three that week, but got
up the Sherman-Cumming one on short notice and in grand style.
The only thing necessary was to engage a room and music, and
send a runner through the village, to announce a baille was on the
tapis, and the whole population—men, women, children, dogs, and
fleas—were sure to be there. At the primitive hour of eight p. m. the
people began to assemble, and by nine p. m. the baille was in full
blast. The ball-room itself was an adobe building, one-story high,
perhaps fifty feet long by thirty wide, with a dirt floor, and seats all
around. At the farther end was a rude bar, with a transparency over
it, bearing the motto, "Limonade and Egg-nog," at which each
cavalier was expected to treat his lady from time to time. Near this
was a rough platform for the musicians, who consisted of three or
four violinists, led by an irrepressible guitarist—blind and quite a
character in his way. As the evening progressed, he worked himself
up into an ecstacy of enthusiasm, and then, with his eyes "in fine
phrensy rolling," improvised words to every piece they played. He
appeared perfectly absorbed and carried away with playing and
singing, and when a dance ended seemed quite exhausted. No
bone-ist, or tambourine-ist, in a troupe of minstrels east, ever
performed with more thorough and reckless abandon. His head was
thrown back; his eye-balls rolled wildly: his coarse, matted, coal-
black hair swept his shoulders: his long and bony fingers fairly flew
up and down his quivering guitar: while his shrill, piping, tenor voice
rose and fell above the music, in thorough unison with the general
scene. Later in the evening, after frequent potations of egg-nog,
Don Jesus, (for that was his name) became immensely funny, and
his gyrations amused us greatly.
With the first sound of the violins, the couples took the floor, and
kept it up vigorously to the "wee sma' hours." The older people
participated less, but young and old were all there, apparently the
whole population, in their best "bib and tucker." Women came
carrying their infants, and others held the babies while their mothers
danced. The younger people, down to mere boys and girls, of
course, all danced. First came some slow, stately Spanish dances;
but presently they slid into schottisches and polkas, and performed
these with a vigor worthy of New York or Paris. Many present were
dressed humbly, and but few comparatively were well dressed; but
ornaments abounded, and the baille or fandango seemed to put all
on an equality. Most of our party selected partners, and soon were
lost in the maze and whirl. True, they could not speak a word of
Spanish, nor their señoritas any English; but that did not matter, as
the Mexicans regard it as a mark of ill-breeding to converse while
dancing. Their manner of saluting each other, when first they met,
was unique and original, to wit: the sexes poked their heads over
each other's shoulders, and took a good old fashioned hug.
Throughout the evening, of course, there was a total absence of
indecorum. As a whole, they seemed to be honest, simple folk, who
took life as it came, without fret or worriment, and enjoyed
themselves greatly. There was less beauty among the women, but
more intelligence among the men, than we expected; their
hospitality was hearty and generous—they did their best to give us a
pleasant evening; and altogether the baille at Culebra was an event
long to be remembered. I left Gov. C. at 11 p. m., looking on and
enjoying it, and went to sleep on a good wool bed—the only kind
used there—in a comfortable room, for the first time since leaving
Denver.
CHAPTER VII.
AMONG THE MOUNTAINS (Continued).
At Fort Garland, in San Louis Park, Sept 21st, Gov. Cumming, Gen.
Sherman, and the famous Kit Carson (then Bv't. Brig. Gen. U. S.
Vols.), met in council, concerning the Utes and the Indian question
generally. Sherman, as elsewhere intimated, was then in the midst
of a long tour by ambulance, through the heart of the Indian country
embraced in his then Military Division, and as he had already
travelled about 1200 miles, with no escort except a couple of staff-
officers and the necessary teamsters, without seeing a hostile Red
Skin, he was getting to be somewhat skeptical on the whole Indian
subject. The grand Treaty with the Utes was to come off Sept. 22d
and 23d on the banks of the Rio Grande, some thirty miles
northwest from Fort Garland; but as Sherman had decided to leave
Garland on the 22d for his return east via the Arkansas, a
preliminary council was called at Fort Garland on the 21st. Runners
had been sent out a day or two before, and the Big Chiefs of the
Utes kept arriving all that day. The council was held late in the
afternoon, in a large room back of the commandant's quarters. The
chiefs were grouped on one side of the room, squat upon their
haunches, grave and dignified; while on the other sat Sherman in
loose uniform, puffing a cigar, with Gov. Cumming on one side and
Kit Carson on the other. Carson served as interpreter, speaking
Mexican well, which the chiefs mostly understood. After some
preliminary skirmishing, Sherman said he had called them together
to ascertain whether the Utes were willing to quit their nomadic life
and settle down on a Reservation. He urged this upon them, as their
true interest, if they wished to maintain their tribal existence, and
said he had only come among them to promote their happiness and
welfare. He added, he had recently been visiting many other tribes
with the same object and purposes, and as a friend to their race was
convinced their only hope for the future lay in going on a
Reservation. The chiefs debated the matter among themselves for
awhile, and presently made answer, that they thanked the Big
Warrior for his suggestions and approved them; but that their young
men were opposed to such a policy, and they feared it would be
difficult to persuade the Utes of its wisdom, until the Cheyennes and
Comanches—their hereditary foes—had first adopted it. The council
lasted an hour or more, with much skillful fencing and adroit
diplomacy on the part of Ooray and Ancantash, the head-chiefs; but
this was the substance of all that Sherman could worm out of them.
He tried to explain and reason with them in various ways, but at last
broke up the council in disgust, and blurted out in his peculiar way,
as he strode back to his quarters, "They will have to freeze and
starve a little more, I reckon, before they will listen to common
sense!" Subsequently he told us of a council that he had held about
a fortnight or so before, at Fort Laramie or somewhere up there,
with the Arrapahoes or the Sioux. He had urged upon the chiefs,
that their white brothers were opposed to war and desired peace,
and he hoped there would be no more bloodshed in that region
between the Red Man and the Pale Face. The chiefs presently
replied, with a wariness worthy of Talleyrand, that they reciprocated
his Quaker sentiments, and would do all in their power to enforce
them; but that their young men were rash and fiery sometimes, and
it might be difficult to hold them in. "Well, then," said Sherman to
the interpreter, firing up, "Tell the rascals so are mine; and if another
white man is scalped in all this region, it will be impossible to hold
mine in." The chiefs saw the point, and no doubt sagely concluded
they would have trouble, if ever they got Tecumseh Sherman fairly
after them.
The grand Treaty with the Utes came off, as I have said, on Sept.
22d and 23d, on the banks of the Rio Grande, some thirty miles or
so northwest from Fort Garland. We left Garland early in the morning
by ambulance, and reached the treaty ground soon after noon. Gov.
Cumming and Indian Agent Hunt had preceded us, and on arriving
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com