Math Assignment Unit 3

1. Imagine you received a scholarship that would cover only 3 courses out of the 11 courses related to
your field of study at your university. How many ways will you have to choose the three courses and
how many ways can you choose for the remaining two courses if one course- English (out of the 11
courses) is mandatory to take? Explain how you arrived at the answer.
So , to calculate the number of ways to choose three courses out of the 11 courses covered by the
scholarship, we used the combination formula ( ), where n is the total number of courses and 𝑘k is the
n
k
number of courses to choose. The formula for combinations is: (Doerr & Levasseur, 2021)

In this case, 𝑛=11 (total number of courses) and 𝑘=3 (number of courses to choose).

So, plugging these values into the formula: Then, we simplified the

factorial expressions: This gave us the number of ways to choose three

courses out of the 11 available courses covered by the scholarship, which is 165. For the second part, we
need to choose the remaining two courses after accounting for the mandatory English course. Since English

time with 𝑛=10 and 𝑘=2: (Doerr & Levasseur, 2021)

is mandatory, we have 10 remaining courses to choose from. We again use the combination formula, but this

This gave us the number of ways to choose two courses out of the
10 available courses after accounting for the mandatory English course, which is 45.

2. Consider two sets A and B having cardinality of your choice. Explain how many injective and
bijective functions are possible from set A to set B. Please avoid the examples given in textbooks or
online resources and come up with your own unique example. (Doerr & Levasseur, 2021)
Set A = {chair, table, lamp}
Set B = {wooden, metal, plastic, glass} Now I have my sets, let's analyze the possibilities:
Injective Functions (One-to-One Functions):
When every element in set A maps to a distinct element in set B, the function is said to be injective. An
injective function is conceivable since set A consists of three items and set B consists of four, provided that
each element of set A is mapped to a distinct element of set B.As an illustration, an injective function may
be:
 chair maps to wooden
 table maps to metal
 lamp maps to plastic (Doerr & Levasseur, 2021)
In this case, each element of set A is mapped to a unique element in set B, so it's an injective
function.However, if we try to map all three elements of set A to set B without repeating any element in B,
we'll notice that it's not possible because set B has only 4 elements while set A has 3. So, not all injective
functions are possible in this case.
Bijective Functions:
a. Every element in set B is covered and every element in set A is mapped to by precisely one element
in set A, making a bijective function both injective (one-to-one) and surjective (onto).A bijective
function from set A to set B cannot be achieved since set A has fewer members than set B. This is
due to the fact that for anything to be bijective, its elements need to correspond exactly to one
another. The surjective condition will be broken since at least one element in B will not have a
corresponding element in A because there are more items in B than in A. Therefore, there isn't a
bijective function from set A to set B in this situation. (Doerr & Levasseur, 2021)

3. Find the coefficient of in the expansion of

The way we can find the coefficient of x 7 in the given expression, we need to expand both terms and then
identify the term containing x 7.

So, by expanding the term it will be x 3 ¿ now by using the binomial theorem, we get:

10 9 8 3
x + 20 x +180 x c + …+1024 now we have to multiply by x

We are done on the first part now the second part (x +5)7 Expanding using the binomial theorem, we get:

= to
7 6 5
x +35 x +525 x +…+78125 I don’t know is this is correct, but we need to add the two expressions together

b. To find the coefficient of x 7, we need to identify the term containing x 7, which is only present in
7
(x +5) . So, the coefficient of x 7 is 1. (Doerr & Levasseur, 2021)

4. A newly constructed apartment has 30 club members. The club has planned to create a sports
committee consisting of 7 club members. How many different sports committees are possible? How
many committees are possible if it is mandatory to have the selected treasurer of the club members in
the sports committee? Explain in detail.
Creating the Sports Committee without Any Specific Requirement:
c. If there are 30 club members and the sports committee consists of 7 members, we can use the
combination formula to find out how many different sports committees are possible. (Doerr &
Levasseur, 2021)
 n
d. The formula for combinations is ( ), where n is the total number of items and k is the number of
items to choose. Actually, In this case, 𝑛=30 (total number of club members) and 𝑘=7 (number of
k

30 30 ! 30∗29∗28∗27∗26∗25
members in the sports committee). is ( ) = is = Calculating
7 7 ! ( 30−7 ) ! 7∗6∗5∗4∗3∗2∗1
this gives us the number of different sports committees possible when it's mandatory to include the
6894720
treasurer. So, in short here is the answer , when we multiply as given, we get and we
720
divide 720 into 6894720 we get 9585 which means there are 9585 different sports committees
possible when it's mandatory to include the treasurer. (Doerr & Levasseur, 2021)
 The number of different sports committees possible without any specific requirement is the result of
30
( )
7

 The number of different sports committees possible when it's mandatory to include the treasurer is
29
the result of ( )
6

5. i. Bit string: A bit string is just a sequence of 0s and 1s. It's like a string of switches, where each switch
can be either off (0) or on (1).
e. ii. Example and Combinations: Let's say we have a 4-digit bit string. For instance, "1001". We
want to find how many different bit strings we can make with 2 ones and 2 zeros. We use
combinations because we're picking positions for the ones from the available spots. The number of
ways to choose 2 positions out of 4 is 6. So, there are 6 different bit strings possible with 2 ones and
2 zeros. ((Doerr & Levasseur, 2021)
f. iii. Derangements of a 3-Digit Number: Take the number 123. A derangement is just a
rearrangement where no number is in its original position. For instance, 231 and 312 are
derangements of 123. In a 3-digit number, there are 2 derangements possible (Doerr & Levasseur,
2021)
iv. Creating a 4-Digit Password:
g. No Digit Repeats: If we're making a 4-digit password without repeating any digit, we use
permutations because order matters. For the first position, we have 10 choices (any digit from 0 to 9),
then 9 choices for the second position (since one digit is already used), and so on. So, there are
10×9×8×7 ways to create such a password (Doerr & Levasseur, 2021)

h. Digits Can Be Repeated: If digits can repeat, we use combinations because the order doesn't matter,
just which digits we choose. Each position can be any digit from 0 to 9, so there are 104 ways to
create such a password, because we have 10 choices for each of the 4 positions (Doerr & Levasseur,
2021).
Reference:
Doerr, A., & Levasseur, K. (2022). Applied discrete structures (3rd ed.). licensed under CC BY-NC-SA

Some formulas where too long to copy from the PowerPoint because it’s easier than word, so that’s why I
made those screenshots