A).

Scholarship and Course Selection:

 You have a scholarship covering 3 courses out of 11 related to your field.

 English is mandatory, so you need to choose the remaining 2 courses from the 10
electives.

n!
C ( n , k )=
k ! ( n−k ) !

In this context, (n) represents the total number of choices, and (k ) is the number of choices I
am making.

For the first part, choosing three courses out of 11, the calculation looks like this:

11!
C (11, 3)= =165
3 ! (11−3)!

For the second part, choosing two courses out of the remaining 10 (excluding English), the
calculation becomes:

10!
C (10 , 2)= =14
2 !(10−2)!

To find the overall number of ways to choose the three courses covered by the scholarship
and the additional two courses, we multiply the results of these two calculations:

Total way = 165 × 45=7425

Therefore, there are 7425 ways to choose the three courses covered by the scholarship and the
additional two courses, considering that English is mandatory.

B). Injective and Bijective Functions: Exploring Their Possibilities:

Imagine a scenario where we have two clubs: a Drama Club (A) with 5 members and a
Volunteer Club (B) with 8 members. We want to assign roles in a community play to
members from the Drama Club, ensuring some key points:

 Injective function (one-to-one): Each Drama Club member can only be assigned one
role. They can't play multiple characters.

 Bijective function (one-to-one and onto): Every role in the play must be filled by
exactly one Drama Club member. No character is left unplayed.

1. Injective Functions:

Let's think about how many different ways we can assign roles such that each Drama Club
member gets a unique role. For the first member, we have 8 choices (all members of the
Volunteer Club are available).

For the second member, we only have 7 choices remaining since one role is already filled.
This pattern continues, resulting in 8 * 7 * 6 * 5 * 4 = 6720 possible injective assignments.

2. Bijective Functions:

Now, consider the additional constraint of filling all roles in the play. Since the Drama Club
has fewer members than the available roles, it's impossible to create a bijective function. We
simply don't have enough actors to cover every part.

Therefore, in this scenario:

 There are 6720 possible injective functions assigning unique roles to Drama Club
members.

 There are no bijective functions possible due to the difference in set sizes.

This example demonstrates how the number of injective functions depends on the relative
sizes of the sets, while bijective functions require equal cardinality for both sets.

C). Finding the Coefficient of x^7

To determine the coefficient of x 7 in the expression x 3 ¿ the binomial theorem can be applied.
n
The theorem is expressed as ¿, where is( ) the binomial coefficient.
k

For the first term, x 3 ¿ , the expansion is obtained by substituting a=x 3 , b=x +2 ,∧n=10:

3
x ¿

Similarly, for the second term, ¿, the expansion is given by:

¿
To find the coefficient of x 7, it involves identifying terms with x 7 as a factor in both
expansions. For the first expansion, the term with x 7 is obtained when k = 6, yielding

( 10 )x 2 =210 x 64=13440 x . In the second expansion, the term with x 7 arises when k = 0,
7 6 7 7

6
7 7 0 7
resulting in ( ) x 5 =x .
0

Therefore, the combined coefficient of x 7 in the expansion of x 3 ¿ is 13440 + 1 = 13441.

D). Number of possible sports committees:

There are two scenarios to consider:

Scenario 1: No restrictions on committee members:

In this case, we need to find the number of ways to choose 7 members from a group of 30.
This can be calculated using the combination formula:

Number of combinations = nCr = n! / (r! * (n-r)!)

where:

 n = total number of members (30)

 r = number of members to be chosen (7)

Plugging in the values:

Number of combinations = 30C7 = 30! / (7! * (30-7)!) = 2035800

Therefore, there are 2,035,800 possible sports committees if there are no restrictions on who
can be in the committee.

Scenario 2: Treasurer is mandatory in the committee:

Here, we know that the treasurer is already selected and must be part of the committee. So,
we only need to choose 6 more members from the remaining 29 members.

Following the same formula:

Number of combinations = 29C6 = 29! / (6! * (29-6)!) = 475020

Therefore, there are 475,020 possible sports committees if the treasurer is mandatory in the
committee.

Explanation:

 The combination formula considers the order of selection. However, for forming a
committee, the order doesn't matter. Therefore, the calculated value represents the
number of unique committees even though the order of choosing members might be
different.

 In scenario 1, we have complete freedom to choose any 7 members from the

30, leading to a larger number of possibilities.

 In scenario 2, one spot is fixed for the treasurer, reducing the options for choosing
other members and resulting in fewer committees.

E). Exploring Bit Strings, Derangements, and Password Security.

i. Bit String:

A bit string is like a sequence of light switches, where each switch can be either on (1) or off
(0). These 1s and 0s are called bits, and the string represents a series of binary data. It's like a
code made up of just two symbols, similar to how Morse code uses dots and dashes.

ii. Example:
Consider a bit string of length 3, like "101". Here, the weight refers to the number of 1s,
which is 2 in this case.

To find the number of possible bit strings of a specific length (n), we can use the combination
formula:

Number of bit strings = nCr = n! / (r! * (n-r)!)

where:

 n = total number of bits (length of the string)

 r = number of 1s (weight)

In this example (n = 3, r = 2):

Number of bit strings = 3C2 = 3! / (2! * (3-2)!) = 3 * 2 / (2 * 1) = 3

Therefore, there are 3 possible bit strings for this example (100, 010, and 001).

iii. Derangements:

Derangements are arrangements where no element stays in its original position. Let's find the
number of derangements for the 3-digit number 257:

1. We can't place 2 in the first slot, so there are 2 choices (5 and 7) remaining.

2. For the second slot, only 1 choice remains (the digit not placed in the first slot).

3. The last slot is automatically filled by the remaining digit.

Therefore, there are 2 * 1 = 2 derangements possible (257 and 752).

iv. Cracking a 4-Digit Password:

a. No Repeating Digits:

If no digit repeats, each slot has 10 choices (0-9). The total number of possible passwords is:

Number of passwords = 10 ^ n

where:

 n = password length (4 in this case)

Therefore, there are 10 ^ 4 = 10,000 possible passwords.

b. Repeating Digits:

Even with repeating digits, the formula remains the same:

Number of passwords = 10 ^ n

This is because each slot still has 10 choices, and order matters (e.g., 1234 is different from
4321). So, there are again 10,000 possible passwords.

The key difference between permutations and combinations lies in order.

Permutations matter when the order of selection is important. Imagine choosing the
president, vice president, and secretary for a club. The order you choose them in matters
(president is different from vice president).

Combinations are used when the order doesn't matter. Choosing 3 courses from 11 doesn't
change based on the order you pick them. You end up with the same set of courses regardless
of the order.

Here's how I apply this to the scenarios you mentioned:

A. Scholarship and Course Selection:

 Choosing 3 courses out of 11 requires permutations because the order (e.g., Math,
Physics, Chemistry) matters.

 Choosing 2 additional courses from the remaining 10 involves combinations as the

order doesn't matter (e.g., Biology, History).

B. Injective and Bijective Functions:

 Assigning unique roles to Drama Club members involves permutations since the
order matters (who gets which role).

C. Finding the Coefficient of x^7:

 This scenario doesn't involve permutations or combinations as it deals with expanding

a binomial expression.
D. Number of possible sports committees:

 Both scenarios use combinations because the order of choosing committee members
doesn't matter.

E. Bit String, Derangements, and Cracking Passwords:

 Combinations are used to find the number of bit strings with a specific weight.

 Permutations are used to calculate derangements as the order of arranging elements

matters.

 Cracking passwords with or without repeating digits involves neither permutations

nor combinations. We simply use the total number of choices for each digit (10 in this
case) raised to the power of the password length.

Reference:

 Levin, O. (2021). Discrete mathematics: An open

introduction (3rd ed.). https://discrete.openmathbooks.org/dmoi3/frontmatter.html lice
nsed under CC 4.0

 Math is Fun. (n.d.). Injective, Surjective and Bijective. Math is Fun.

 Doerr, A., & Levasseur, K. (2022). Applied discrete structures (3rd ed.). licensed
under CC BY-NC-SA