Scribd
Upload
2 views

Quiz-3 (3)

The document outlines the instructions and content for Quiz 3 of the BSC136 course, including submission guidelines and specific questions related to combinatorics, relations, equivalence relations, partial orders, and graph theory. Students are required to provide handwritten answers, demonstrating their understanding of mathematical concepts such as binomial coefficients, reflexivity, symmetry, transitivity, and properties of graphs. The quiz consists of multiple sections, each with varying marks assigned to different problems.

Uploaded by

2.serikov.nurda
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
2 views

Quiz-3 (3)

The document outlines the instructions and content for Quiz 3 of the BSC136 course, including submission guidelines and specific questions related to combinatorics, relations, equivalence relations, partial orders, and graph theory. Students are required to provide handwritten answers, demonstrating their understanding of mathematical concepts such as binomial coefficients, reflexivity, symmetry, transitivity, and properties of graphs. The quiz consists of multiple sections, each with varying marks assigned to different problems.

Uploaded by

2.serikov.nurda
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/ 3

2024-04 BSC136 Quiz 3

Please provide your name and student number.

Submit a single scanned pdf file of your handwritten work to Moodle. If you take images
of your work, convert it into a single pdf using the print-to-pdf function.

NOTE: Any typed work will result in zero mark!! NO EXCUSE.

 
n
(1) Combinatorics on binomial coefficients: remember that is the number of subsets we can
k
form by choosing k elements from {1, 2, . . . , n}.
(8 marks total) Prove that the alternating sum of binomial coefficients is 0:
n          
k n n n n n n
X
(−1) = − + − · · · + (−1) =0
k 0 1 2 n
k=0

using two different kinds of countings (a) and (b) below.


   
n n
(a) (1 mark) Use symmetry = if n is odd, and (4 marks) when n being even,
k n−k
use the following counting method: separating subsets of {1, 2, . . . , n} according to whether
the cardinality is even or odd, and whether it contains a fixed element (say 1) or not. For
example, when n = 4, to show that 1−4+6−4+1 = 0, we separate even subsets of {1, 2, 3, 4}
from odd subsets, and highlight those containing 1 with red:

even: Ø, {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}, {1, 2, 3, 4};
odd: {1}, {2}, {3}, {4}, {1, 2, 3}, {1, 2, 4}, {1, 3, 4}, {2, 3, 4}.

What pattern can you observe? Try to generalize this pattern to arbitrary even n.
(b) (3 marks) Use inclusion-exclusion principle on n sets

|A1 ∪ A2 ∪ · · · ∪ An | =|A1 | + |A2 | + · · · + |An |


− (|A1 ∩ A2 | + |A1 ∩ A3 | + · · · + |An−1 ∩ An |)
+ (|A1 ∩ A2 ∩ A3 | + |A1 ∩ A2 ∩ A4 | + · · · + |An−2 ∩ An−1 ∩ An |)
− (|A1 ∩ A2 ∩ A3 ∩ A4 | + · · · + |An−3 ∩ An−2 ∩ An−1 ∩ An |)
+ ···
+ (−1)n−1 |A1 ∩ A2 ∩ · · · ∩ An |

and just take the same set A1 = A2 = · · · = An , which are all singleton.

(2) (6 marks total) Determine whether each of the following relations is reflexive, symmetric, and
transitive respectively. If the relation satisfies all these properties, express (in the simplest form
as possible) the equivalence classes by choosing class representatives.

(a) (3 marks) A = {(a, b) ∈ Z × Z, both a and b are non-zero}, and

R = {((a, b), (c, d)) ∈ A × A : ad = bc}.

(b) (3 marks) A is the set of all cities in the world, and R consists of (a, b) ∈ A × A where there
is a direct flight from a to b.

(3) (9 marks total) Imagine a bracelet having four beads of different colors A,B,C,D. Let S be the
set
S = {permutations of A,B,C,D around the bracelet.}
Define a relation R on S such that

(a, b) ∈ R ⇔ b can be obtained from a by a sequence of rotations and reflections.


1
For example:
    reflexion along    
A B rotation by 90◦ B D the diagonal B A rotation by 90◦ A C
a= −−−−−−−−−−→ −−−−−−−−−−→ −−−−−−−−−−→ =b
C D A C D C B D

and
  reflexion along    
A B the diagonal A C rotation by 180◦ D B
a= −−−−−−−−−−→ −−−−−−−−−−→ =b
C D B D C A
are two allowable sequences. Notice that doing nothing on a bracelet (no rotation or reflection
whatsoever) is also regarded as an allowable sequence, known as the identity sequence.
(5 marks) Show that R is an equivalence relation.
(4 marks) List all equivalence classes in S with respect to R.
(Hint: there are 3 of them, all of them having the same cardinality.)
(4) (13 marks total) Answer the following questions for the poset (S, R), where

S = {2, 4, 6, 9, 12, 18, 27, 36, 48, 60, 72} and R = | (divides).

(3 marks) First show that R is a partial order, i.e., show that it is reflexive, anti-symmetric, and
transitive.
(10 marks, 1 mark each) Answer the following questions. For (a)-(h), it is fine to just give answers.
For (i), provide a simple reason.

(a) Find the maximal elements.


(b) Find the minimal elements.
(c) Is there a greatest element? If so, what is it?
(d) Is there a least element? If so, what is it?
(e) Find all upper bounds of {2, 9}.
(f) Find the least upper bound of {2, 9}, if it exists.
(g) Find all lower bounds of {60, 72}.
(h) Find the greatest lower bound of {60, 72}, if it exists.
(i) Is (S, R) a lattice? Why?

(5) Let G be the following graph.

(10 marks total) Answer the following questions. For (a)-(b), it is fine to just give answers. For
(c)-(g), provide also simple reasons.

(a) (1 mark) How many vertices does G have?


(b) (1 mark) How many edges does G have?
(c) (2 marks) Is G bipartite?
(d) (2 marks) Does G admit an Euler circuit?
2
(e) (1 mark) Does G admit an Euler path but not an Euler circuit?
(f) (1 mark) Does G admit an Hamiltonian path or Hamiltonian circuit?
(g) (2 marks) Is G planar ?

(6) (4 marks) Suppose that a connected planar graph has 10 vertices, each of degree 5. Into how
many regions is the plane divided by a planar representation of this graph?

You might also like