Methods

of Proof and
Divisibility
A. Direct Proof
Examples
Prove the following theorems.
Theorem 1.1: The set of odd integers is closed under multiplication.
Theorem 1.2: The product of any two consecutive integers is even
Theorem 1.3: The set of even integers is closed under addition and
multiplication.
B. Indirect Proof
Examples
Prove the following theorems.
Theorem 1.4: If the square of an integer is even, then the integer
itself is even.
Theorem 1.5: The sum of the squares of two odd integers cannot be a
perfect square.
C. Proof by Mathematical Induction
Step1. Verification
Verify the statement for
Step 2. Induction Hypothesis
Assume that the statement is true for .
Step 3. Proof
Prove that the statement is also true for .
Step 4: Conclusion
Examples
Prove the following statements by using mathematical induction.
1.
2.
Definition 1.1
Let divides if and only if there exists and integer such that . In
symbol, iff such that .
Theorem 1.6
Let then
a. ,,
b. If
c. If and , then .
d. If and , then .
Theorem 1.7
Let , then
a. If , then .
b. If , then .
c. If , then .
Theorem 1.8
If and , then
Theorem 1.9
Let , iff .
Theorem 1.10
If , then can be one in any of the following sets.

.
.
.
Exercises
Prove the following.
1. If is a multiple of , then is a multiple of 25.
2. If then .
3. If is a multiple of , then is a multiple of 9.
4. There exist no integer n such that .
5. .

6. If an integer is not divisible by 2 and 3, then .