Extra Questions for Exam Review - Answers
1.
P Q R P Q R P
T
T
T
T
F
F
F
F
T
T
F
F
T
T
F
F
T
F
T
F
T
F
T
F
F
F
T
T
F
F
F
F
T
F
T
F
T
T
T
T
( P Q) = ( R P)
T
T
T
F
T
T
T
T
2. No. A = {2a + 1 : a Z} is the set of all odd integers.
m Z} is the set of integers and half-integers.
3.
B = {a
: 2
a+
Z} = { 21 (m 1)
(a) P ( A) P ( B) = {, {4}, {10}, {4, 10}}.
(b) Yes.
(c) It is true. Here is a proof.
X P ( A B)
4.
( AC B ) ( AC C C )
)C
X A B X A and X B
X P ( A) and X P ( B)
X P ( A) P ( B)
.
= ( AC B )C ( AC C C )C
(de Morgan)
= (( AC )C BC ) (( AC )C (CC )C )
= ( A B ) ( A C)
(de Morgan 2)
A ( BC C )
= A ( B C C )C
(distributive law)
(de Morgan)
5. The statement is true.
x ( A B) \ ( A B)
x A B and x ( A B)C = AC BC
( x A or x B) and ( x A or x B).
We therefore need one of the two statements in each set of parantheses to be true. But we cant
have x A and x A, so we conclude
x ( A B) \ ( A B)
6.
( x A and x B) or ( x
x ( A \ B) ( B \ A).
A and x B)
(a) For all integers x, there exist integers y and r such that x =
(b) Given x Z, let r = 1 and y =
y + r and r is between 1 and 4.
. Then r, y are integers satisfying the claim.
(c) x Z, such that y, r Z we have ( x =
1
y + r ) (r
) (r 5).
7.
(a) Let x, y W . Then m, n Z such that x =
xy = m2 n2 = (mn)2 W
(b)
W is closed under addition if x y W we have x + y W . This is false. For example
= 2 and = 2 are both in W , yet + = W as it is not a perfect square.
,
8.
m2 y = n2 . But then
(a) The positive divisors of 6 are 1, 2, 3 and 6: we have 6 = 1 + 2 + 3.
The positive divisors of 28 are 1, 2, 4, 7, 14 and 28: we have 28 = 1 + 2 + 4 + 7 + 14.
(b) Let 2n 1 = p be prime. Clearly p = 3, from n = 2, is the smallest such prime. It follows
that p is odd. The positive divisors of 2n1 (2n 1) = 2n1 p are then
2
1, 2, 2 , 2 , . . . , 2
n 2
,2
n 1
p p 2p
,2
,2
,...,2
n 2
,2
n 1
The sum of all of these except the last is then
n 1
n 2
k =0
kp =
2
k =0
2n ( 1 2n 1 ) p
+
= 2n 1 + ( 2n 1 1 ) p
12
12
= 2n 1 + (2n1 1)(2n 1) = 2n1 (2n 1),
as required.
9.
(a) Base case (n = 4): 4! = 24 > 16 = 24 is true.
Induction step: Assume that, for some n N4 , we have n! > 2n . Then
( n + 1 ) ! = ( n + 1 ) n ! > ( n + 1 ) 2n > 5 2n > 2 2n = 2n +1 .
By induction, we have n! > 2n , n N4 .
(b) n N, 113 + 315 + 517 + + (2n1)(1 2n+1) = 2nn+1 . Base case (n = 1): 113 = 211+1 is true.
Induction step: Assume that, for some n N, we have 113 + + (2n1)(1 2n+1) = 2nn+1 .
Then
1
1
1
3
++
(2n 1)(2n + 1)
(2(n + 1) 1)(2(n + 1) + 1)
n +
1
n (2n + 3) + 1
=
=
2n + 1
(2n + 1)(2n + 3)
(2n + 1)(2n + 3)
2
2n + 3n + 1
(2n + 1)(n + 1)
n+1 .
=
=
=
(2n + 1)(2n + 3)
(2n + 1)(2n + 3)
2n + 3
By induction, we have the result n N.
10.
(a) If
p
q
satises the equation, then
p2 + ap + b =
q2 q
p2 + apq + bq2 =
0.
The second and third terms are divisible by q, and so p2 is divisible by q. But gcd( p, q) = 1,
so q must be 1.
2
(b) Suppose that x2 2 = 0 has a rational solution. By part (a), this solution must be an integer.
But x2 = 2 is clearly false for x = 0, 1 (x2 too small), and | x | 2 ( x2 too large), so
there
2
are no integer solutions. It follows that the only solutions to x 2 = 0 (namely 2) are
irrational.
(c) If x2 n = 0 has
a rational solution, then it is an integer. But then n = x2 is the square of
an integer. Thus n is irrational unless n is a perfect square.
(d) Suppose that x2 x 1 = 0 has a rational root n. Then n is an integer satisfying
1
= n2 n = n ( n 1).
We certainly cannot have n = 0, but then we must have n1 = n 1. Thus n1 is an integer,
which can only happen if n 1. In both cases n1 = n 1. Thus all roots of x2 x 1 = 0
are irrational.
11.
(a) Just compute: for example ( f 1 f 2 )( x ) = 1 1/(11 x) = 1 (1 x ) =
f0
f1
f2
f0
f0
f1
f2
f1
f1
f2
f0
x = f 0 ( x ).
f2
f2
f0
f1
(b) For Z3 = {0, 1, 2} with + mod 3, we have
(c) It is clear that : Z3 { f 0 , f 1 , f 2 } : n 7 f n is a bijective function. Under this identication,
the tables in (a) and (b) are identical: but these tables completely describe the operations
and +, whence ( a + b) = ( a) (b) for all a, b Z3 . The two sets with operation
therefore behave identically after the relabeling aorded by .
12.
(a) Suppose that f ( x ) = f (y). Then x and y are have the same binary expansion and are thus
equal. Hence f is injective.1
(b) C is precisely the set of numbers in [0, 1] possessing a ternary expansion consisting only of
0s and 2s. Thus g( X ) C for all X N. The uniqueness of the ternary representation of
an element of C means that g is injective. Moreover, g is surjective since
(
)
x = g {n N : bn = 2 in the ternary expansion of x} .
(c) Since C [0, 1], we can combine parts (a) and (b) to conclude that
|P (N)| = |C| |[0, 1]| = c |P (N)| .
CSB allows us conclude that these cardinalities are equal: |P (N)| = |C| = c.
f is well-dened. Note that f is not surjective: choosing
}. However 12 = 21n which means that the set X =
1 We only need the choice of terminating expansion to be sure that
the terminating representation of
{2, 3, 4, 5, . . .} is not in the image of f .
1
2
means that
( 12 )
= {1
n =2
