# It is time to prove some theorems. There are various strategies for doing

Save this PDF as:

Size: px
Start display at page:

Download "It is time to prove some theorems. There are various strategies for doing"

## Transcription

1 CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it is important to keep in mind the meanings of three key terms: Theorem, proof and definition. A theorem is a mathematical statement that is true and can be (and has been) verified as true. A proof of a theorem is a written verification that shows that the theorem is definitely and unequivocally true. A proof should be understandable and convincing to anyone who has the requisite background and knowledge. This knowledge includes an understanding of the meanings of the mathematical words, phrases and symbols that occur in the theorem and its proof. It is crucial that both the writer of the proof and the readers of the proof agree on the exact meanings of all the words, for otherwise there is an intolerable level of ambiguity. A definition is an exact, unambiguous explanation of the meaning of a mathematical word or phrase. We will elaborate on the terms theorem and definition in the next two sections, and then finally we will be ready to begin writing proofs. 4.1 Theorems A theorem is a statement that is true and has been proved to be true. You have encountered many theorems in your mathematical education. Here are some theorems taken from an undergraduate calculus text. They will be familiar to you, though you may not have read all the proofs. Theorem: Let f be differentiable on an open interval I and let c I. If f (c) is the maximum or minimum value of f on I, then f (c) = 0. Theorem: If k=1 a k converges, then lim k a k = 0. Theorem: Suppose f is continuous on the interval [a, b]. Then f is integrable on [a, b]. Theorem: Every absolutely convergent series converges.

2 88 Direct Proof Observe that each of these theorems either has the conditional form If P, then Q, or can be put into that form. The first theorem has an initial sentence Let f be differentiable on an open interval I, and let c I, which sets up some notation, but a conditional statement follows it. The third theorem has form Suppose P. Then Q, but this means the same thing as If P, then Q. The last theorem can be re-expressed as If a series is absolutely convergent, then it is convergent. A theorem of form If P, then Q, can be regarded as a device that produces new information from P. Whenever we are dealing with a situation in which P is true, then the theorem guarantees that, in addition, Q is true. Since this kind of expansion of information is useful, theorems of form If P, then Q, are very common. But not every theorem is a conditional statement. Some have the form of the biconditional P Q, but, as we know, that can be expressed as two conditional statements. Other theorems simply state facts about specific things. For example, here is another theorem from your study of calculus. Theorem: The series diverges. It would be difficult (or at least awkward) to restate this as a conditional statement. Still, it is true that most theorems are conditional statements, so much of this book will concentrate on that type of theorem. It is important to be aware that there are a number of words that mean essentially the same thing as the word theorem, but are used in slightly different ways. In general the word theorem is reserved for a statement that is considered important or significant (the Pythagorean theorem, for example). A statement that is true but not as significant is sometimes called a proposition. A lemma is a theorem whose main purpose is to help prove another theorem. A corollary is a result that is an immediate consequence of a theorem or proposition. It is not important that you remember all these words now, for their meanings will become clear with usage. Our main task is to learn how to prove theorems. As the above examples suggest, proving theorems requires a clear understanding of the meaning of the conditional statement, and that is the primary reason we studied it so extensively in Chapter 2. In addition, it is also crucial to understand the role of definitions.

3 Definitions Definitions A proof of a theorem should be absolutely convincing. Ambiguity must be avoided. Everyone must agree on the exact meaning of each mathematical term. In Chapter 1 we defined the meanings of the sets N, Z, R, Q and, as well as the meanings of the symbols and, and we shall make frequent use of these things. Here is another definition that we use often. Definition 4.1 An integer n is even if n = 2a for some integer a Z. Thus, for example, 10 is even because 10 = 2 5. Also, according to the definition, 7 is not even because there is no integer a for which 7 = 2a. While there would be nothing wrong with defining an integer to be odd if it s not even, the following definition is more concrete. Definition 4.2 An integer n is odd if n = 2a + 1 for some integer a Z. Thus 7 is odd because 7 = We will use these definitions whenever the concept of even or odd numbers arises. If in a proof a certain number turns out to be even, the definition allows us to write it as 2a for an appropriate integer a. If some quantity has form 2b + 1 where b is an integer, then the definition tells us the quantity is odd. Definition 4.3 Two integers have the same parity if they are both even or they are both odd. Otherwise they have opposite parity. Thus 5 and 17 have the same parity, as do 8 and 0; but 3 and 4 have opposite parity. Two points about definitions are in order. First, in this book the word or term being defined appears in boldface type. Second, it is common to express definitions as conditional statements even though the biconditional would more appropriately convey the meaning. Consider the definition of an even integer. You understand full well that if n is even then n = 2a (for a Z), and if n = 2a, then n is even. Thus, technically the definition should read An integer n is even if and only if n = 2a for some a Z. However, it is an almost-universal convention that definitions are phrased in the conditional form, even though they are interpreted as being in the biconditional form. There is really no good reason for this, other than economy of words. It is the standard way of writing definitions, and we have to get used to it. Here is another definition that we will use often.

4 90 Direct Proof Definition 4.4 Suppose a and b are integers. We say that a divides b, written a b, if b = ac for some c Z. In this case we also say that a is a divisor of b, and that b is a multiple of a. For example, 5 divides 15 because 15 = 5 3. We write this as Similarly 8 32 because 32 = 8 4, and 6 6 because 6 = 6 1. However, 6 does not divide 9 because there is no integer c for which 9 = 6 c. We express this as 6 9, which we read as 6 does not divide 9. Be careful of your interpretation of the symbols. There is a big difference between the expressions a b and a/b. The expression a b is a statement, while a/b is a fraction. For example, 8 16 is true and 8 20 is false. By contrast, 8/16 = 0.5 and 8/20 = 0.4 are numbers, not statements. Be careful not to write one when you mean the other. Every integer has a set of integers that divide it. For example, the set of divisors of 6 is { a Z : a 6 } = { 6, 3, 2, 1,1,2,3,6 }. The set of divisors of 5 is { 5, 1,1,5 }. The set of divisors of 0 is Z. This brings us to the following definition, with which you are already familiar. Definition 4.5 A natural number n is prime if it has exactly two positive divisors, 1 and n. For example, 2 is prime, as are 5 and 17. The definition implies that 1 is not prime, as it only has one (not two) positive divisor, namely 1. An integer n is composite if it factors as n = ab where a, b > 1. Definition 4.6 The greatest common divisor of integers a and b, denoted gcd(a, b), is the largest integer that divides both a and b. The least common multiple of non-zero integers a and b, denoted lcm(a, b), is smallest positive integer that is a multiple of both a and b. So gcd(18,24) = 6, gcd(5,5) = 5 and gcd(32, 8) = 8. Also gcd(50,18) = 2, but gcd(50,9) = 1. Note that gcd(0,6) = 6, because, although every integer divides 0, the largest divisor of 6 is 6. The expression gcd(0, 0) is problematic. Every integer divides 0, so the only conclusion is that gcd(0, 0) =. We circumvent this irregularity by simply agreeing to consider gcd(a, b) only when a and b are not both zero. Continuing our examples, lcm(4,6) = 12, and lcm(7,7) = 7. Of course not all terms can be defined. If every word in a definition were defined, there would be separate definitions for the words that appeared in those definitions, and so on, until the chain of defined terms became circular. Thus we accept some ideas as being so intuitively clear that they require no definitions or verifications. For example, we will not find

5 Definitions 91 it necessary to define what an integer (or a real number) is. Nor will we define addition, multiplication, subtraction and division, though we will use these operations freely. We accept and use such things as the distributive and commutative properties of addition and multiplication, as well as other standard properties of arithmetic and algebra. As mentioned in Section 1.9, we accept as fact the natural ordering of the elements of N,Z,Q and R, so that (for example) statements such as 5 < 7, and x < y implies x > y, do not need to be justified. In addition, we accept the following fact without justification or proof. Fact 4.1 a + b Z a b Z ab Z Suppose a and b are integers. Then: These three statements can be combined. For example, we see that if a, b and c are integers, then a 2 b ca + b is also an integer. We will also accept as obvious the fact that any integer a can be divided by a non-zero integer b, resulting in a unique quotient q and remainder r. For example, b = 3 goes into a = 17 q = 5 times with remainder r = 2. In symbols, 17 = , or a = qb + r. This fact, called the division algorithm, was mentioned on page 29. (The Division Algorithm) Given integers a and b with b > 0, there exist unique integers q and r for which a = qb + r and 0 r < b. Another fact that we will accept without proof (at least for now) is that every natural number greater than 1 has a unique factorization into primes. For example, the number 1176 can be factored into primes as 1176 = = By unique we mean that any factorization of 1176 into primes will have exactly the same factors (i.e., three 2 s, one 3 and two 7 s). Thus, for example, there is no valid factorization of 1176 that has a factor of 5. You may be so used to factoring numbers into primes that it seems obvious that there cannot be different prime factorizations of the same number, but in fact this is a fundamental result whose proof is not transparent. Nonetheless, we will be content to assume that every natural number greater than 1 has a unique factorization into primes. (We will revisit the issue of a proof in Section 10.2.) We will introduce other accepted facts, as well as definitions, as needed.

6 92 Direct Proof 4.3 Direct Proof This section explains a simple way to prove theorems or propositions that have the form of conditional statements. The technique is called direct proof. To simplify the discussion, our first examples will involve proving statements that are almost obviously true. Thus we will call the statements propositions rather than theorems. (Remember, a proposition is a statement that, although true, is not as significant as a theorem.) To understand how the technique of direct proof works, suppose we have some proposition of the following form. If P, then Q. This proposition is a conditional statement of form P Q. Our goal is to show that this conditional statement is true. To see how to proceed, look at the truth table. P Q P Q T T T T F F F T T F F T The table shows that if P is false, the statement P Q is automatically true. This means that if we are concerned with showing P Q is true, we don t have to worry about the situations where P is false (as in the last two lines of the table) because the statement P Q will be automatically true in those cases. But we must be very careful about the situations where P is true (as in the first two lines of the table). We must show that the condition of P being true forces Q to be true also, for that means the second line of the table cannot happen. This gives a fundamental outline for proving statements of the form P Q. Begin by assuming that P is true (remember, we don t need to worry about P being false) and show this forces Q to be true. We summarize this as follows. Outline for Direct Proof If P, then Q. Proof. Suppose P.. Therefore Q.

7 Direct Proof 93 So the setup for direct proof is remarkably simple. The first line of the proof is the sentence Suppose P. The last line is the sentence Therefore Q. Between the first and last line we use logic, definitions and standard math facts to transform the statement P to the statement Q. It is common to use the word Proof to indicate the beginning of a proof, and the symbol to indicate the end. As our first example, let s prove that if x is odd then x 2 is also odd. (Granted, this is not a terribly impressive result, but we will move on to more significant things in due time.) The first step in the proof is to fill in the outline for direct proof. This is a lot like painting a picture, where the basic structure is sketched in first. We leave some space between the first and last line of the proof. The following series of frames indicates the steps you might take to fill in this space with a logical chain of reasoning. If x is odd, then x 2 is odd. Proof. Suppose x is odd. Therefore x 2 is odd. Now that we have written the first and last lines, we need to fill in the space with a chain of reasoning that shows that x being odd forces x 2 to be odd. In doing this it s always advisable to use any definitions that apply. The first line says x is odd, and by Definition 4.2 it must be that x = 2a + 1 for some a Z, so we write this in as our second line. If x is odd, then x 2 is odd. Proof. Suppose x is odd. Then x = 2a + 1 for some a Z, by definition of an odd number. Therefore x 2 is odd. Now jump down to the last line, which says x 2 is odd. Think about what the line immediately above it would have to be in order for us to conclude that x 2 is odd. By the definition of an odd number, we would have to have x 2 = 2a + 1 for some a Z. However, the symbol a now appears earlier in the proof in a different context, so we should use a different symbol, say b.

8 94 Direct Proof If x is odd, then x 2 is odd. Proof. Suppose x is odd. Then x = 2a + 1 for some a Z, by definition of an odd number. Thus x 2 = 2b + 1 for an integer b. Therefore x 2 is odd, by definition of an odd number. We are almost there. We can bridge the gap as follows. If x is odd, then x 2 is odd. Proof. Suppose x is odd. Then x = 2a + 1 for some a Z, by definition of an odd number. Thus x 2 = (2a + 1) 2 = 4a 2 + 4a + 1 = 2(2a 2 + 2a) + 1. So x 2 = 2b + 1 where b is the integer b = 2a 2 + 2a. Thus x 2 = 2b + 1 for an integer b. Therefore x 2 is odd, by definition of an odd number. Finally, we may wish to clean up our work and write the proof in paragraph form. Here is our final version. If x is odd, then x 2 is odd. Proof. Suppose x is odd. Then x = 2a+1 for some a Z, by definition of an odd number. Thus x 2 = (2a+1) 2 = 4a 2 +4a+1 = 2(2a 2 +2a)+1, so x 2 = 2b + 1 where b = 2a 2 + 2a Z. Therefore x 2 is odd, by definition of an odd number. At least initially, it s generally a good idea to write the first and last line of your proof first, and then fill in the gap, sometimes jumping alternately between top and bottom until you meet in the middle, as we did above. This way you are constantly reminded that you are aiming for the statement at the bottom. Sometimes you will leave too much space, sometimes not enough. Sometimes you will get stuck before figuring out what to do. This is normal. Mathematicians do scratch work just as artists do sketches for their paintings.

9 Direct Proof 95 Here is another example. Consider proving following proposition. Let a, b and c be integers. If a b and b c, then a c. Let s apply the basic outline for direct proof. To clarify the procedure we will write the proof in stages again. Let a, b and c be integers. If a b and b c, then a c. Proof. Suppose a b and b c. Therefore a c. Our first step is to apply Definition 4.4 to the first line. The definition says a b means b = ac for some integer c, but since c already appears in a different context on the first line, we must use a different letter, say d. Similarly let s use a new letter e in the definition of b c. Let a, b and c be integers. If a b and b c, then a c. Proof. Suppose a b and b c. By Definition 4.4, we know a b means there is an integer d with b = ad. Likewise, b c means there is an integer e for which c = be. Therefore a c. We have almost bridged the gap. The line immediately above the last line should show that a c. According to Definition 4.4, this line should say that c = ax for some integer x. We can get this equation from the lines at the top, as follows. Let a, b and c be integers. If a b and b c, then a c. Proof. Suppose a b and b c. By Definition 4.4, we know a b means there is an integer d with b = ad. Likewise, b c means there is an integer e for which c = be. Thus c = be = (ad)e = a(de), so c = ax for the integer x = de. Therefore a c. The next example is presented all at once rather than in stages.

10 96 Direct Proof If x is an even integer, then x 2 6x + 5 is odd. Proof. Suppose x is an even integer. Then x = 2a for some a Z, by definition of an even integer. So x 2 6x+5 = (2a) 2 6(2a)+5 = 4a 2 12a+5 = 4a 2 12a+4+1 = 2(2a 2 6a+2)+1. Therefore we have x 2 6x + 5 = 2b + 1, where b = 2a 2 6a + 2 Z. Consequently x 2 6x + 5 is odd, by definition of an odd number. One doesn t normally use a separate line for each sentence in a proof, but for clarity we will often do this in the first few chapters of this book. Our next example illustrates a standard technique for showing two quantities are equal. If we can show m n and n m then it follows that m = n. In general, the reasoning involved in showing m n can be quite different from that of showing n m. Recall Definition 4.6 of a least common multiple on page 90. If a, b, c N, then lcm(ca, cb) = c lcm(a, b). Proof. Assume a, b, c N. Let m = lcm(ca, cb) and n = c lcm(a, b). We will show m = n. By definition, lcm(a, b) is a multiple of both a and b, so lcm(a, b) = ax = by for some x, y Z. From this we see that n = c lcm(a, b) = cax = cby is a multiple of both ca and cb. But m = lcm(ca, cb) is the smallest multiple of both ca and cb. Thus m n. On the other hand, as m = lcm(ca, cb) is a multiple of both ca and cb, we have m = cax = cby for some x, y Z. Then 1 c m = ax = by is a multiple of both a and b. Therefore lcm(a, b) 1 c m, so c lcm(a, b) m, that is, n m. We ve shown m n and n m, so m = n. The proof is complete. The examples we ve looked at so far have all been proofs of statements about integers. In our next example, we are going to prove that if x and y are positive real numbers for which x y, then x y. You may feel that the proof is not as automatic as the proofs we have done so far. Finding the right steps in a proof can be challenging, and that is part of the fun. Let x and y be positive numbers. If x y, then x y. Proof. Suppose x y. Subtracting y from both sides gives x y 0. This can be written as x 2 y 2 0. Factor this to get ( x y)( x + y) 0. Dividing both sides by the positive number x + y produces x y 0. Adding y to both sides gives x y.

11 Direct Proof 97 This proposition tells us that whenever x y, we can take the square root of both sides and be assured that x y. This can be useful, as we will see in our next proposition. That proposition will concern the expression 2 xy x + y. Notice when you substitute random positive values for the variables, the expression is true. For example, for x = 6 and y = 4, the left side is = , which is less than the right side = 10. Is it true that 2 xy x + y for any positive x and y? How could we prove it? To see how, let s first cast this into the form of a conditional statement: If x and y are positive real numbers, then 2 xy x + y. The proof begins with the assumption that x and y are positive, and ends with 2 xy x + y. In mapping out a strategy, it can be helpful to work backwards, working from 2 xy x + y to something that is obviously true. Then the steps can be reversed in the proof. In this case, squaring both sides of 2 xy x + y gives us 4xy x 2 + 2xy + y 2. Now subtract 4xy from both sides and factor. 0 x 2 2xy + y 2 0 (x y) 2 But this last line is clearly true, since the square of x y cannot be negative! This gives us a strategy for the proof, which follows. If x and y are positive real numbers, then 2 xy x + y. Proof. Suppose x and y are positive real numbers. Then 0 (x y) 2, that is, 0 x 2 2xy + y 2. Adding 4xy to both sides gives 4xy x 2 + 2xy + y 2. Factoring yields 4xy (x + y) 2. Previously we proved that such an inequality still holds after taking the square root of both sides; doing so produces 2 xy x + y. Notice that in the last step of the proof we took the square root of both sides of 4xy (x + y) 2 and got 4xy (x + y) 2, and the fact that this did not reverse the symbol followed from our previous proposition. This is an important point. Often the proof of a proposition or theorem uses another proposition or theorem (that has already been proved).

12 98 Direct Proof 4.4 Using Cases In proving a statement is true, we sometimes have to examine multiple cases before showing the statement is true in all possible scenarios. This section illustrates a few examples. Our examples will concern the expression 1 + ( 1) n (2n 1). Here is a table showing its value for various integers for n. Notice that 1+( 1) n (2n 1) is a multiple of 4 in every line. n 1 + ( 1) n (2n 1) Is 1 +( 1) n (2n 1) always a multiple of 4? We prove the answer is yes in our next example. Notice, however, that the expression 1 + ( 1) n (2n 1) behaves differently depending on whether n is even or odd, for in the first case ( 1) n = 1, and in the second ( 1) n = 1. Thus the proof must examine these two possibilities separately. If n N, then 1 + ( 1) n (2n 1) is a multiple of 4. Proof. Suppose n N. Then n is either even or odd. Let s consider these two cases separately. Case 1. Suppose n is even. Then n = 2k for some k Z, and ( 1) n = 1. Thus 1 + ( 1) n (2n 1) = 1 + (1)(2 2k 1) = 4k, which is a multiple of 4. Case 2. Suppose n is odd. Then n = 2k + 1 for some k Z, and ( 1) n = 1. Thus 1 + ( 1) n (2n 1) = 1 (2(2k + 1) 1) = 4k, which is a multiple of 4. These cases show that 1 + ( 1) n (2n 1) is always a multiple of 4. Now let s examine the flip side of the question. We just proved that 1+( 1) n (2n 1) is always a multiple of 4, but can we get every multiple of 4 this way? The following proposition and proof give an affirmative answer.

13 Treating Similar Cases 99 Every multiple of 4 equals 1 + ( 1) n (2n 1) for some n N. Proof. In conditional form, the proposition is as follows: If k is a multiple of 4, then there is an n N for which 1 + ( 1) n (2n 1) = k. What follows is a proof of this conditional statement. Suppose k is a multiple of 4. This means k = 4a for some integer a. We must produce an n N for which 1 + ( 1) n (2n 1) = k. This is done by cases, depending on whether a is zero, positive or negative. Case 1. Suppose a = 0. Let n = 1. Then 1 + ( 1) n (2n 1) = 1 + ( 1) 1 (2 1) = 0 = 4 0 = 4a = k. Case 2. Suppose a > 0. Let n = 2a, which is in N because a is positive. Also n is even, so ( 1) n = 1. Thus 1+( 1) n (2n 1) = 1+(2n 1) = 2n = 2(2a) = 4a = k. Case 3. Suppose a < 0. Let n = 1 2a, which is an element of N because a is negative, making 1 2a positive. Also n is odd, so ( 1) n = 1. Thus 1 + ( 1) n (2n 1) = 1 (2n 1) = 1 (2(1 2a) 1) = 4a = k. The above cases show that no matter whether a multiple k = 4a of 4 is zero, positive or negative, k = 1 + ( 1) n (2n 1) for some n N. 4.5 Treating Similar Cases Occasionally two or more cases in a proof will be so similar that writing them separately seems tedious or unnecessary. Here is an example. If two integers have opposite parity, then their sum is odd. Proof. Suppose m and n are two integers with opposite parity. We need to show that m + n is odd. This is done in two cases, as follows. Case 1. Suppose m is even and n is odd. Thus m = 2a and n = 2b + 1 for some integers a and b. Therefore m + n = 2a + 2b + 1 = 2(a + b) + 1, which is odd (by Definition 4.2). Case 2. Suppose m is odd and n is even. Thus m = 2a + 1 and n = 2b for some integers a and b. Therefore m + n = 2a b = 2(a + b) + 1, which is odd (by Definition 4.2). In either case, m + n is odd. The two cases in this proof are entirely alike except for the order in which the even and odd terms occur. It is entirely appropriate to just do one case and indicate that the other case is nearly identical. The phrase Without loss of generality... is a common way of signaling that the proof is treating just one of several nearly identical cases. Here is a second version of the above example.

14 100 Direct Proof If two integers have opposite parity, then their sum is odd. Proof. Suppose m and n are two integers with opposite parity. We need to show that m + n is odd. Without loss of generality, suppose m is even and n is odd. Thus m = 2a and n = 2b + 1 for some integers a and b. Therefore m+n = 2a+2b+1 = 2(a+b)+1, which is odd (by Definition 4.2). In reading proofs in other texts, you may sometimes see the phrase Without loss of generality abbreviated as WLOG. However, in the interest of transparency we will avoid writing it this way. In a similar spirit, it is advisable at least until you become more experienced in proof writing that you write out all cases, no matter how similar they appear to be. Please check your understanding by doing the following exercises. The odd numbered problems have complete proofs in the Solutions section in the back of the text. Exercises for Chapter 4 Use the method of direct proof to prove the following statements. 1. If x is an even integer, then x 2 is even. 2. If x is an odd integer, then x 3 is odd. 3. If a is an odd integer, then a 2 + 3a + 5 is odd. 4. Suppose x, y Z. If x and y are odd, then xy is odd. 5. Suppose x, y Z. If x is even, then xy is even. 6. Suppose a, b, c Z. If a b and a c, then a (b + c). 7. Suppose a, b Z. If a b, then a 2 b Suppose a is an integer. If 5 2a, then 5 a. 9. Suppose a is an integer. If 7 4a, then 7 a. 10. Suppose a and b are integers. If a b, then a (3b 3 b 2 + 5b). 11. Suppose a, b, c, d Z. If a b and c d, then ac bd. 12. If x R and 0 < x < 4, then 4 x(4 x) Suppose x, y R. If x 2 + 5y = y 2 + 5x, then x = y or x + y = If n Z, then 5n 2 + 3n + 7 is odd. (Try cases.) 15. If n Z, then n 2 + 3n + 4 is even. (Try cases.) 16. If two integers have the same parity, then their sum is even. (Try cases.) 17. If two integers have opposite parity, then their product is even. 18. Suppose x and y are positive real numbers. If x < y, then x 2 < y 2.

15 Treating Similar Cases Suppose a, b and c are integers. If a 2 b and b 3 c, then a 6 c. 20. If a is an integer and a 2 a, then a { 1,0,1 }. 21. If p is prime and k is an integer for which 0 < k < p, then p divides ( p k). 22. If n N, then n 2 = 2 ( n ( 2) + n 1). (You may need a separate case for n = 1.) 23. If n N, then ( 2n) n is even. 24. If n N and n 2, then the numbers n! + 2, n! + 3, n! + 4, n! + 5,..., n! + n are all composite. (Thus for any n 2, one can find n consecutive composite numbers. This means there are arbitrarily large gaps between prime numbers.) 25. If a, b, c N and c b a, then ( a b ) ( b)( c = a )( a b+c ) b c c. 26. Every odd integer is a difference of two squares. (Example 7 = , etc.) 27. Suppose a, b N. If gcd(a, b) > 1, then b a or b is not prime. 28. If a, b, c Z, then c gcd(a, b) gcd(ca, cb).

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### Course notes on Number Theory

Course notes on Number Theory In Number Theory, we make the decision to work entirely with whole numbers. There are many reasons for this besides just mathematical interest, not the least of which is that

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### Topics in Number Theory

Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall

### CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS

CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we construct the set of rational numbers Q using equivalence

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### 2.3 Subtraction of Integers

2.3 Subtraction of Integers The key to subtraction of real numbers is to forget what you might have learned in elementary school about taking away. With positive numbers you can reasonably say take 3 away

### CHAPTER 2. Inequalities

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

### 2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers

2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.

### Algebra for Digital Communication

EPFL - Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain

### Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### There are 8000 registered voters in Brownsville, and 3 8. of these voters live in

Politics and the political process affect everyone in some way. In local, state or national elections, registered voters make decisions about who will represent them and make choices about various ballot

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### Chapter 1 Basic Number Concepts

Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### 4. Number Theory (Part 2)

4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.

### Section 4.2: The Division Algorithm and Greatest Common Divisors

Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948

### Reading 7 : Program Correctness

CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 7 : Program Correctness 7.1 Program Correctness Showing that a program is correct means that

### MAT Mathematical Concepts and Applications

MAT.1180 - Mathematical Concepts and Applications Chapter (Aug, 7) Number Theory: Prime and Composite Numbers. The set of Natural numbers, aka, Counting numbers, denoted by N, is N = {1,,, 4,, 6,...} If

### Oh Yeah? Well, Prove It.

Oh Yeah? Well, Prove It. MT 43A - Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built

### Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

### CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010

CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### Introduction to mathematical arguments

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

### CS103X: Discrete Structures Homework Assignment 2: Solutions

CS103X: Discrete Structures Homework Assignment 2: Solutions Due February 1, 2008 Exercise 1 (10 Points). Prove or give a counterexample for the following: Use the Fundamental Theorem of Arithmetic to

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

### Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

### A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after.

Fibonacci Problem: A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after. Question: How many rabbits will the farmer have after n months? Try it on small numbers.

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem

### MATH Fundamental Mathematics II.

MATH 10032 Fundamental Mathematics II http://www.math.kent.edu/ebooks/10032/fun-math-2.pdf Department of Mathematical Sciences Kent State University December 29, 2008 2 Contents 1 Fundamental Mathematics

### Chapter 6. Number Theory. 6.1 The Division Algorithm

Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Copyright Cengage Learning. All rights reserved.

### Integers and Rational Numbers

Chapter 6 Integers and Rational Numbers In this chapter, we will see constructions of the integers and the rational numbers; and we will see that our number system still has gaps (equations we can t solve)

### This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### Practice Problems for First Test

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

### An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

### MATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003

MATH 22 Lecture R: 10/30/2003 THE FUNDAMENTAL THEOREM of ARITHMETIC You must remember this, A kiss is still a kiss, A sigh is just a sigh; The fundamental things apply, As time goes by. Herman Hupfeld

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### MATH REVIEW KIT. Reproduced with permission of the Certified General Accountant Association of Canada.

MATH REVIEW KIT Reproduced with permission of the Certified General Accountant Association of Canada. Copyright 00 by the Certified General Accountant Association of Canada and the UBC Real Estate Division.

### Chapter 1.1 Rational and Irrational Numbers

Chapter 1.1 Rational and Irrational Numbers A rational number is a number that can be written as a ratio or the quotient of two integers a and b written a/b where b 0. Integers, fractions and mixed numbers,

### a = bq + r where 0 r < b.

Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

### DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### 2. INEQUALITIES AND ABSOLUTE VALUES

2. INEQUALITIES AND ABSOLUTE VALUES 2.1. The Ordering of the Real Numbers In addition to the arithmetic structure of the real numbers there is the order structure. The real numbers can be represented by

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### 5. Integers, Whole Numbers And Rational Numbers

5. Integers, Whole Numbers And Rational Numbers The set of natural numbers,, is the building block for most of the real number system. But is inadequate for measuring and describing physical quantities,

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### 5.1 Text HW Number Theory Math 210 pbf8 1. Illustrate = 34 as in theorem 1.5 [i.e. showing that EVEN + EVEN = EVEN!].

.1 Text HW Number Theory Math 10 pbf8 1. Illustrate 1+18 = 4 as in theorem 1. [i.e. showing that EVEN + EVEN = EVEN!]. 1 18 4 11 48. Illustrate + 449 = 781 as in theorem 1.: EVEN + ODD = ODD 449 781 4a.

### MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS

MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS ALLAN YASHINSKI Abstract. We explore the notion of well-definedness when defining functions whose domain is

### 2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In

### Logic and Proof Solutions. Question 1

Logic and Proof Solutions Question 1 Which of the following are true, and which are false? For the ones which are true, give a proof. For the ones which are false, give a counterexample. (a) x is an odd

### Solutions of Linear Equations in One Variable

2. Solutions of Linear Equations in One Variable 2. OBJECTIVES. Identify a linear equation 2. Combine like terms to solve an equation We begin this chapter by considering one of the most important tools

### TYPES OF NUMBERS. Example 2. Example 1. Problems. Answers

TYPES OF NUMBERS When two or more integers are multiplied together, each number is a factor of the product. Nonnegative integers that have exactly two factors, namely, one and itself, are called prime

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS

STUDY GUIDE FOR SOME BASIC INTERMEDIATE ALGEBRA SKILLS The intermediate algebra skills illustrated here will be used extensively and regularly throughout the semester Thus, mastering these skills is an

### In order to master the techniques explained here it is vital that you undertake plenty of practice exercises so that they become second nature.

Indices or Powers A knowledge of powers, or indices as they are often called, is essential for an understanding of most algebraic processes. In this section of text you will learn about powers and rules

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Week 5: Quantifiers. Number Sets. Quantifier Symbols. Quantity has a quality all its own. attributed to Carl von Clausewitz

Week 5: Quantifiers Quantity has a quality all its own. attributed to Carl von Clausewitz Number Sets Many people would say that mathematics is the science of numbers. This is a common misconception among

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

### 5 =5. Since 5 > 0 Since 4 7 < 0 Since 0 0

a p p e n d i x e ABSOLUTE VALUE ABSOLUTE VALUE E.1 definition. The absolute value or magnitude of a real number a is denoted by a and is defined by { a if a 0 a = a if a

### 1.1. Basic Concepts. Write sets using set notation. Write sets using set notation. Write sets using set notation. Write sets using set notation.

1.1 Basic Concepts Write sets using set notation. Objectives A set is a collection of objects called the elements or members of the set. 1 2 3 4 5 6 7 Write sets using set notation. Use number lines. Know

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### Fold again, the same way. We now have four equal regions: the shaded part remains the same, of the paper.

PRIMARY CONTENT MODULE V NUMBER SENSE: Rational Numbers T-12 Equivalent Fractions When do two fractions represent the same amount? Or, when do they represent the same point or number on a number line?

### Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

### Squares and Square Roots

SQUARES AND SQUARE ROOTS 89 Squares and Square Roots CHAPTER 6 6.1 Introduction You know that the area of a square = side side (where side means the length of a side ). Study the following table. Side

3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where

### 3 Structure of Modular Multiplication

3 Structure of Modular Multiplication Unlike addition, multiplication in Z M is fairly strange. There may not always be an inverse, you can multiply two non-zero numbers together and get zero, and in general

### Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

### Math 016. Materials With Exercises

Math 06 Materials With Exercises June 00, nd version TABLE OF CONTENTS Lesson Natural numbers; Operations on natural numbers: Multiplication by powers of 0; Opposite operations; Commutative Property of

### Notes on Chapter 1, Section 2 Arithmetic and Divisibility

Notes on Chapter 1, Section 2 Arithmetic and Divisibility August 16, 2006 1 Arithmetic Properties of the Integers Recall that the set of integers is the set Z = f0; 1; 1; 2; 2; 3; 3; : : :g. The integers

### Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it

### 26 Integers: Multiplication, Division, and Order

26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue

### 4.3 Limit of a Sequence: Theorems

4.3. LIMIT OF A SEQUENCE: THEOREMS 5 4.3 Limit of a Sequence: Theorems These theorems fall in two categories. The first category deals with ways to combine sequences. Like numbers, sequences can be added,

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### How To Math Properties

CLOSURE a + b is a real number; when you add 2 real numbers, the result is also a real number. and 5 are both real numbers, + 5 8 and the sum, 8, is also a real number. a b is a real number; when you subtract

### EXPONENTS. To the applicant: KEY WORDS AND CONVERTING WORDS TO EQUATIONS

To the applicant: The following information will help you review math that is included in the Paraprofessional written examination for the Conejo Valley Unified School District. The Education Code requires

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,