09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

72 INTEGER FUNCTIONS<br />

An important special case of this theorem is worth noting explicitly:<br />

if m and n are integers and the denominator n is positive. For example, let<br />

m = 0; we have [l[x/lO]/lOJ /lOI = [x/1000]. Dividing thrice by 10 and<br />

throwing off digits is the same as dividing by 1000 and tossing the remainder.<br />

Let’s try now to prove or disprove another statement:<br />

This works when x = 7~ and x = e, but it fails when x = 4; so we know that<br />

it isn’t true in general.<br />

Be<strong>for</strong>e going any further, let’s digress a minute to discuss different “levels”<br />

of questions that can be asked in books about <strong>mathematics</strong>:<br />

Level 1. Given an explicit object x and an explicit property P(x), prove that<br />

P(x) is true. For example, “Prove that 1x1 = 3.” Here the problem involves<br />

finding a proof of some purported fact.<br />

Level 2. Given an explicit set X and an explicit property P(x), prove that<br />

P(x) is true <strong>for</strong> all x E X. For example, “Prove that 1x1 < x <strong>for</strong> all real x.”<br />

Again the problem involves finding a proof, but the proof this time must be<br />

general. We’re doing algebra, not just arithmetic.<br />

Level 3. Given an explicit set X and an explicit property P(x), prove or<br />

disprove that P(x) is true <strong>for</strong> all x E X. For example, “Prove or disprove In my other texts<br />

that [ml = [J;;] <strong>for</strong> all real x 2 0.” Here there’s an additional level ~~se~~~~nr($<br />

of uncertainty; the outcome might go either way. This is closer to the real Same as ~~~~~~~~~<br />

situation a mathematician constantly faces: Assertions that get into books about 99.44% df<br />

tend to be true, but new things have to be looked at with a jaundiced eye. If<br />

the statement is false, our job is to find a counterexample. If the statement<br />

is true, we must find a proof as in level 2.<br />

the time; but not<br />

in this book.<br />

Level 4. Given an explicit set X and an explicit property P(x), find a necessary<br />

and suficient condition Q(x) that P(x) is true. For example, “Find a<br />

necessary and sufficient condition that 1x1 3 [xl .” The problem is to find Q<br />

such that P(x) M Q(x). Of course, there’s always a trivial answer; we can<br />

take Q(x) = P(x). But the implied requirement is to find a condition that’s as<br />

simple as possible. Creativity is required to discover a simple condition that But no simpler.<br />

will work. (For example, in this case, “lx] 3 [xl H x is an integer.“) The<br />

extra element of discovery needed to find Q(x) makes this sort of problem<br />

more difficult, but it’s more typical of what mathematicians must do in the<br />

“real world!’ Finally, of course, a proof must be given that P(x) is true if and<br />

only if Q(x) is true.<br />

-A. Einstein

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

Saved successfully!

Ooh no, something went wrong!