COMPULSORY ASSIGNMENT FOR EXAMINATION ADMISSION

ASSIGNMENT 01
Total Marks: 142
Unique no.: 839378

ONLY FOR YEAR MODULE

Only certain questions will be marked.

DO NOT USE A CALCULATOR TO OBTAIN YOUR ANSWERS-WHERE APPLICABLE, LEAVE

YOUR ANSWERS IN TERMS OF FACTORIALS, n Cr AND n Pr .

Question 1: 10 Marks

Suppose  
    0 1
1 0 1 0 0 0
A= ,B = and C = 1 1 .
0 1 0 1 1 1
0 0
Compute the following:

(1.1) A + B, (2)

(1.2) BC, (2)

(1.3) A ∨ B, (2)

(1.4) A ∧ B, (2)

(1.5) B  C. (2)

Question 2: 10 Marks

Use Mathematical induction to show that:

n2 (n+1)2
(2.1) 1 + 8 + 27 + · · · + n3 = 4
for all n ∈ N; n ≥ 1. (5)

(2.2) 8n − 3n is divisible by 5 for all n ∈ N; n ≥ 1. (5)

2
 /

Question 3: 22 Marks

A group of 44 people consists of 22 men and 22 women. How many ways are there to

(3.1) Arrange all the people in a row? (2)

(3.2) Arrange all the people in a row so that the men are all together? (3)

(3.3) Divide all the people into two groups (group 1 and group 2) so that all the men are in (3)
group 1 and all the women are in group 2?

(3.4) Pair the men and the women off? (3)

(3.5) Choose any 8 people from the group? (2)

(3.6) Choose 6 men and 5 women? (3)

(3.7) Divide the group into two groups (group 1 and group 2) of equal size? (3)

(3.8) Divide the group into two groups of equal size where each group has as many men as (3)
women?

Question 4: 18 Marks

A committee has 25 members, 15 of whom are women and 10 men.

(4.1) How many ways can a subcommittee of 8 be chosen to work on a project if

(a) Anyone of the committee be chosen? (2)
(b) At most 2 women can be chosen? (4)
(c) At least 2 women must be chosen? (4)

(4.2) Suppose two team members insist on either working together or not on all projects. (4)
How many subcommittees of 8 can be chosen to work on a project?

(4.3) Suppose that there are two team members that refuse to work together. How many (4)
subcommittees of 8 can be chosen to work on a project?

3
Question 5: 8 Marks

(5.1) How many different strings of length 9 are there of the letters a, b, c, d, and e? (2)

(5.2) How many of these have no bs? (3)

(5.3) How many of the strings contain exactly 4 cs? (3)

Question 6: 6 Marks

(6.1) How many ways can you choose 15 sweets from 7 different types of sweets? (2)

(6.2) How many ways can you choose 15 sweets from 7 different types of sweets if there (4)
are only one of type 1 and one of type 2?

Question 7: 8 Marks

(7.1) How many numbers can you form by arranging the digits in 1112233456? (2)

(7.2) How many of these numbers do not have two 2s adjacent? (3)

(7.3) How many of these numbers have the three 1s adjacent and the two 2s adjacent? (3)

Question 8: 5 Marks

A store has an introductory sale on 12 types of candy bars. A customer may choose one bar of
any five different types and will be charged no more than R1,75. Use the extended pigeonhole
principle to show that although different choices may cost different amounts, there must be at least
two different ways to choose so that the cost will be the same for both choices. State clearly what
the pigeons and the pigeonholes are.

4
 /

Question 9: 25 Marks

Let A = {2, 3, 4, 5, 6} and define the relation R on A by aRb if and only if

a and b are relatively prime.
In other words, their greatest common divisor is 1, e.g. 2R5; since 2 and 5 have no factors in
common besides 1.

(9.1) Use the definition of R above, and not the matrix MR , to decide, with reasons, if (A, R)
is the following:
(a) Reflexive; (2)
(b) Irreflexive; (2)
(c) Symmetric; (2)
(d) Asymmetric; (2)
(e) Antisymmetric; (2)
(f) Transitive. (2)

(9.2) Draw the directed graph of (A, R). (3)

(9.3) Give the domain and range of R. (2)

(9.4) Give three paths of length 2 from 6. (3)

(9.5) Give the in and out degrees of 3. (2)

(9.6) Write down MR . (3)

Question 10: 12 Marks

Suppose the relation R is represented by the following matrix:

 
0 1 1 1 1 0 1
0 0 0 0 1 1 1
 
0 1 0 0 0 0 1
 
MR = 0 1 1 0 1 1 1.

0 0 0 0 0 1 1
 
0 0 1 0 0 0 0
1 0 0 0 0 1 0
Determine, with reasons, if R is:

(10.1) Reflexive; (2)

5
(10.2) Irreflexive; (2)

(10.3) Symmetric; (2)

(10.4) Asymmetric; (2)

(10.5) Antisymmetric; (2)

(10.6) Transitive. (2)

Question 11: 12 Marks

Let A = {1, 2, 3, 4, 5} and

R = {(1, 1), (1, 3), (3, 3), (3, 5), (5, 5)}.
Determine each of the following:

(11.1) The reflexive closure of R. (3)

(11.2) The symmetric closure of R. (3)

(11.3) The transitive closure of R, using Warshall’s algorithm. (6)

Question 12: 6 Marks

Consider an onto function f : N → N. Define aRb if and only if f (a) = f (b), i.e. a and b have the
same image under f .

(12.1) Show that R is an equivalence class. (3)

(12.2) Give the equivalence classes of R. (3)

c
Unisa 2023