Scribd
Upload
11 views

Exercise7 Solution

Uploaded by

mandy2005127
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Exercise7 Solution

Uploaded by

mandy2005127
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ENGG2440C Discrete Math for Engineers (Exercise 7)

October 31, 2024

Name: SID:

Problem 1:
(50%) How many 8 letter strings can be constructed from the letters in [a, a, a, b, b, c, c, c, c]?

Problem 1 solutions:
8!
The number of permutations of [a, a, b, b, c, c, c, c] = 2!2!4! ,
8!
The number of permutations of [a, a, a, b, c, c, c, c] = 3!1!4! ,
8!
The number of permutations of [a, a, a, b, b, c, c, c] = 3!2!3! ,
8! 8! 8!
Thus the final answer: 2!2!4! + 3!1!4! + 3!2!3! = 420 + 280 + 560 = 1260.

1
Problem 2:
(25%) (a) Find the number of non-negative integer solutions for the equation.
x1 + x2 + x3 + x4 + x5 = 18.
(Hint: refer to lecture note Week 8, Sets and Combinatorial Counting, Page 38).

(25%) (b) Expand (3x − 2)3 using the binomial theorem.

Problem 2 solutions:
(a) Consider constructing a string of r ’1’s and n − 1 ’+’s, representing the sum of integers x1 + x2 + ... + xn .
For r = 18, n = 5, the total number of such strings is counted as counting the choices to position the ’1’s, i.e.,
5+18−1
Crn+r−1 = C18 = C422 = 7315.

(b)

3
X
3 3 3 3 3
(3x)(n−k) (−2)k = (3x)3 (−2)0 + (3x)2 (−2)1 + (3x)1 (−2)2 + (3x)0 (−2)3
    
k 0 1 2 3
k=0
= 27x3 − 54x2 + 36x − 8.

You might also like