Scribd
Upload
179 views

GRaded Assignment 2

The document discusses several concepts in discrete mathematics including: 1) Partial orders and equivalence relations, providing definitions and examples of each. 2) Modular arithmetic and proving that congruence modulo m is an equivalence relation. 3) The pigeonhole principle and applying it to examples involving children and days of the week, family members and months, and children and bedrooms. 4) Using the binomial coefficient formula to calculate the number of ways 4 children can divide 18 candies among themselves.

Uploaded by

Dane Sinclair
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
179 views

GRaded Assignment 2

The document discusses several concepts in discrete mathematics including: 1) Partial orders and equivalence relations, providing definitions and examples of each. 2) Modular arithmetic and proving that congruence modulo m is an equivalence relation. 3) The pigeonhole principle and applying it to examples involving children and days of the week, family members and months, and children and bedrooms. 4) Using the binomial coefficient formula to calculate the number of ways 4 children can divide 18 candies among themselves.

Uploaded by

Dane Sinclair
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Dane Sinclair 320032023 1

University of the West Indies Open Campus

Academic year 2020/2021

Semester 2

Discrete Mathematics EDME-2204

Graded Assignment 2

April 3, 2021

Prepared for

Robert Geofroy

By

Dane Sinclair
320032023
Dane Sinclair 320032023 2

A relation R on a set S is called a partial ordering, or partial order, if it is reflexive, antisymm
etric, and transitive. A set together with a partial ordering R is called a partially ordered set,
or poset, and is denoted by (S, R). Members of S are called elements of the poset.

.
Since a ≤ a holds for all integers a, the relation ≤ is reflexive.
Since a ≤ b and b ≤ a ,implies that a = b, the relation is antisymmetric.
Since a ≤ b and b ≤ c implies that a ≤ c, the relation is transitive.
The “less than or equal to” relation ≤ on the set of integers is a partial order relation

iff for all a, b ∈ Z, either a ≤ b or b ≤ a, the partial order is a poset denoted by (S,R), hence the poset
is ( Z , ≤ ) which denotes a total order because a ≤ b or b ≤ a whenever a and b are integers.
Dane Sinclair 320032023 3

We say ∼ is an equivalence relation on a set S if it satisfies the following three properties:


a) Reflexive: for all a∈S , a∼a.
b) Symmetric: for all a,b∈S, if a∼b  then b∼a .
c) Transitive: for all a,b,c∈S, if a∼b and b∼c then a∼c

If S has n elements then the cardinalities of the smallest equivalence relation on S will be n and the
largest equivalence on S will be n2

Let S = (1,2,3) then

S × S={( 1,1 ) (1,2 ) ( 1,3 ) ( 2,1 )( 2,2 ) ( 2,3 ) (3,1 )( 3,2 ) (3,3 ) }

Smallest set of equivalence relation is { ( 1,1 ) , ( 2,2 ) ,(3,3) } as this is reflexive, symmetric and
transitive, hence cardinality is n ( S )=3

The largest equivalence relation is n2 =32=9 which is


{( 1,1 ) ( 1,2 )( 1,3 )( 2,1 ) ( 2,2 )( 2,3 ) ( 3,1 )( 3,2 ) ( 3,3 ) }

which is reflexive as 1R1, 2R2 and 3R3,

Symmetric as (2, 1) ∈ R whenever (1, 2) ∈ R, for all a, b ∈ S, etc.

Transitive for all elements 1, 2, 3 in S, whenever R relates 1 to 2 and 2 to 3, then R


also relates 1 to 3 etc.
Dane Sinclair 320032023 4

Let n ∈ N and let a, b ∈ Z. We say that a is congruent to b modulo n iff n|(a−b). We write this as a ≡ b
(mod M), m ∈ N and a, b ∈ Z

Proof:

Reflexive: since R is reflexive because ∀ a ∈ Z , a ≡ a(mod m)holds


Symmetric: let a , b ∈ Z such that aRb holds
So aRb → a ≡b( mod m),
then a−b=k ×m for some positive integer k.
Thus b−a=(−k )× m is also divisible by m and so b ≡ a(mod m)
Transitive: let a , b , c ∈ Z such that aRb and bRc holds
Then a ≡ b(mod m), and b ≡ c (mod m).
→ a−b=k × mand b−c=l ×m for some integer k and l.
Then a−c=( a−b )+ ( b−c )=k × m+l= ( k +l ) m is also divisible by m.
That is a ≡ c (mod m)
Therefore a ≡ b(mod m) and b ≡ c (mod m)
→ a ≡c (mod m) so R is transitive
Therefore R is an equivalence Relation ZRZ under modulo m

We know that ¿ and that R is an equivalence on Z × Z when m=3

So it is a equivalence relation on ¿ ¿

We know that equivalence relations yields a partition on a set

So R yields a partition on ¿ ¿

So equivalence classes under R are U ( 0 ) , U (1 ) , U (2)


Dane Sinclair 320032023 5

We know that U ( 0 )=¿

U ( 0 )=¿
U ( 0 )=¿
¿ { 0,3,6,9 , … … }
U ( 1 )=¿
¿¿
¿
¿ { 1 , 4 , 7 , 10 , … … }
U ( 2 )=¿
¿¿
¿¿
¿ { 2 ,5 , 8 , 11, … … }

So Z+¿ U {0 }=U (0 )∪U (1)∪U (2)¿

There are only 3 equivalence classes w.r.t. R. i.e., {[a]R : a  Z} = {[0]R , [1]R , [2]R }
Dane Sinclair 320032023 6

Let the children be pigeons and the days of the week be pigeonholes
There are 12 children (pigeons) which we are placing into 7 days of the week (pigeonholes).
We have 5 children (pigeons) left to place, so by the PHP, some day of the week has two
children.

The family members be pigeons and the months of year be pigeon holes.
There are 14 family members (pigeons) and only 12 months they can be born in (holes), thus
there is 2 family members left to place so some two family members must be born in the
same month by the PHP.

Since the house has 4 bedrooms for children consider them as holes and the let the 12
children be pigeons. If we put 2 pigeon ( children) in 1 hole (bedroom) we have 8 children in
4 bedrooms. We will then have to place the remaining 4 children into bedrooms. Therefore
by pigeonhole principle at least three children sleep in at least one room.
Dane Sinclair 320032023 7

If each of the 4 child gets 1 then there are 18-4=14 candies remaining, since it’s possible to have
repetition the solution can be found usingC ( n+ r−1 , r−1 ) where r =4∧n=14

C ( n+ r−1 , r−1 )=¿


C (14+ 4−1,4−1)
C (17,3)
17× 16 ×15
¿
3 ×2
680 ways

You might also like