Exam 4: Elementary Number Theory and Methods of Proof
Use the Euclidean algorithm to find the greatest common divisor of 284 and 168. Show your work.

Prove the following statement directly from the definitions of the terms. Do not use any other
facts previously proved in class or in the text or in the exercises.
Proof: Suppose and , are any rational numbers with . We must show that is a rational number./By definition of rational, there exist integers , and with and such that
In addition, since and since neither nor equals 0 , then by the zero product property. Then
Now both and are integers because they are products of integers, and by the zero product property. Hence is a ratio of integers with a nonzero denominator, and so is a rational number by definition of rational [as was to be shown].
State precisely (but concisely) what it means for an integer n to be odd.
Some acceptable answers:
a. An integer n is odd if, and only if, n = 2k + 1 for some integer k.
b. An integer n is odd if, and only if, n equals 2 times some integer plus 1.
c. An integer n is odd if, and only if, there exists an integer m such that n = 2m +1 .
Outline a proof of the following statement by writing the "starting point" and the "conclusion to be shown" in a proof of the statement.
That is, complete the sentences below. Proof: Suppose______
We must show that__________
Prove the following statement: The sum of any two consecutive integers can be written in the form 4n + 1 for some integer n.
Prove the following statement directly from the definitions of the terms. Do not use any other facts previously proved in class or in the text or in the exercises.
Prove the following statement: There is no smallest positive rational number.
True or false? For any irrational number r, r2 is irrational. Justify your answer.
Show that the following statement is false: The product of any two irrational numbers is irrational.
State precisely (but concisely) what it means for an integer n to be divisible by an integer d.
Prove the following statement by contradiction: For all real numbers r and s, if r is rational and s is irrational, then r + 2s is irrational.
Prove by contradiction that
is an irrational number. (You may use the fact that } is irrational.
State precisely (but concisely) what it means for a number r to be rational.
Fill in the blanks of the following proof by contradiction that is an irrational number. (You may use the fact that is irrational.)
Proof: Suppose not. That is, suppose that is (i). By definition of rational, , where (ii). Multiplying both sides by gives
so if we subtract from both sides we have
Dividing both sides by gives
But then would be a rational number because (v). This contradicts our knowledge that is irrational. Hence (vi).
Prove the following statement directly from the definition of divisibility. Do not use any other facts previously proved in class or in the text or in the exercises.For all integers , and , if divides then divides .
Consider the following statement:
(a) Write a negation for Statement A.
(b) Disprove Statement A. That is, show that Statement A is false.
Consider the following statement: For all integers n, if n3 is even then n is even.
(a) Prove the statement either by contradiction or by contraposition. Clearly indicate which method you are using.
(b) If you used proof by contradiction in part (a), write what you would "suppose" and what you would "show" to prove the statement by contraposition. If you used proof by contraposition. in part (a), write what you would "suppose" and what you would "show" to prove the statement by contradiction.
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)