Sie sind auf Seite 1von 2

MAST10008 Accelerated Mathematics 1 Version 2 MAST10008 Accelerated Mathematics 1 Version 2

Tutorial 4: Solutions Thus P (n) =⇒ P (n + 1).


Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.
Q1. (a) One example is x = −1, y = 2, z = 3. (f) Let P (n) be the statement n! > 2n2 . We start by testing natural numbers to find n0 .
(b) Let a, b ∈ Z such that a is even and b is odd.
n n! 2n2 n! > 2n2
Then there exists m, n ∈ Z such that a = 2n and b = 2m + 1 by definition of odd and
even numbers. 1 1 2 False
Thus ab = (2n)(2m + 1) = 4nm + 2n = 2(2nm + n). 2 2 8 False
3 6 18 False
As 2, m, n ∈ Z, 2nm + n ∈ Z.
4 24 32 False
Hence ab = 2(2nm + n) is even as required.
5 120 50 True
(c) We prove the contrapositive: if n and m are both odd then nm is odd.
Assume n, m are odd. Then there exists a, b ∈ Z such that n = 2a + 1 and m = 2b + 1. So Based on this we try n0 = 5.
We first note that P (5) is true.
nm = (2a + 1)(2b + 1) = 2(2ab + a + b) + 1, Assume that P (n) is true and that n ≥ 5. Then n! > 2n2 .
which is odd as 2, a, b ∈ Z =⇒ 2ab + a + b ∈ Z. So
Thus, by the contrapositive, if mn is even then either m or n must be even.
√ (n + 1)! = (n + 1)n! > (n + 1)(2n2 ) by induction hypothesis
(d) Assume 10 ∈ Q.
√ p = 2(n3 + n2 )
By the definition of a rational number ∃ p, q ∈ Z, q 6= 0 such that 10 = , where the > 2(4n2 + n2 ) as n > 4
q
greatest common divisor of p and q is 1. Then = 2(n2 + 2n2 + 2n2 )
√ p p2 > 2(n2 + 2n + 1) as n > 1 and 2n2 > 1
10 = =⇒ 10 = =⇒ p2 = 10q 2 = 2 × 5q 2
q q2 = 2(n + 1)2
As 5, q ∈ Z, 5q 2 ∈ Z. So p2 is even. Thus P (n) is true implies P (n + 1) is true.
From the previous part (or from lectures) this implies that p is even. By the principle of mathematical induction, P (n) is true for all natural numbers n ≥ 5
So ∃ r ∈ Z such that p = 2r. and 5 is the least such natural number where this holds.
Then
(2r)2 = 2 × 5q 2 =⇒ 2r2 = 5q 2 Q2. (a) There is a bijection f : N → 3N = {3, 6, 9, . . .} given by f (n) = 3n.
2 2
As 2, r ∈ Z, 2r ∈ Z so 5q is even. (b) We can list the odd integers without repetitions as follows:
By the previous part either 5 or q 2 must be even. As 5 is odd, q 2 is even. Again by the +1, −1, +3, −3, +5, −5, +7, −7, . . .
previous part q is even.
Then ∃ s ∈ Z such that q = 2s. Explicitly, this gives a bijection f : N → {odd integers}, where
But now both p and q are divisible √ by 2, which contradicts the assumption that their (
n, if n is odd
greatest common divisor is 1. Hence 10 is not rational. f (n) =
1 − n, if n is even
(e) Let P (n) be the statement nk=1 4k − 1 = 2n2 + n.
P
2
As 4 × 1 − 1 = 3 = 2 × 1 + 1, P (1) is true.
Q3. (a) Proof (by
√ contradiction):

Assume P (n) is true for some n ∈ N. Then Assume√ 2 +√ 5 is rational.√
n
X Then ( 2 + 5)2 = 7 + 2 10 is rational as Q is closed under multiplication.
4k − 1 = 2n2 + n by induction hypothesis By the definition of a rational number ∃ p, q ∈ Z, q 6= 0 such that
k=1
n+1
√ p
X 7 + 2 10 =
LHS of P (n + 1) = 4k − 1 = (2n2 + n) + 4(n + 1) − 1 q
k=1
where the greatest common divisor of p and q is 1.
= 2n2 + 5n + 3 √ 1 p
= 2(n2 + 2n + 1) + n + 1 Then 10 = ( − 7) is rational as Q is closed under addition and multiplication.
2 q

= 2(n + 1)2 + (n + 1) But 10 is not rational, as proved above, so this is a contradiction.
√ √
= RHS of P (n + 1) Thus 2 + 5 is irrational.

Mathematics and Statistics 1 University of Melbourne Mathematics and Statistics 2 University of Melbourne
MAST10008 Accelerated Mathematics 1 Version 2 MAST10008 Accelerated Mathematics 1 Version 2

n
X 1 3 1 As 2, k ∈ Z, 8k − 2∈ Z so 8n+2 − 3 · 8n+1 + 2 is divisible by 7.
(b) Let P (n) be the statement: 2
≥ − .
k=1
k 2 n + 1 Hence P (n) =⇒ P (n + 1).
For n = 1 the statement P (n) becomes 1 ≥ 3
− 1
= 1, so P (1) is true. Thus, by the principle of mathematical induction, P (n) is true for all n ∈ N.
2 2
Assume P (n) is true for some n ∈ N. Then
Q4. Hint: First show that any number of the form 4n + 3 has at least one prime factor of the form
n 4k + 3.
X 1 3 1
2
≥ −
k=1
k 2 n + 1

1
Adding to both sides gives:
(n + 1)2

n+1
X 1 3 1 1
LHS of P (n + 1) = 2
≥ − + by induction hypothesis
k=1
k 2 n + 1 (n + 1)2
3 n
= −
2 (n + 1)2
3 n
= − 2
2 n + 2n + 1
3 n
≥ − 2
2 n + 2n
3 1
= − = RHS of P (n + 1)
2 n+2

Hence P (n) =⇒ P (n + 1).


Thus, by the principle of mathematical induction, P (n) is true for all n ∈ N.
(c) Let n be a 3 digit number such that the sum of the digits is divisible by 3.
Then there are some a, b, c ∈ Z and k ∈ Z such that

n = 100a + 10b + c and a + b + c = 3k.

Then

n = 100a + 10b + c = 99a + 9b + a + b + c


= 3(33a + 3b + k)

As 33, a, b, k ∈ Z, (33a + 3b + k) ∈ Z and hence n is divisible by 3.


Note: The same result is true for n-digit numbers – can you prove this?
(d) This is false. (Hint: Think of a kite.)
(e) Let P (n) be the statement “8n+1 − 3 · 8n + 2 is divisible by 7”,
Now 81+1 − 3 · 81 + 2 = 42 = 6 · 7 so 81+1 − 3 · 81 + 2 is divisible by 7 and P (1) is true.
Assume P (n) is true for some n ∈ N. Then there exists k ∈ Z such that 8n+1 −3·8n +2 = 7k.
Now

8n+2 − 3 · 8n+1 + 2 = 8(8n+1 − 3 · 8n ) + 2


= 8(8n+1 − 3 · 8n + 2 − 2) + 2
= 8(8n+1 − 3 · 8n + 2) − 16 + 2
= 8 · 7k − 14
= 7(8k − 2)

Mathematics and Statistics 3 University of Melbourne Mathematics and Statistics 4 University of Melbourne

Das könnte Ihnen auch gefallen