Scribd
Upload
17 views

Assignment 1

Uploaded by

Agrim joshi
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
17 views

Assignment 1

Uploaded by

Agrim joshi
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/ 2

MACM 201 - D100 A SSIGNMENT #1

Due Date: Friday Sep 13, 2024, Quiz time


Instructions

Do all of these questions and write out the solutions neatly and succinctly as training. You do not have to hand
in your work. The quiz on Sep 13 will closely follow some of the questions on this assignment. Solutions will
be posted afterwards. Compare these with your own work to check if you did the questions correctly and use
them to improve your own exposition. Make use of the workshop to get clarification.

Textbook Reading

• Sections: 1.1, 1.2, 1.3

Definitions, Concepts & Keywords

• Know the difference between strings, sets, subsets and permutations.


• Understand the basic terminology on graphs and trees.
• Know how to count permutations, combinations, and use the Binomial Theorem.

Exercises

A. Textbook Questions
Section 1.2 Exercises 5, 20.
Section 1.3 Exercises 6, 30.
B. Questions
1. We consider threads with Amber, Cyan, Green and Teal beads strung on them. We can designate
such threads with strings over an alphabet {A, C, G, T }.
How many distinct threads of length n are there? (Note that the threads have two ends but it
is not clear which is the start and which is the end, so two strings designate the same thread if
they match or if one is the reverse of the other)
2. List all binary strings of length 5 with three 1 bits.
You should get 53 of them.


3. Draw a graph G with 6 vertices where each vertex has degree 2.


Draw a different graph H with 6 vertices where each vertex has degree 2. Can you make sure it
is different as an unlabelled graph?
4. Recall in class we drew all unlabelled trees with 5 vertices. Use this to find the number of
labelled trees on 5 vertices.
5. Let G be a graph with vertex set V = {1, 2, 3, 4, 5, 6}. Suppose G has no edges between odd
numbered vertices and also no edges between even numbered vertices.
(a) Draw such a graph with the maximum number of edges.
(b) How many such graphs are there?
6. (a) How many combinations of size 3 can one produce from a, b, c, d, e, f ?
(b) How many permutations of size 3 can one produce from a, b, c, d, e, f ?
7. How many cycles of length 4 (i.e. 4 edges) are in the complete graph K6 ?
Note: the cycle 1-2-3-4-1 is the same cycle as 2-3-4-1-2 and also the same as 1-4-3-2-1.
8. Let A = {a, b, c, d} and B = {1, 2, 3}. Lef f (x) be a function from A to B.
One such function is shown in the table below.
x a b c d
f (x) 1 3 1 2
(a) Find the number of functions from A to B.
(b) Find the number of onto functions from A to B.

1
C OPYRIGHT B RUIN
MACM 201 - D100 A SSIGNMENT #1
9. Six people are sitting at a circular table.
How many (circular) permutations of them are there? Note, the circular permutations 123456
and 234561 are considered the same.
10. Let n be a positive integer. A sequence of positive integers a0 , . . . , an is log-concave if a2k ≥
ak−1 ak+1 for all 1 ≤ k ≤ n − 1. Define ak = nk for 0 ≤ k ≤ n.
(a) Show for n = 6 that a0 , . . . , a6 is log-concave.
(b) Show for general n that a0 , . . . , an is log-concave.
(Note: log-concave sequences are a subject of modern research in combinatorics.)
11. We show that n2 n−2 = 6 n4 by counting the same thing in two different ways. Here is what
  
2
we are going to count. We have n distinguishable balls and two bags labelled 1 and 2. We want
to count the number of ways of selecting two balls and putting them in bag 1, and then selecting
two balls from the remaining balls and putting them in bag 2.
Explain how to do the count in two different ways to prove the formula.
12. A box has 10 red balls, 10 green balls, 10 blue balls and 10 yellow balls, and for each colour the
balls are labelled 1, 2, . . . , 10. Suppose five balls are chosen from the box.
(a) How many ways can you choose 5 balls (with no further constraints)?
(b) How many ways can you choose 5 balls so that exactly 4 of them are the same colour?
(c) How many ways can there be three of one colour and two of another colour.

2
C OPYRIGHT B RUIN

You might also like