Working with Sets, Relations, and Functions

1. The universal set contains all the positive integers less than 30. The set A contains all prime numbers less
than 30 and the set B contains all positive integers of the form 3 + 5n (n

) that are less than 30.

Determine the elements of
(a) A \ B;
(4)
(b) AB.
(3)
(Total 7 marks)
. The relation R is defined for a! b

+
such that aRb if and onl" if a
#
$ b
#
is divisible b" 5.
(a) %ho& that R is an e'uivalence relation.
(!)
(b) (dentif" the three e'uivalence classes.
(4)
(Total 1" marks)
3. The function f )
+
*
+
+
+
*
+
is defined b" f(x! y) ,

,
_

y
x
xy !
#
.
%ho& that f is a bi-ection.
(Total 11 marks)
4. (a) .rove that the number /0 10/ is the fourth po&er of an integer in an" base greater than 1.
(3)
(b) 2or a! b

the relation aRb is defined if and onl" if

k
b
a
k
! #
.
(i) .rove that R is an e'uivalence relation.
(ii) 3ist the e'uivalence classes of R on the set 4/! #! 3! 0! 5! 1! 5! 6! 7! /08.
(#)
(Total 11 marks)

$. The function f ) + is defined b"
f(x) , # e
x
$ e
$x
.
(a) %ho& that f is a bi-ection.
(4)
(b) 2ind an e9pression for f
$/
(x).
(!)
(Total 1" marks)
IB Questionbank Mathematics Higher Level 3rd edition 1
!. 3et R be a relation on the set such that aRb

ab : 0! for a! b

.
(a) Determine &hether R is
(i) refle9ive;
(ii) s"mmetric;
(iii) transitive.
(7)
(b) ;rite do&n &ith a reason &hether or not R is an e'uivalence relation.
(1)
(Total # marks)
7. (a) 3et f ) * + ! f(m! x) , ($/)
m
x. Determine &hether f is
(i) sur-ective;
(ii) in-ective.
(4)
(b) P is the set of all pol"nomials such that P ,

'

n x a
n
i
i
i
0

;

.
3et g ) P + P! g(p) , xp. Determine &hether g is
(i) sur-ective;
(ii) in-ective.
(4)
(c) 3et h ) +
+
! h(x) ,

'

>
0 ! # /
0 ! #
x x
x x
. Determine &hether h is
(i) sur-ective;
(ii) in-ective.
(7)
(d) ;rite do&n &hich! if an"! of the above functions are bi-ective.
(1)
(Total 1! marks)
#. .rove that for sets A and B
A * (B

C) , (A * B)

(A * C).
(Total # marks)
%. The binar" operation < is defined on as follo&s. 2or an" elements a! b

.
a < b , a + b + /.
(a) (i) %ho& that < is commutative.
(ii) 2ind the identit" element.
IB Questionbank Mathematics Higher Level 3rd edition 2
(iii) 2ind the inverse of the element a.
($)
(b) The binar" operation = is defined on as follo&s. 2or an" elements a! b

a = b , 3ab. The set S is the set of all ordered pairs (x! y) of real numbers and the binar" operation
is defined on the set S as
(x
/
! y
/
) (x
#
! y
#
) , (x
/
< x
#
! y
/
= y
#
)
Determine &hether or not is associative.
(!)
(Total 11 marks)

1". The relation R is defined on * such that (a! b) R (c! d) if and onl" if a $ c is divisible b"
3 and b $ d is divisible b" #.
(a) .rove that R is an e'uivalence relation.
(7)
(b) 2ind the e'uivalence class for (#! /).
()
(c) ;rite do&n the five remaining e'uivalence classes.
($)
(Total 14 marks)
IB Questionbank Mathematics Higher Level 3rd edition 3