15.12.2012 Views

Why Read This Book? - Index of

Why Read This Book? - Index of

Why Read This Book? - Index of

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

56 Chapter 2 Properties <strong>of</strong> Real Numbers<br />

EXERCISE 2.3.10 For all real numbers x and y, � �|x| − |y| � � ≤ |x − y|. 14<br />

Exercises 2.3.8–2.3.10 reveal how addition and subtraction relate to absolute<br />

value. The final exercise for this section reveals how multiplication and division<br />

relate to absolute value.<br />

EXERCISE 2.3.11 Suppose x and y are real numbers. Then the following are<br />

true.<br />

(a) |xy| = |x||y|.<br />

(b) If y �= 0, then � �y−1 � � = |y| −1 . 15<br />

(c) If y �= 0, then |x/y| = |x|/|y|.<br />

2.4 The Division Algorithm<br />

<strong>This</strong> section is devoted to one very important theorem about the integers. Even<br />

though it is called the division algorithm, it is not an algorithm in the sense <strong>of</strong><br />

computer science, where we think <strong>of</strong> an algorithm as a step-by-step process for<br />

performing a task. Instead, the division algorithm is merely a unique existence<br />

theorem, but a very useful one.<br />

One way to assign meaning to the words even integer and odd integer is the<br />

following.<br />

Definition 2.4.1 If n is an integer, we say that n is even provided there exists an<br />

integer k such that n = 2k. We say that n is odd provided there exists an integer k<br />

such that n = 2k + 1.<br />

Let’s prove some easy results about even and odd integers. Notice how the<br />

pro<strong>of</strong> <strong>of</strong> the first one appeals to the definition <strong>of</strong> even integer in both directions.<br />

First, when we are given that a particular integer n is even, then we can claim the<br />

existence <strong>of</strong> some integer k1 such that n = 2k1. Then, when we need to demonstrate<br />

that some integer p is even, we must be able to find some integer k2 such that<br />

p = 2k2.<br />

We present two slightly different pro<strong>of</strong>s <strong>of</strong> the next theorem to illustrate subtly<br />

different tastes for the flow <strong>of</strong> a pro<strong>of</strong>.<br />

Theorem 2.4.2 Let m and n be integers, at least one <strong>of</strong> which is even. Then mn<br />

is even.<br />

Pro<strong>of</strong> 1. Pick integers m and n, and suppose (without loss <strong>of</strong> generality) that<br />

n is even. Then there exists integer k1 such that n = 2k1. Thus we have that<br />

14 Apply Corollary 2.3.5 by writing the expression in Exercise 2.3.9 in two ways, once switching the roles<br />

<strong>of</strong> x and y.<br />

15 Use a technique like the pro<strong>of</strong> <strong>of</strong> Theorem 2.1.18.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!