Scribd
Upload
6 views1 page

230 HW 3

Uploaded by

Anuj Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

230 HW 3

Uploaded by

Anuj Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Math 230 D Fall 2015

Homework 3 Drew Armstrong

Problem 1. How do − and × interact? For the following exercises I want you to give
Euclidean style proofs using the axioms of Z from the handout. You can also use the results
we proved in class, such as: uniqueness of “−a”, 0a = 0 for all a ∈ Z, and the Cancellation
Lemma (a + b = a + c) ⇒ (b = c).
(a) Recall that −n is the unique integer satisfying n + (−n) = 0. Prove that for all n ∈ Z
we have −(−n) = n.
(b) Prove that for all a, b ∈ Z we have (−a)b = a(−b) = −(ab). [Hint: Use the fact that
0a = 0 for all a ∈ Z, which we proved in class.]
(c) Recall that for all m, n ∈ Z we define m − n := m + (−n). Prove that for all a, b, c ∈ Z
we have a(b − c) = ab − ac. [Hint: Use (b).]
(d) Prove that for all a, b ∈ Z we have (−a)(−b) = ab. [Hint: Show that −(ab) = a(−b).
Then use (a) and (b).]

Problem 2. First Look at Induction.


(a) Prove that 3n is an odd number for all natural numbers n ∈ N. [Hint: Assume for
contradiction that there exists a natural number such that 3n is even. In this case,
the Well-Ordering Axiom tells us that there is a smallest such integer. Call it m ∈ N.
Now try to find a contradiction.]
(b) Assume that there exists a real number x ∈ R such that 2x = 3 (we call it x = log2 (3)).
Use part (a) to prove that x 6∈ Q.

Problem 3. Square root of a ∈ Z.


(a) Suppose that α ∈ R and α 6∈ Z. In this case, use the Well-Ordering Axiom to prove
that there exists an integer b ∈ Z such that
b < α < b + 1.
[Hint: Let S = {n ∈ Z : α < n}. Since this set is nonempty and bounded below, the
Well-Ordering Axiom says it has a least element, say m ∈ S.]
(b) Prove that for all a ∈ Z we have
√ √
a 6∈ Z =⇒ a 6∈ Q.
√ √
[Hint: Assume that a 6∈ Z, so we √ have b < a < b + 1 for some b ∈ Z by √part (a).
Now assume for contradiction that a ∈ Q. Consider the set T = {n ∈ N : n a ∈ Z}.
Show that T is not√empty, so by Well-Ordering it has a smallest element, say m ∈ T .
Now show that m( a − b) is a smaller element of T . Contradiction.]

Problem 4. Greatest Common Divisor. Consider two integers a, b ∈ Z that are not both
zero. Now consider the set of “common divisors”
D = {d ∈ Z : d|a ∧ d|b}.
Show that this set is bounded above, so by Well-Ordering it has a largest element. Call the
largest element gcd(a, b). Now show that 1 ≤ gcd(a, b). [Hint: Use Problem 3(d) from HW1.]

You might also like