

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The solutions to homework problems from a university-level mathematics course, specifically from the chapter on mathematical reasoning. The problems involve proving various properties of integer divisibility and even numbers using logical reasoning and definitions. Students of mathematics, particularly those enrolled in a course on mathematical reasoning or number theory, may find this document useful for studying, taking exams, or completing assignments.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Math 310: Introduction to Mathematical Reasoning
Summer 2006
Homework 3 Solutions
(From An Introduction to Mathematical Reasoning, by Peter J. Eccles.)
Definition: Given two integers a and b, we say that a divides b or b is a multiple of a to mean that there is an integer q such that aq = b. Written in symbols we write a|b for a divides b.
(a divides b) and (b divides c) =⇒ (a divides c).
Proof. Suppose a divides b and b divides c. The there is a q ∈ Z such that aq = b. Likewise there is a p ∈ Z such that bp = c. Then substituting aq for b we have
c = bp = (aq)p = a(qp).
Since the integers are closed under multiplication, qp is an integer and hence by definition, a divides c.
Proof. Suppose n ∈ Z is even. Then there is an integer k with n = 2k. Thus
n^2 = (2k)^2 = 2(2k^2 ).
Then by definition, n^2 is even.
Proof. This is an “if and only if” statement, so we have two things to prove. First, assume 0 divides a. Then for some integer q, 0q = a. We have already proven that for any integer, 0q = 0. Thus a = 0q = 0.
Now suppose a = 0. Then since 0q = 0 for every q ∈ Z, we see that 0 divides 0 by defintion.
n^2 is odd =⇒ n is odd.
Proof. To prove this by contradiction, we assume that n^2 is odd and n is even. But in problem 2 above we showed that n even implies n^2 even. Thus n^2 is both even and odd, a contradiction. Therefore our initial assumption was wrong and n must be odd.