APPENDIX X

Yearly Exams

IPM (G5087) Autumn 2011 Yearly Exams p.1 24.1. BSc/MMath EXAMINATIONS 2009 MATHEMATICS: Introduction to Pure Mathematics G5087 n-th June 2009 2.00 pm3:30 pm Attempt all questions. Time allowed: ONE and a HALF hours. Each question carries TWENTY marks. The numbers beside the questions indicate the approximate marks that can be gained from the corresponding parts of the questions. 1. (a) Let E := {2n : n N0 }, F := {n N : n is prime} and G := {k + 5 : k E}. Decide whether each of the following is true or false and back your answer with an explanation (i) E F = , (ii) E G = , (iii) E G = , (iv) F G = .

[8 marks]

(b) Let Ai be a given set for each i I , where I is a nonempty set of indexes. Dene (in words or symbols) their intersection i=I Ai . (c) Build a sequence of sets {Ai : i N} such that N N:
N

[4 marks] [4 marks]

Ai =
i=1

and
i=1

Ai = .

(1)
[4 marks]

(d) A sweet maker produces two types of chocolate: dark and milk, with the rule that the dark chocolate must be wrapped in red or blue paper. A workshop sample tray is composed of three wrapped chocolates: one yellow, one red and one blue. (i) What is the minimum number of chocolates one must unwrap, in order to ensure the rule holds true for this sample? Explain. (ii) Two persons, of which one is a dark-only chocolate lover and one is a milkonly lover, are presented with the tray. Both persons know the rule and are asked to choose exactly one of the wrapped chocolates. Which one is guaranteed to satisfy her taste? Explain. 2. (a) Using induction, prove that
n k=1

1 k 2 = n(n + 1)(2n + 1), n N. 6 {1}; using induction, prove that

n1

(1)

(b) Let a R and r R

ark = a
k=0

rn 1 , n N. r1
[3 marks]

3. (a) Fill in the boxes in the following: Theorem (Euclidean division). For each m N0 and n N there exists a unique pair (q, r) N2 such that 0 m=
(i)

+r

and

(ii)

(iii)

n 1.

(1)

In this problem we denote the rest of the division of m by n by (b) Given a N0 , b N dene their highest common factor (also known as greatest common divisor ) hcf (a, b). 1 modn m := r for m, n, r as in the Euclidean Division Theorems statement. (2)
[3 marks]

IPM (G5087) Autumn 2011 Yearly Exams p.2 (c) Which of hcf (9, 12) and hcf (0, 12) is bigger? Hint. All positive integers are factors (i.e., divisors) of 0. (d) Show that hcf (0, m) = m for m N. (e) Prove that for any m N0 and n N we have hcf (n, m) = hcf ( modn m , n) . (3) Hint. Put r := modn m, h := hcf (n, m) and g := hcf (r, n), and use parts (a) and (b) to show that h g and g h. (f) Fix now a, b N0 with b > 0 and consider the sequence of numbers rk , k = 1, 0, 1, 2, . . . , dened recursively by if k = 1, b, a, if k = 0, rk := (4) modrk1 rk2 , if k 1 and rk1 > 0 0, if k 1 and rk1 = 0. Show that there exists a K N such that rK > 0, rK+1 = 0 and that hcf (a, b) = rK . 4. For each of the following ve functions nd out if it is injective, surjective, bijective or none. Back your claims with proofs or counterexamples, as appropriate. (a) f : Z Z with f (x) = x + 3, (b) g : Q {0} Q with g(x) = 1/x, (c) h : N N with h(x) = x + 3, 5. Let n, k N0 and k n. (a) Give an expression for (d) k : Q Q+ with k(x) = x2 . 0 (e) j : P(A) P(A) with j(X) = A X and P(A), the power set of A, for a given set A.
[2 marks]

[2 marks] [6 marks]

[4 marks]

[4 5 marks]

n k

involving n, k and the factorial.

n k

[4 marks]

. (You (b) Show that the number of subsets of [1 : n] with exactly k elements are do not need to use induction, an intuitive argument is enough.) (c) Show that the number of all the possible injective maps from [1 : k] into [1 : n] is given by k! n . k

[8 marks]

[8 marks]

IPM (G5087) Autumn 2011 Yearly Exams p.3 Solution of Exam IPMG5087, Summer 2009 1. (a) Let E := {2n : n N0 }, F := {n N : n is prime} and G := {k + 5 : k E}. Decide whether each of the following is true or false and back your answer with an explanation (i) E F = , (ii) E G = , (iii) E G = , (iv) F G = .

[8 marks]

(b) Let Ai be a given set for each i I , where I is a nonempty set of indexes. Dene (in words or symbols) their intersection i=I Ai . (c) Build a sequence of sets {Ai : i N} such that N N:
N

[4 marks] [4 marks]

Ai =
i=1

and
i=1

Ai = .

(1)
[4 marks]

(d) A sweet maker produces two types of chocolate: dark and milk, with the rule that the dark chocolate must be wrapped in red or blue paper. A workshop sample tray is composed of three wrapped chocolates: one yellow, one red and one blue. (i) What is the minimum number of chocolates one must unwrap, in order to ensure the rule holds true for this sample? Explain. (ii) Two persons, of which one is a dark-only chocolate lover and one is a milk-only lover, are presented with the tray. Both persons know the rule and are asked to choose exactly one of the wrapped chocolates. Which one is guaranteed to satisfy her taste? Explain.
Solution. (a) Note that E is just the set of non-negative even numbers. (i) False because 2 is both prime (so in F ) and even (so in E). Thus 2 E F , which makes it nonempty. (ii) False because both E and G are nonempty and so must be their union, E G, which has both as subsets. (iii) True. If a number m E G then n = 2n for some n N and m = 2l + 5 for some l N and thus 2n = 2l + 5, which implies that 5 = 2(n l) which is false. By contraposition there can be no number m N in E G, but E G N so it is empty. (iv) False. Both 7 F and 7 G are true, thus 7 F G. (b) The intersection of the collection {Ai : i I } is the set that consists of those elements that are in each single Ai , for all i I . In symbols this is written as follows, let i be any xed element in I (who is non-empty by assumption) then Ai := {x Ai : i I : x Ai } .
iI

(2)

As observed in class, the choice of which i to work with makes no dierence. (c) A possible example is to take Ai to be the set of positive multiples of i, for i N. Then if N N N, the set i=1 Ai = A1 A2 AN (call it BN for short) is that of numbers that are simulatneously multiples of 1, 2, . . . , N . One such number is N ! = 1 2 N . So N ! BN is thus BN =. On the other hand, let B := iN Ai , we want to show that B = . Arguing by contradiction, suppose B = , so there is a number M N and M B = nN An . By taking n = M +1 in the intersection, it follows that M AM +1 , i.e., M is a multiple of M + 1, which implies M M + 1 which is absurd So B is empty as claimed. (d) Although not necessary, it may help you if you write the rules statement as follows t(c) = dark w(c) = blue or w(c) = red, where t is the type function and w is the wrapper color function. (3)

IPM (G5087) Autumn 2011 Yearly Exams p.4

Note that the equivalent contrapositive statement, which will be quite useful, is that a non-blue and non-red wrapped chocolate must be (non-dark, hence) milk. Indeed this is the translation in English of w(c) = blue and w(c) = red t(c) = milk (= dark). (4) (i) To ensure the rule, it is enough to unwrap the yellow chocolate. It is milk, then the rule is true. If it is dark then the rule is false. The answer is thus one. (ii) A milk-only lover can guarantee a choccy to their taste by choosing yellow. A dark-only lover, who will clearly avoid the yellow, may still be disappointed as red or blue need not contain dark.

IPM (G5087) Autumn 2011 Yearly Exams p.5

2. (a) Using induction, prove that

n k=1

1 k 2 = n(n + 1)(2n + 1), n N. 6

(1)

(b) Let a R and r R

{1}; using induction, prove that

n1

ark = a
k=0

rn 1 , n N. r1

Solution. n (a) Let us write L(n) := k=1 k 2 and R(n) := n(n + 1)(2n + 1)/6; we must prove L(n) = R(n) for all n N. First we check the base case, n = 1,
1

L(1) =
k=1

k 2 = 12 = 1 and R(1) =

1 6 1(1 + 1)(2 1 + 1) = = 1 L(1) = R(1). 6 6

(2)

Next let us prove the Inductive Step. For this assume L(n 1) = R(n 1) (IH), and let us show L(n) = R(n). We have
n1

L(n) =
k=1 (by denition of L) (by the Inductive Hypothesis (IH)) (by denition of R and algebra)

k 2 + n2

= L(n 1) + n2 = R(n 1) + n2 (n 1)n(2(n 1) + 1) + 6n2 = 6 n ((n 1)(2n 1) + 6n) = . 6 (3)

(more algebra)

To nish we must just prove that (n 1)(2n 1) + 6n = (n + 1)(2n + 1), but this is true as elementary algebra shows: (n 1)(2n 1) + n = 2n2 2n n + 1 + 6n = 2n2 + 3n + 1, (n + 1)(2n + 1) = 2n + 2n + n + 1 = 2n + 3n + 1. Thus L(n) = R(n) and the proof is complete. (b) The Base Case, n = 1, is checked as follows:
0 2 2

(4) (5)

ark = ar0 = a and a

k=0

rn 1 r1 =a = a, r1 r1

(6)

which implies that the two members are equal for n = 1. To prove the Inductive Step, assume the Inductive Hypothesis for n, i.e.,
n1

ark = a
k=0

rn 1 , r1

(IH)

IPM (G5087) Autumn 2011 Yearly Exams p.6

we want to prove the equality with n + 1 replacing n.
n n1

ark =
k=0 k=0 n

ark + arn

(algebra)

=a

r 1 + arn (using (IH)) r1 rn 1 + rn+1 rn =a (algebra) r1 rn+1 1 , =a r1

(7)

as desired.

IPM (G5087) Autumn 2011 Yearly Exams p.7

3. (a) Fill in the boxes in the following: Theorem (Euclidean division). For each m pair (q, r) N2 such that 0 m=
(i)

[3 marks]

N0 and n N there exists a unique

(iii)

+r

and

(ii)

n 1.

(1)

In this problem we denote the rest of the division of m by n by modn m := r for m, n, r as in the Euclidean Division Theorems statement. (2)
[3 marks] [2 marks]

(b) Given a N0 , b N dene their highest common factor (also known as greatest common divisor ) hcf (a, b). (c) Which of hcf (9, 12) and hcf (0, 12) is bigger? Hint. All positive integers are factors (i.e., divisors) of 0. (d) Show that hcf (0, m) = m for m N. (e) Prove that for any m N0 and n N we have hcf (n, m) = hcf ( modn m , n) . (3)

[2 marks] [6 marks]

Hint. Put r := modn m, h := hcf (n, m) and g := hcf (r, n), and use parts (a) and (b) to show that h g and g h. (f) Fix now a, b N0 with b > 0 and consider the sequence of numbers rk , k = 1, 0, 1, 2, . . . , dened recursively by if k = 1, b, a, if k = 0, rk := (4) modrk1 rk2 , if k 1 and rk1 > 0 0, if k 1 and rk1 = 0. Show that there exists a K N such that rK > 0, rK+1 = 0 and that hcf (a, b) = rK .
Solution. (a) The complete statement reads: Theorem (Euclidean division). For each m (q, r) N2 such that 0 m = nq +r and 0

[4 marks]

N0

and n

there exists a unique pair

n 1.

(5)

(b) The highest common factor of a and b is that number h N such that h|a and (k | a and k | b) k h. We denote h = hcf (a, b). More concisely this can be written as hcf (a, b) := max {k N : k | a and k | b} (8) (7) and h|b (6)

(c) We have hcf (9, 12) = 3 and hcf (0, 12) = 12. So hcf (9, 12) < hcf (0, 12). (d) All natural numbers divide 0. Hence 0 and ns common factors are all the factors of n, and the highest one is n. Thus hcf (0, n) = n.

IPM (G5087) Autumn 2011 Yearly Exams p.8

(e) Let us denote modn m =: r, h := hcf (n, m) and g = hcf (r, n). We want to show that h = g. We rst show that g h. Since g = hcf (r, n) we have g | r and g | n, which implies that r = r g and n = n g for some r , n N. But by the Euclidean Division we have that m = qn + r for some q N, thus m = qn g + r g = (qn + r ) g, (9) which means that g | m. Hence, recalling that h = hcf (n, m) and g | m, we have g h. To conclude we still have to show h g. Since h = hcf (n, m) we have h | n and h | m, so n = n h and m = m h. Now, by the Euclidean Division we have 0 r = m qn = (m qn ) h, (10) so m qn N0 and h divides r. But h divides also n, so it is a common factor of n and r and thus h g, as claimed. (f) By the Euclidean Division (a) we have that for each k N0 either that rk = 0 and rk < rk1 or rk1 = 0 and rk = 0. Consider the set R := {rk : rk > 0}. Since r1 = m > 0, then r1 R and the set R is thus non-empty. By the Well-Ordering Principle, it follows that R N has a smallest element, i.e., there exists a K N such that rK = min R. Note also that rK+1 R (because rK+1 < rK and rK is the smallest element in R) so rK+1 = 0. Furthermore, by (e), we have that hcf (rk2 , rk1 ) = hcf (rk , rk1 ) , for k 1 and rk1 = 0. In particular it follows that hcf (a, b) = hcf (r1 , a) = = hcf (rK+1 , rK ) . hcf (a, b) = rK . (12) (13) But rK+1 = 0 and rK > 0, so by (d) we have that hcf (rK+1 , rK ) = hcf (0, rK ) = rK . Hence (11)

IPM (G5087) Autumn 2011 Yearly Exams p.9

4. For each of the following ve functions nd out if it is injective, surjective, bijective or none. Back your claims with proofs or counterexamples, as appropriate. (a) f : Z Z with f (x) = x + 3, (b) g : Q {0} Q with g(x) = 1/x, (c) h : N N with h(x) = x + 3, (d) k : Q Q+ with k(x) = x2 . 0 (e) j : P(A) P(A) with j(X) = A X and P(A), the power set of A, for a given set A.

[4 5 marks]

Solution. Reminders A function : Dom Cod is injective if and only if (x) = (y) x = y and it is surjective if and only if y Cod : x Dom : (x) = y. A function is bijective if and only if it is simultaneously injective and surjective. (a) f is injective. Indeed, let x1 , x2 Z such that f (x1 ) = f (x2 ). If follows that x1 + 3 = x2 + 3 so x1 = x2 (by denition of f ) (by subtracting 3 from each member). (3) (2) (1)

f is surjective. Indeed, suppose y Z, consider the element x := y 3, then f (x) = x + 3 = (y 3) + 3 = y. f is thus bijective. (b) g is injective. Indeed, suppose x1 , x2 Q 1 1 = x1 x2 thus x1 = x2 (4)

{0} with g(x1 ) = g(x2 ), it follows that (5)

(by denition of g) (by inverting both members).

g is not surjective. Indeed the element 0 belongs to the codomain Q, but there is no x Q {0} such that 1/x = 0. g is therefore not bijective. (c) h is injective for the same arguments used for f and because of the cancellation law in N. h is not surjective (unlike f ). Indeed, the element 2 cannot be written as h(x) for any x N; the only x that works is x = 1 which is not an element of N. h is not bijective. (d) k is not injective. Indeed, we have f (1) = 1 = f (1), yet 1 = 1. k is not surjective. Indeed, the element 2 Q+ has no counterimage in Q. The only elements that 0 work are 2 which are known to be irrational numbers, therefore not in Q. k is not bijective (e) j is injective. Let X, Y P(A), which the same as X, Y A and suppose j(X) = j(Y ). Then A X = A Y . But, by denition of complementation, we know that Z=A It follows that X=A (A X) = A (A Y ) = Y. (7) (A Z) Z P(A) . (6)

IPM (G5087) Autumn 2011 Yearly Exams p.10

j is surjective. Let Y Cod j = P(A), we want X Dom j = P(A) such that j(X) = Y , which is equivalent to A X = Y . Let X := A Y , it follows then, by (6), that j(X) = A j is thus bijective. X=A (A Y ) = Y. (8)

10

IPM (G5087) Autumn 2011 Yearly Exams p.11

5. Let n, k N0 and k n. (a) Give an expression for n involving n, k and the factorial. k (b) Show that the number of subsets of [1 : n] with exactly k elements are . (You do not need to use induction, an intuitive argument is enough.) (c) Show that the number of all the possible injective maps from [1 : k] into [1 : n] is given by k! n . k
Solution. (a) An expression is given by the formula n k = n! . (n k)!k! (1)
n k

[4 marks]

[8 marks]

[8 marks]

(b) Let us use a counting argument, by building a generic k-element subset K = {x1 , x2 , . . . , xk } [1 : n]. We have n elements to choose x1 from; then n 1 elements are left to choose x2 from; then n 2 to choose x3 from;. . . ; then n k + 1 to choose xk from. In total we have n! n (n 1) (n 2) (n k + 1) = (2) (n k)! choices. Notice however that we have counted sets too many times; indeed, dierent ways of choosing can lead to the same set K, because sets do not change under permutations of their elements (for example K = {x1 , x2 , . . . , xk } and J = {x2 , x1 , . . . , xk } represent the same set, although picked in a dierent order). We have therefore to divide the total by all the possible ways of ordering a set of k elements. But this is known to be k! (indeed, the rst element can be chosen among k, the second among k 1, etc.). Thus the total number of subsets K [1 : n] with k elements is given by n! n = . (3) k (n k)!k! (An alternative, rigorous, proof can be given using induction. See the homework problems for such a proof.) (c) Let us count the number of injective maps f : [1 : k] [1 : n]: choose f (1) in {1, . . . , n}, i.e., in n dierent ways; choose f (2) in {1, . . . , n} {f (1)}, i.e., in n 1 dierent ways (f (1) has to be excluded because, by injectivity of f we must have f (1) = f (2)); etc. choose f (k) in {1, . . . , n} {f (1), . . . , f (k 1)}, i.e., in n k + 1 possible dierent ways. In total the number of possible choices is n! n n (n 1) (n 2) (n k + 1) = = k!, (4) (n k)! k as claimed. (Also here the result can be proved by induction on n.)

11

IPM (G5087) Autumn 2011 Yearly Exams p.12 24.2. BSc/MMath EXAMINATIONS 2010 MATHEMATICS: Introduction to Pure Mathematics G5087 n-th June 2010 2.00 pm3:30 pm Attempt all questions. Time allowed: ONE and a HALF hours. Each question carries TWENTY marks. The numbers beside the questions indicate the approximate marks that can be gained from the corresponding parts of the questions. 1. For each positive integer i N, consider the set Di := {k N : k divides i} . ()
[6 marks] [6 marks] [4 marks]

(a) Describe D9 and D15 by listing all their elements. (b) Find max(D9 D15 ). What is this number, with respect to 9 and 15. (c) Simplify the expression D3n ,
nN

()

by listing all the elements of the resulting set, or otherwise. (d) Prove your answer in ((b)) is correct. 2. Prove the following 2 identities by induction on n:
n

[4 marks] [2 10 marks]

k=
k=1 n

n(n + 1) , n N, 2 n+1 , n N and n 2. 2n

(a) (b)
[3 marks]

1
k=2

1 k2

3. (a) Complete the boxes in the following Denition. We say that p N is a prime number if and only if n divides p and p
(i)

or

(ii)

(1)
(iii)
[4 marks]

(b) Let p be a prime number, and a, b N such that p divides ab but p does not divide a. Based on a theorem from class, prove that hcf (b, p) = p. (2)

(c) What if p were not prime in (b), would the result still hold? Back your answer with an example. 4. For each one of the following functions decide if it is (i) injective, (ii) surjective, (iii) bijective and prove your answer, in each case. (a) g : Z Z with g(x) := 2x. (c) k : Z Z with k(x) := x + 5. (b) h : N N with h(x) := x + 5. (d) : Q Z with x := oor of x. (The oor, x , of x R is by denition the largest possible k Z such that k x.) 5. (a) Let n be the cardinality of a nite set A, and let k N0 and k n. Complete the following denition n k := number of subsets of
(i)

[3 marks]

[4 5 marks]

[5 marks]

containing exactly

(ii)

elements.

()

12

IPM (G5087) Autumn 2011 Yearly Exams p.13 (b) Give an explicit formula for n in terms of n and k. k (c) Among all digital expansions of exactly 7 digits, how many are there with only 1 and 2 appearing in them (e.g., 1111211 and 1212121)? Explain your answer. (d) How many are there with exactly 4 gures 1 and 3 gures 2 (e.g., 1121122)? Explain your answer.
[5 marks]

[5 marks]

[5 marks]

13

IPM (G5087) Autumn 2011 Yearly Exams p.14 Solution of Exam IPMG5087, Summer 2010 1. For each positive integer i N, consider the set Di := {k N : k divides i} . ()
[6 marks] [6 marks] [4 marks]

(a) Describe D9 and D15 by listing all their elements. (b) Find max(D9 D15 ). What is this number, with respect to 9 and 15. (c) Simplify the expression D3n ,
nN

()

by listing all the elements of the resulting set, or otherwise. (d) Prove your answer in ((b)) is correct.
Solution. (a) D9 = {1, 3, 9} and D15 = {1, 3, 5, 15}. (b) max(D9 D15 ) = max {1, 3} = 3, this is the highest common factor of 9 and 15 denoted hcf (9, 15). (c) We have D3n = D3 . (1)
nN

[4 marks]

(d) From the denition of intersection and that of the sets () we have
nN

D3n := {k N} k divides 3n, for all n N.

(2)

Now 1 and 3 both divide all numbers of the form 3n with n N, hence {1, 3}
nN

D3n .

(3)

To prove the reverse inclusion, we note that {1, 3} = D3 and that an intersection of a collection of sets is subset of each one the collections sets, hence
nN

D3n D3 = {1, 3} .

(4)

14

IPM (G5087) Autumn 2011 Yearly Exams p.15

2. Prove the following 2 identities by induction on n:

n

[2 10 marks]

k=
k=1 n

n(n + 1) , n N, 2 n+1 , n N and n 2. 2n

(a) (b)

1
k=2

1 k2

Solution. Proof of (a). The base case is clearly satised

1

k=1=
k=1

1(1 + 1) . 2

(3)

To prove, the inductive step, x n and assume the inductive hypothesis holds true:
n1

=
k=1

(n 1)n . 2
n1

(4)

The we have
n

=
k=1 (inductive hypothesis (4)) k=1

+n (5)

(basic algebra)

(n 1)n +n 2 (n + 1)n (n 1 + 2)n = , = 2 2 =

as desired. Proof of (b). The Base Case (for n = 2, because n = 1 does not make sense in this formula) is
2

1
k=2

1 22

=1

1 3 2+1 = = . 4 4 22

(6)

To prove the inductive step, x n 3 assume the inductive hypothesis

n1

1
k=2

1 k2

n . 2(n 1)

(7)

Then we have
n

1
k=2

1 k2

n1

=
k=2

1 k2

1 n2

n 1 1 2 2(n 1) n n n2 1 = 2(n 1) n2 (n + 1)(n 1) (n + 1) = = , 2(n 1)n 2n = as claimed.

(8)

15

IPM (G5087) Autumn 2011 Yearly Exams p.16

3. (a) Complete the boxes in the following Denition. We say that p N is a prime number if and only if n divides p and p
(i)

[3 marks]

or

(ii)

(1)
(iii)
[4 marks]

(b) Let p be a prime number, and a, b N such that p divides ab but p does not divide a. Based on a theorem from class, prove that hcf (b, p) = p. (2)

(c) What if p were not prime in (b), would the result still hold? Back your answer with an example.
Solution. (a) Denition. We say that p N is a prime number if and only if n divides p n = 1 and p 2 (b) Since p is prime and p | ab, but p a then p | b, by the Atomic Property of Primes (Theorem proved in class). Hence p is a common factor of p and b, but it is also the highest such facto, becaus there is no number bigger than p that divides p. (More precisely, we could say that p | hcf (p, b) and thus p hcf (p, b) p, which implies that p = b.) (c) If p is not prime then (2) then the result does not hold. A counterexample is given by p = 6 (not prime), a = 3 and b = 4, in which case we have p=6 3=a p = 6 | 12 = ab yet hcf (p, b) = 2 = 6 = p. (4) or n = p (3)

[3 marks]

16

IPM (G5087) Autumn 2011 Yearly Exams p.17

4. For each one of the following functions decide if it is (i) injective, (ii) surjective, (iii) bijective and prove your answer, in each case. (a) g : Z Z with g(x) := 2x. (c) k : Z Z with k(x) := x + 5. (b) h : N N with h(x) := x + 5. (d) : Q Z with x := oor of x. (The oor, x , of x R is by denition the largest possible k Z such that k x.)
Solution. (i) The function g is injective. Indeed, for any x, y Z such that g(x) = g(y), it follows that 2x = 2y x = y. (1) The function g is not surjective. For example, the element 3 Z in the codomain has no counterimage for g in Z, because this would mean that 2x = 3 for some x Z, i.e., x = 3/2 Z which is clearly false. (ii) The function h is injective. Indeed, for any x, y N with h(x) = h(y) it follows that x + 5 = y + 5 x = y. (2) The function h is not surjective. Indeed, the element 1 N has no counterimage for h in N as this would imply that 1 = h(x) = x + 5 for some x N, leading to 4 = x N which is clearly false. (iii) The function k is injective and this can be shown in the same way as for h. The function k is surjective. Indeed, for any y Z, taking x = y 5 Z it follows that k(x) = x + 5 = (y 5) + 5 = y. I.e., any y Z has a counterimage for k in Z. (iv) The function is not injective. For example x = 1.1 and y = 1.2 which are clearly dierent yet they satisfy x = 1 = y . The function is surjective. Indeed for any y Z, since y Q, y is its own counterimage.

[4 5 marks]

[3 marks]

[2 marks] [3 marks]

[2 marks] [2 marks]

[3 marks] [2 marks]

17

IPM (G5087) Autumn 2011 Yearly Exams p.18

5. (a) Let n be the cardinality of a nite set A, and let k N0 and k n. Complete the following denition n := number of subsets of (i) containing exactly (ii) elements. () k (b) Give an explicit formula for n in terms of n and k. k (c) Among all digital expansions of exactly 7 digits, how many are there with only 1 and 2 appearing in them (e.g., 1111211 and 1212121)? Explain your answer. (d) How many are there with exactly 4 gures 1 and 3 gures 2 (e.g., 1121122)? Explain your answer.
Solution. (a) n k (b) n k = n(n 1) . . . (n k + 1)! n! = . k!(n k)! k! (1) := number of subsets of A containing exactly k elements. ()

[5 marks]

[5 marks]

[5 marks]

[5 marks]

(c) All we need to nd out is where we put the 1 gure (then the 2s are automatically determined by the vacant positions). Since there are 7 possible positions to choose from, we need to count the number of all possible subsets of a set of 7 elements. That is 27 = 128. (d) We have to nd out in how many ways we can choose 4 elements out of 7. That is 7 choose 4, i.e., 7 765 = = 35. (2) 4 32

18

IPM (G5087) Autumn 2011 Yearly Exams p.19 24.3. BSc/MMath EXAMINATIONS 2011 MATHEMATICS: Introduction to Pure Mathematics G5087 n-th June 2011 2.00 pm3:30 Attempt all questions. Time allowed: ONE and a HALF hours. Each question carries TWENTY marks. The numbers beside the questions indicate the approximate marks that can be gained from the corresponding parts of the questions. 1. (a) Let A and B denote two sets. By using words or logical symbols, write denition, of their union, A B. (b) Recall that N denotes the set of all positive integers. Let E := {5k : k N and and F := {3k : k N and k 2}. For each of the following statements, whether it is true or false: (i) 5 E, (ii) 10 E, (iii) 10 E F, (iv) 10 E F, (v) x prime E F. pm

the
[5 marks]

k 2} say

x
[5 marks]

(c) Consider the indexed collection of sets {Ai : i I }, with the index set I = . State, with the help of words and/or logical symbols, the denition of the collections union, iI Ai . (d) Let En := {x Q : 1/n x 1}, for n N. Find out which one of the following equals nN En , and prove your claim. (i) {x Q : 0 < x 1} (ii) {x Q : 0 x 1} (iii) {0, 1}

[5 marks]

[5 marks]

19

IPM (G5087) Autumn 2011 Yearly Exams p.20 2. (a) State the four properties that make (Z, +) an Abelian group. (b) Suppose x1 , x2 R. Show that if x1 Z and x1 + x2 Z then x2 must be in Z. (c) Suppose x1 , x2 R both statisfy, for some a, b, c R, the equality ax2 + bxi + c = 0, for i = 1, 2, i and that x1 = x2 . Show that x1 + x2 = b/a. (d) Let f : A B be a function, what does it mean for f to be injective? (e) Show that the function f: (1)
[4 marks] [4 marks] [4 marks] [4 marks]

Z x 2x2 + x

(2)
[4 marks]

is injective. Hint. Use (d), suppose f (x1 ) = f (x2 ) and recall (c). 3. [(a) ] Prove by induction that
n k=1

1 k 2 = (2n + 1)(n + 1)n, 6 n3 3n n N.

n N,

(1)

Prove by induction that (2) Hint. For (2) it will be useful to remember that (a + b)3 = a3 + 3a2 b + 3ab2 + b3 , to show the cases n = 1, 2 by hand, and to put the base case of the induction at n = 3.

20

IPM (G5087) Autumn 2011 Yearly Exams p.21 4. Let m N0 and M := [1 : m] := {k N : 1 k m}. (a) Fix k N0 such that k m. Give the denition of the binomial coecient m k as the cardinality of a subcollection of the power set P(M ). (b) What is the cardinality of P(M )? (c) Using the denition in (a) and the answer in (b), explain why the following formula is true: m m m 2 = . (1) k
k=0

[5 marks] [5 marks]

[5 marks]

(d) Expand (a + using the Binomial Theorem, and use the result to show algebraically that (1) is true. 5. (a) Illustrate the Euclidean Algorithm by nding hcf (287, 205). (b) Find x, y Z that solve the equation 287x + 205y = 164. (Non-integer solutions are not accepted.) (c) Find another solution x , y to (1). (d) Can you do the same for 287x + 205y = 165? Explain your answer (2) (1)

b)m

[5 marks] [5 marks]

[5 marks] [5 marks]

[5 marks]

21

IPM (G5087) Autumn 2011 Yearly Exams p.22 Solution of Exam IPMG5087, Summer 2011 1. (a) Let A and B denote two sets. By using words or logical symbols, write the denition, of their union, A B. (b) Recall that N denotes the set of all positive integers. Let E := {5k : k N and k 2} and F := {3k : k N and k 2}. For each of the following statements, say whether it is true or false: (i) 5 E, (ii) 10 E, (iii) 10 E F, (iv) 10 E F, (v) x prime x E F.
[5 marks] [5 marks]

(c) Consider the indexed collection of sets {Ai : i I }, with the index set I = . State, with the help of words and/or logical symbols, the denition of the collections union, iI Ai . (d) Let En := {x Q : 1/n x 1}, for n N. Find out which one of the following equals nN En , and prove your claim. (i) {x Q : 0 < x 1} (ii) {x Q : 0 x 1} (iii) {0, 1}

[5 marks]

[5 marks]

Solution. (a) The union of A with B, A B, is the set {x : x A or x B} . (1) In words A B is the set whose elements are all those elements which are at least in one of A or B. (b) (i) false, (ii) true, (iii) false, (iv) true, (v) true. (c) Let i0 I (such and i0 exists given that I = ). The union of the collection {Ai : i I }, iI Ai , is dened as the set {x : i I : x Ai } . (2) In words, iI Ai is the set whose elements consist of the elements that are in some Ai for at least one i I . (d) The correct guess is (i): U :=
nN

En = {x Q : 0 < x 1} =: E.

(3)

To show the result this, lets prove that U E and E U . Since En E for each n, then the union U E. To prove the reverse inequality, we have to show that if some x0 Q satises 0 < x0 1 then there exists n0 for which x0 En0 , which is equivalent to say that 1 x0 1. (4) n0 The second inequality is trivial; to prove the second one, recalling that x0 Q then x0 = a/b for some a, b N (they may be chosen both postive). By the Archimedean property of N, there is always n0 such that n0 b/a. Since both n0 and a/b are positive it follows that 1/n0 a/b.

22

IPM (G5087) Autumn 2011 Yearly Exams p.23 2. (a) State the four properties that make (Z, +) an Abelian group. (b) Suppose x1 , x2 R. Show that if x1 Z and x1 + x2 Z then x2 must be in Z. (c) Suppose x1 , x2 R both statisfy, for some a, b, c R, the equality ax2 + bxi + c = 0, for i = 1, 2, i and that x1 = x2 . Show that x1 + x2 = b/a. (d) Let f : A B be a function, what does it mean for f to be injective? (e) Show that the function f: (1)
[4 marks] [4 marks] [4 marks] [4 marks]

Z x 2x2 + x

(2)
[4 marks]

is injective. Hint. Use (d), suppose f (x1 ) = f (x2 ) and recall (c).
Solution. (a) (Z, +) is an Abelian group because AG1. + is associative in Z, i.e., (x + y) + z = x + (y + z) for all x, y, z Z; AG2. + has a neutral element in Z, namely 0 Z satises x + 0 = 0 + x = x, for all x Z; AG3. each element x in Z has an additive inverse, namely x because x + (x) = 0; AG4. + is commutative in Z. (b) Since x1 Z we have x1 Z. Also x1 + x2 Z and (Z, +), hence x2 = (x1 + x2 ) + (x1 ) Z.
Z Z

(3)

(c) Suppose x1 and x2 satisfy the quadratic equation (1), then b b b b2 4ac and thus x1 + x2 = 2 = . x1,2 = 2a 2a a (Alternatively, if x1 and x2 are the roots of the quadratic polynomial ax2 + bx + c then ax2 + bx + c = a(x x1 )(x x2 ) = ax2 a(x1 + x2 )x + ax1 x2 hence, by the identity principle for polynomials, we must have b a(x1 + x2 ) = b and thus x1 + x2 = .) a (Even more simple solution, suppose x1 and x2 satisfy ax2 + bx1 + c = 0 = ax2 + bx2 + c 1 2 then we have 0 = a(x2 x2 ) + b(x1 x2 ) = (a(x1 + x2 ) + b) (x1 x2 ). 1 2 Since x1 x2 = 0 this implies that a(x1 + x2 ) + b = 0, whence b x1 + x2 = .) a (d) The function f is called injective if and only if f (x1 ) = f (x2 ) x1 = x2 . x R,

(4)

(5)

(6)

(7) (8) (9) (10)

(11)

(e) The function is injective. Suppose, by contradiction, that there are x1 , x2 Z, x1 = x2 , such that f (x1 ) = f (x2 ). Then for some c Z we have 2x2 + xi + c = 0 for both i = 1, 2. i By (c) it follows that x1 + x2 = 1/2. On the other hand from (b) we have x1 + x2 1/2 Z which is a contradiction. (12)

Z, hence

23

IPM (G5087) Autumn 2011 Yearly Exams p.24

3. [(a) ] Prove by induction that

n k=1

1 k 2 = (2n + 1)(n + 1)n, 6

n N,

(1)

n3 3n n N. (2) Hint. For (2) it will be useful to remember that (a + b)3 = a3 + 3a2 b + 3ab2 + b3 , to show the cases n = 1, 2 by hand, and to put the base case of the induction at n = 3.
Solution. (a) Inductive step: suppose (1) is true for n 1, i.e.,
n1

Prove by induction that

k2 =
k=1

1 (2n 1)n(n 1), 6

(3)

let us prove (1):

n n1

k2 =
k=1 k=1

k 2 + n2

1 (2n 1)n(n 1) + 6n2 6 n n = 2n2 3n + 1 + 6n = 2n2 + 3n + 1 6 6 n = (2n + 1)(n + 1), 6 =

(4)

as desired. 1 The base case is easily checked for n = 1, as k=1 k 2 = 1 = 3 2 1/6. (b) For n = 1 we have n3 = 13 = 1 and 3n = 31 = 3, thus (2) is true. For n = 2 we have n3 = 23 = 8 and 3n = 32 = 9, thus (2) is also true. For n = 3 we have n3 = 33 and 3n = 33 , thus (2) is (barely) true and this proves the base case. Let us prove the inductive step: let n 3, suppose that (2) is true for n we want to prove it for n + 1. By expanding the cube and using n 3 we get (n + 1)3 = n3 + 3n2 + 3n + 1
(using 3 n) (thanks to 3n + 1 n ) (by basic algebra) (by Inductive Hypothesis)
3

n3 + nn2 + (3n + 1) n3 + n3 + n3 3n
3

(5)

= 3n+1 ,

as desired.

24

IPM (G5087) Autumn 2011 Yearly Exams p.25 4. Let m N0 and M := [1 : m] := {k N : 1 k m}. (a) Fix k N0 such that k m. Give the denition of the binomial coecient m as k the cardinality of a subcollection of the power set P(M ). (b) What is the cardinality of P(M )? (c) Using the denition in (a) and the answer in (b), explain why the following formula is true: m m 2m = . (1) k
k=0

[5 marks] [5 marks]

[5 marks]

(d) Expand (a+b)m using the Binomial Theorem, and use the result to show algebraically that (1) is true.
Solution. (a) The binomial coecient m choose k is dened as m k := # {S P(M ) : #S = k} . (2)

[5 marks]

In words, m is the number of all possible dierent choices of a set S consisting of exactly k k elements as a subset of M , which has m elements. (b) #P(M ) = 2#M = 2m (c) The set P(M ) can be partitioned into the sets M (k) := {S P(M ) : #S = k}
m k=0

(3)

for k = 0, . . . , m. We have P(M ) = M (k) and M (k) M (j) = , if k = j, which means that the collection is disjoint; thus the cardinality of the union is given by
m m

#P(M ) =
k=0 m

#M (k) =
k=0

m . k

(4)

On the other hand we have #P(M ) = 2 , whence (1) follows. (d) The Binomial Theorem says that
m

(a + b)m =
k=0

n mk k a b . k
m

(5)

Taking a = 1 and b = 1 we obtain 2m = (1 + 1)m =

k=0

n , k

(6)

which is (1).

25

IPM (G5087) Autumn 2011 Yearly Exams p.26

5. (a) Illustrate the Euclidean Algorithm by nding hcf (287, 205). (b) Find x, y Z that solve the equation 287x + 205y = 164. (Non-integer solutions are not accepted.) (c) Find another solution x , y to (1). (d) Can you do the same for 287x + 205y = 165? Explain your answer
Solution. (a) The Euclidean algorithm gives: 287 = 1 205 + 82 205 = 2 82 + 41 82 = 2 41, hence hcf (287, 205) = 41. (b) Noting that 164 is a multiple of 41 and using the relations in (3) above we may write 164 = 4 41 = 4 (205 2 82) = 4 205 8 (287 205) = 12 205 8 287. So one possible solution of (1) is thus x = 8 and y = 12. (5) (4) (3)

[5 marks]

(1)
[5 marks] [5 marks]

(2)
[5 marks]

(c) There are (innitely many) more solutions. In fact, noting that 205 = 5 41 and 287 = 7 41 we infer that 7 205 5 287 = 0. (6) Combining this identity with (4) we get, for any k Z, that 164 = 164 + 0k = (8 5k)287 + (12 7k)205, (7) which means, for example, for k = 2, that also x = 2 and y = 2 is a solution. (For each other choice of k Z we get another solution.) (d) Equation (2) is unsolvable for x, y Z. If there were x and y such that 287x + 205y = 165 then since, 41 divides both 287 and 205, we would have that 41 divides 165. This would mean mod41 165 = 0, whereas by Euclidean division we know that mod41 165 = 1.

26