1.

 First, let's clarify the given information:

 There are 11 courses in total.

 You must choose 3 courses to be covered by the scholarship.

 English is mandatory, so it must be one of the 3 courses chosen.

 For the scholarship courses:

 You need to choose 3 courses out of 11, without any constraints.

 This is a combination problem, denoted as C(11,3).

 Calculate C(11,3): C(11,3) = 11! / (3! * 8!) = (11 * 10 * 9) / (3 * 2 * 1) = 165

 For the scholarship courses with English as mandatory:

 Since English is mandatory, you've already used one of your three choices.

 You need to choose 2 more courses out of the remaining 10 courses.

 This is a combination problem, denoted as C(10,2) or (10 choose 2).

 The formula for this combination is: C(10,2) = 10! / (2! * 8!) = (10 * 9) / 2 = 45

2.

Let's define our sets: Set A: {circle, square, triangle, pentagon} Set B: {red, blue, green, yellow,

purple}

Cardinality of A = 4 Cardinality of B = 5

Now, let's analyze the possible functions:

a. Injective Functions:
 An injective function (also called one-to-one) maps each element of the domain

to a unique element in the codomain. No two elements in the domain can map to

the same element in the codomain.

Number of injective functions = 5P4 = 5 * 4 * 3 * 2 = 120

Explanation:

 For the first element of A, we have 5 choices in B.

 For the second element of A, we have 4 remaining choices in B.

 For the third element of A, we have 3 remaining choices in B.

 For the fourth (last) element of A, we have 2 remaining choices in B.

This is a permutation because the order matters (each mapping creates a different

function).

Example of an injective function: circle → red square → blue triangle → green

pentagon → yellow (purple is not mapped to)

b. Bijective Functions:

A bijective function is both injective (one-to-one) and surjective (onto). It

requires that every element in the codomain is mapped to by exactly one element

in the domain. For a function to be bijective, the cardinality of the domain and

codomain must be equal.

In our case, since |A| ≠ |B|, there are 0 bijective functions possible.

However, if we were to modify set B to have the same cardinality as A, let's say:

Set B': {red, blue, green, yellow}

Now, |A| = |B'| = 4

 Number of bijective functions = 4! = 4 * 3 * 2 * 1 = 24

Explanation:

 For the first element of A, we have 4 choices in B'.

 For the second element of A, we have 3 remaining choices in B'.

 For the third element of A, we have 2 remaining choices in B'.

 For the fourth (last) element of A, we have only 1 remaining choice in B'.

Example of a bijective function (with B'): circle → blue, square → red, triangle

→ yellow, and pentagon → green

3.

a. First, let's consider x3 (x+2)10:

We need to find the term with x4 in (x+2)10, because when multiplied by x3, it will

give us x7. We can use the binomial theorem:

( x +2 )10=C ( 10 , 0 ) x 10+C ( 10 ,1 ) x 9 .21 +C ( 10 , 2 ) x8 . 22+ C ( 10 , 3 ) x 7 . 23+C ( 10 , 4 ) x 6 .2 4+ ...

4 6 10 !
We need the term with x4, which is C ( 10 , 6 ) x ∗2 =C ( 10 , 6 )= =210
6! 4 !

So, the term is 210 x 4∗64(ie the 26)=13440 x 4

When multiplied by x3, this gives 13440x7

b. Now, let's consider (x+5)7:

Again, using the binomial theorem:

( x +5 )7=C ( 7 , 0 ) x 7 +C (7 ,1 ) x 6 51 +C (7 ,2 ) x 5 52 +.. . We're interested in the x7

term, which is simply C(7,0)x7 = x7

  Now, we add the coefficients of x7 from both parts: 13440x7 + x7 = 13441x7

Therefore, the coefficient of x7 in the expansion of x3 (x+2)10 + (x+5)7 is 13441.

4.

a. Part 1: How many different sports committees are possible?

In this case, we're selecting 7 members out of 30 to form the committee. The

order of selection doesn't matter (i.e., selecting members A, B, and C is the same

committee as selecting B, C, and A). This is a combination problem.

We use the combination formula: C(n, r) = n! / (r! * (n-r)!) Where n is the total

number of items to choose from, and r is the number of items being chosen.

C(30,7) = 30! / (7! * 23!) = 2,035,800

Therefore, there are 2,035,800 different possible sports committees.

b. Part 2: How many committees are possible if it is mandatory to have the selected

treasurer in the sports committee?

In this scenario, we know one position is already filled (by the treasurer), so we

only need to select 6 more members from the remaining 29.

C(29,6) = 29! / (6! * 23!) = 475,020

Therefore, there are 475,020 possible committees when the treasurer must be

included.

Explanation:

1. In the first part, we're using the combination formula because the order of selection

doesn't matter, and we're choosing a subset (7 members) from a larger set (30 members)

without replacement.
 2. In the second part, we're using the same principle, but with different numbers. Since the

treasurer must be included, they automatically take one of the seven spots. This leaves us

with only 6 spots to fill, and only 29 other members to choose from.

5.

i) Explain Bit String:

A bit string is a sequence of binary digits (0s and 1s). The length of the bit string refers to how

many digits are in the sequence, and the weight refers to the number of 1s in the string.

i) Example of Bit String:

Let’s say we have a bit string of length 5 with a weight of 3 (meaning there are 3 ones).

One example is: 11010.

The number of different bit strings of length 5 with a weight of 3 can be calculated using

combinations because the order in which we place the 1s matters.

The number of possible bit strings is:

We need to choose 3 positions out of 5 to place the 1s.

This is represented as C(5,3).

C(5,3) = 5! / (3! * 2!) = 10

Therefore, there are 10 possible bit strings of length 5 with a weight of 3.

Combinations are used here because the order doesn't matter (e.g., 10100000 and 00001010 are

considered the same in terms of weight and length), and we're selecting positions for 1s from the

total available positions.

iii. Derangements of a 3-digit number:

Let's take the number 123 as our example.

A derangement is a permutation where no element appears in its original position. For 123, valid

derangements would be 231 and 312.

The number of derangements can be calculated using the formula:

n
1 1 1 (−1 )
D(n)=n !∗(1− + − + ...+ )
1! 2! 3! n!

For n = 3:

()
3
1 1 1 1 1 1
D(3)=3 !∗(1− + − )=6∗(1−1+ − )=6∗ =2
1! 2! 3 ! 2 6 3

This confirms our manual count of 2 derangements (231 and 312).

iv. 4-digit password for Android phone:

a. No digit repeats: This is a permutation problem.

We're arranging 4 digits out of 10 (0-9), where order matters and repetition is not

allowed.

P(10,4) = 10 * 9 * 8 * 7 = 5040 ways

b. Digits can be repeated: This is also a permutation, but with repetition allowed.

For each of the 4 positions, we have 10 choices: 104 = 10000 ways

Justification for using permutations:

In both cases, we use permutations because the order of the digits matters (1234 is

different from 4321 in a password). The difference lies in whether repetition is allowed.

For (a), we use permutations without repetition because each digit can only be used once.
 For (b), we use permutations with repetition because digits can be reused.

We do not use combinations in these password scenarios because the order of the digits is

significant, which is a key characteristic of permutations.