Solutions for Problem Set 6 - Introduction to Mathematical Proof | MATH 310, Assignments of Mathematics

Material Type: Assignment; Professor: Ikenaga; Class: Intro to Mathematical Proof; Subject: Mathematics; University: Millersville University of Pennsylvania; Term: Unknown 1989;

Typology: Assignments

Pre 2010

Uploaded on 08/17/2009

koofers-user-y0n
koofers-user-y0n 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 310/520
2–13–2009
Solutions to Problem Set 6
1. Premises:
AB
B C
AD
.
Prove: D.
1. ABPremise
2. B CPremise
3. ADPremise
4. BDecomposing a conjunction (2)
5. BADefinition of biconditional
6. AModus ponens (4,5)
7. DDisjunctive syllogism (3,6)
2. Premises: (AC)→∼ B
D→∼ A.
Prove: A→∼ (BD).
1. (AC)→∼ BPremise
2. D→∼ APremise
3. APremise for conditional proof
4. ACConstructing a disjunction
5. BModus ponens (1,4)
6. DModus tollens (2,3)
7. B DConstructing a conjunction (5,6)
8. (BD) DeMorgan (7)
9. A→∼ (BD) Conditional proof (3,8)
3. (a) Show that if ln x+ ln(x1) = ln 2, then x= 2 or x=1.
ln x+ ln(x1) = ln 2
ln x(x1) = ln 2
eln x(x1) =eln 2
x(x1) = 2
x2x= 2
x2x2 = 0
(x2)(x+ 1) = 0
Therefore, x= 2 or x=1.
(b) Show that it’s not true that if x= 2 or x=1, then ln x+ ln(x1) = ln 2.
Plugging x= 2 into ln x+ ln(x1) = ln 2 gives ln 2 + ln 1 = ln 2, which is true. The answer checks.
Plugging x=1 into ln x+ ln(x1) = ln 2 gives ln(1) + ln(2) = ln 2, which doesn’t make sense
the log of a negative number is undefined. The answer doesn’t check.
1
pf3

Partial preview of the text

Download Solutions for Problem Set 6 - Introduction to Mathematical Proof | MATH 310 and more Assignments Mathematics in PDF only on Docsity!

Math 310/ 2–13–

Solutions to Problem Set 6

  1. Premises:

A ↔ B

B∧ ∼ C

∼ A ∨ D

Prove: D.

  1. A ↔ B Premise
  2. B∧ ∼ C Premise
  3. ∼ A ∨ D Premise
  4. B Decomposing a conjunction (2)
  5. B → A Definition of biconditional
  6. A Modus ponens (4,5)
  7. D Disjunctive syllogism (3,6)
  8. Premises:

(A ∨ C) →∼ B

D →∼ A

Prove: A →∼ (B ∨ D).

  1. (A ∨ C) →∼ B Premise
  2. D →∼ A Premise
  3. A Premise for conditional proof
  4. A ∨ C Constructing a disjunction
  5. ∼ B Modus ponens (1,4)
  6. ∼ D Modus tollens (2,3)
  7. ∼ B∧ ∼ D Constructing a conjunction (5,6)
  8. ∼ (B ∨ D) DeMorgan (7)
  9. A →∼ (B ∨ D) Conditional proof (3,8)
  10. (a) Show that if ln x + ln(x − 1) = ln 2, then x = 2 or x = −1.

ln x + ln(x − 1) = ln 2 ln x(x − 1) = ln 2 eln^ x(x−1)^ = eln 2 x(x − 1) = 2 x^2 − x = 2 x^2 − x − 2 = 0 (x − 2)(x + 1) = 0

Therefore, x = 2 or x = −1.

(b) Show that it’s not true that if x = 2 or x = −1, then ln x + ln(x − 1) = ln 2.

Plugging x = 2 into ln x + ln(x − 1) = ln 2 gives ln 2 + ln 1 = ln 2, which is true. The answer checks. Plugging x = −1 into ln x + ln(x − 1) = ln 2 gives ln(−1) + ln(−2) = ln 2, which doesn’t make sense — the log of a negative number is undefined. The answer doesn’t check.

1

  1. (a) Prove that if x > 3, then x^2 + 4x + 7 > 28.

x > 3 implies that x^2 > 9, and also that 4x > 12. Adding the last two inequalities, I get x^2 + 4x > 21. Adding 7 to both sides, I get x^2 + 4x + 7 > 28.

(b) Give a specific counterexample which shows that the converse is false.

The converse is: “If x^2 + 4x + 7 > 28, then x > 3.” If x = −10, then x^2 + 4x + 7 = 100 − 40 + 7 = 67 > 28. However, − 10 6 >3. Therefore, the converse is false.

  1. (a) Prove that if n is even, then n^2 + 3n + 16 is even.

Let n be an even integer. Then n = 2m for some m ∈ Z. So

n^2 + 3n + 16 = (2m)^2 + 3(2m) + 16 = 4m^2 + 6m + 16 = 2(2m^2 + 3m + 8).

Hence, n^2 + 3n + 16 is even.

(b) Give a specific counterexample to show that the converse is false.

The converse is: “If n^2 + 3n + 16 is even, then n is even.” However, if n = 1, then n^2 + 3n + 16 = 20, which is even, while n is odd. Thus, the converse is false.

  1. Suppose that f is a continuous function,

f (3) = 2, and f (6) = − 3.

Prove that x^2 f (x) has a root between x = 3 and x = 6.

g(x) = x^2 f (x) is continuous,

g(3) = 3^2 f (3) = 18, and g(6) = 6^2 f (6) = − 108.

By the Intermediate Value Theorem, g(c) = 0 for some c between 3 and 6 — that is, x^2 f (x) has a root between x = 3 and x = 6.

  1. Premises:

A →∼ B

B ↔ (A ∨ C)

Prove: B → (C∧ ∼ A).

  1. A →∼ B Premise
  2. B ↔ (A ∨ C) Premise
  3. B Premise for conditional proof
  4. (B → (A ∨ C)) ∧ ((A ∨ C) → B) Definition of biconditional
  5. B → (A ∨ C) Decomposing a conjunction (4)
  6. A ∨ C Modus ponens (3,5)
  7. ∼ A Modus tollens (1,3)

2