Scribd
Upload
309 views9 pages

MATH1081 T1 Answers

This document provides solutions to a past MATH1081 test paper. It includes worked solutions to 3 questions from the test, discusses the use of LaTeX typesetting to write the document, and requests that the solutions only be shared with UNSW MATHSOC members. The solutions are intended to help students study for the test but may contain errors, so students are advised to check the working and explain their own steps.

Uploaded by

James PPD
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
309 views9 pages

MATH1081 T1 Answers

This document provides solutions to a past MATH1081 test paper. It includes worked solutions to 3 questions from the test, discusses the use of LaTeX typesetting to write the document, and requests that the solutions only be shared with UNSW MATHSOC members. The solutions are intended to help students study for the test but may contain errors, so students are advised to check the working and explain their own steps.

Uploaded by

James PPD
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/ 9

MATH1081 Test 1 past paper solutions

c
UNSW
MATHSOC 2013

These solutions were written by Johann Blanco and typed up by Georgia Tsambos.
Please be ethical with this resource. It is for the use of MATHSOC members, so do
not repost it on other forums or groups without asking for permission. If
you appreciate this resource, please consider supporting us by coming to our events and
buying our T-shirts! Also, happy studying :)
We cannot guarantee that our working is correct, or that it would obtain full marks please notify us of any errors or typos at unswmathsoc@gmail.com, or on our Facebook
page. There are sometimes multiple methods of solving the same question. Remember
that in the real class test, you will be expected to explain your steps and working out.
This document was written in mathematical typesetting language called LATEX(pronounced
lay-teck). You can learnt a lot about how LATEXworks by downloading the code for existing documents and fiddling around with it. If you would like to try this, send an
email to unswmathsoc@gmail.com and we can send you the code for this file.

Version 2008 1A
1. Let u {5m 8 | m Z}. Then we can write u = 5m 8 for some m Z. We
have
u = 5m 8 = 5m 10 + 2 = 5(m 2) + 2
and with a bit of work, we can see that
{5m 8 | m Z} = {5n + 2 | n Z}.
Let v {5n + 2 | n Z}. Taking n odd, write n = 2r + 1. We can then write
v = 5n + 2 = 5(2r + 1) + 2 = 10r + 7.
So v {10k + 7 | k Z}. It follows then that
{10k + 7 | k Z} {5m 8 | m Z}
since if n is even, v
/ {10k + 7 | k Z}. 2

2. Let f : A B, g : B C, and x, y A. Suppose g f : A C is injective.


This means that
if

(g f )(x) = (g f )(y),

then x = y.

Now let f (x) = f (y). Then


(g f )(x) = (g f )(f (x)) = g(f (y)) = (g f )(y).
Thus x = y. This proves that f is injective. 2

3. Let k > 1.
LHS =

1
1

2
(k 1)
(k + 1)2

(k + 1)2 (k 1)2
(k 1)2 (k + 1)2

k 2 + 2k + 1 (k 2 2k + 1)
(k 1)2 (k + 1)2

(k 2

4k
1)2

= RHS.

Now
n
X
k=1

(k 2

k
1)2
n

4k
1X
=
2
4 k=2 (k 1)2
=

1
4

5
.
16

n
X

1
1

2
(k 1)
(k + 1)2
k=2

 
 
 


1
1
1
1
1
1
1
1
1 2 +
+
+
+ ...
=

4
3
22 42
32 52
44 62


1
1
1
1
1
1
=
1 + 2 2 + 2 2 + 4 ...
4
2
3
3
4
4


1
1
1+
=
4
4

These are telescoping sums. We can rearrange them because


1
1

0 as k ,
2
(k 1)
(k + 1)2
and because the sum converges. 2?

2008 Version 1B
1. Let A1 = {a}, A2 = A1 {A1 }, A3 = A2 {A2 }.
i.
A3 = A2 {A2 }
= [A1 {A1 }] {A1 {A1 }}
= {a} {{a}} {{a} {{a}}}.
So the elements of A3 are a, {a}, {{a}}. 2
ii.

a. {{a}} A3 . True. {{a}} is in the list of elements of A3 .


b. {{a}} A3 . True, as {a} A3 .
(This question hurts our brain, someone please check this working!)

2. See 2008 version 1A, Q2.

3. Let k > 1. We have


LHS =

6
7
1
+
k1 k k+1

(k + 1) 7(k 1) 6
+
(k 1)(k + 1
k

8 6k 6
+
k2 1 k

8k 6k 2 + 6(k 2 1)
k(k 2 1)

8k 6
k(k 2 1).

So
n
X
4k 3
k(k 2 1)
k=1
n

1 X 8k 6
=
2 k=2 k(k 2 + 1)
n

1X 1
6
7
+
2 k=2 k 1 k k + 1






1
1 1
1 1 1
1 1 1
=
1 + + + ... + 6
+ + + ... 7
+ + + ...
2
2 3
2 3 4
3 4 5





1 1 1
1 1 1
1
1+7
+ + + ... 7
+ + + ...
=
2
2 3 4
3 4 5


1
7
=
1+
2
2
=

9
= . 2
4

2009 Version 1B
1. Let A1 = {a, b, c}, A2 = P(A1 ), A3 = P(A2 ).
i. |A3 | = 2|A2 | = 22 = 28 . 2
3

ii. A2 A3 : True. A3 = P(A2 ) and A2 P(A2 ).


A2 A3 : True. All elements of A2 are contained within A3 . 2

2. f is continuous.
It is easy to check that f (0) = 4 and f (1) = 1. By the intermediate value
theorem, there exists some c (0, 1) such that f (c) = 3. But we also have
f (1) = 3. Hence f is not one-to-one as f (c) = 3 = f (1) and c 6= 1.
f is surjective, because given any y R, we can find an x1 such that y = 2x31 +
3x1 4.
As f is not injective, it cannot be bijective. 2

3. Let k > 1. We have


RHS =

3
2
5

k1 k k+2

5k 3(k 1)
2

k(k 1)
k+2

5k(k + 2) 3(k 1)(k + 2) 2k(k 1)


k(k 1)(k + 2)

5k 2 + 10k 3(k 2 + k 2) 2k 2 + 2k
(k 1)k(k + 2)

3k 2 + 12k 3k 2 3k + 6
(k 1)k(k + 2)

9k + 6
(k 1)k(k + 2)

= RHS.
So

n
X
k=2

3k + 2
1X
9k + 6
=
(k 1)k(k + 2)
3 k=2 (k 1)k(k + 2)
n

=
=
=
=
=

3
2
1X 5

3 k=2 k 1 k k + 2
 





1
1 1 1
1 1 1
1 1
5
+ + + ... 3
+ + + ... 2
+ + ...
3
1 2 3
2 3 4
4 5





1 1
1 1
1
5+2
+ + ... 2
+ + ...
3
2 3
4 5







1
1
1
1 1
1 1
5+2
=
+2
+ + ... 2
+ + ...
3
2
3
4 5
4 5


1
2
5+1+
3
3
20
9

( by telescoping sums.) 2

2009 Version 1A
1. Let A = {n, s, w}.
i. P(A) = {, {n}, {s}, {w}, {n, s}, {s, w}, {n, w}, {n, s, w}}. 2
i. A P(A) has 3 + 8 = 11 elements. So |P(A P(A))| = 211 . 2

2. Let f : A B, g : B C.
i. Because f is an injective function, if a, b A and f (a) = f (b) then a = b.
Similarly for g. 2
ii. Let f and g be injective functions. We wish to show that for x, y A, if
(g f )(x) = (g f )(y), then x = y. So suppose that
(g f )(x) = (g f )(y).
Then g(f (x)) = g(f (y)). But g is injective, therefore f (x) = f (y). Thus,
g f is injective. 2

3.
(A B c ) (Ac B c )c = (A B c ) ((Ac )c (B c )c ) (De Morgan)
= (A B c ) (A B) (double complement)
= [(A B c ) B] A (associative)
= [B (A B c )] A (commutative)
= [(B A) U ] A (complement law)
= (B A) A ( universal set laws)
= B (A A) (associative)
= B A (idempotent)
= A B (commutative). 2

2010 Version 2B
1. Let A = {a}, B = {b, c}, C = {d, e, f, g, h, i, j}.
i. A B = {(a, b), (a, c)}. So
P(A B) = {{(a, b)}, {(a, c}, , {(a, b), (a, c)}}. 2
ii. |B C| = 14 as |B| = 2, |C| = 7. Then |P(B C)| = 214 . 2

2. Let f, g : R R with f (x) = x2 , g(x) = ex .


i. (f g) = f (g(x)) = (ex )2 = e2x .
2
(g f )(x) = g(f (x)) = ex . 2
ii. Both f g and g f are functions from R to R. Neither function is one-to-one
since
(f g)(x) = 0 and (g f )(x) = 0
do not have any solutions. 2

3. Using the formula


tan(k (k 1)) =

tan k tan(k 1)
1 + tan k tan(k 1)

= tan k tan(k 1) =

tan k tan(k 1)
=1
tan(1)

we have
n
X
k=1

tan k tan(k 1) =

n 
X
tan k tan(k 1)
k=1

tan 1


1

= n +
= n +

= n +

1 X
(tan k tan(k 1))
tan 1 k=1
1
((tan 1 tan 0) + (tan 2 tan 1) + (tan 3 tan 2)
tan 1
+ . . . + (tan n tan(n 1)))
tan n
. 2
tan 1
9

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy