PROJECT

MATHAMATICS
BS-IR SECTION-C
MUHAMMAD AHSAN WASEEM
1-BINOMIAL THEOREM FOR RATIONAL
INDEX
Binomial theorem is basically used to explore
the probability in organized manner
EXAMPLE NO # 1
A friend says that she will flip a coin 5 times. Each time the coin
comes up heads, she will give you $10, but each time the coin
comes up tails, she gives nothing. What is the probability that you
will win $30 playing this game?
ANSWER: The binomial theorem inspires something called the binomial
distribution, by which we can quickly calculate how likely we are to win $30 (or
equivalently, the likelihood the coin comes up heads 3 times). The binomial
theorem tells us that {5 / 3} = 10 of the 2^5 =32 possible outcomes of this game
have us win $30. Therefore, the probability we seek is

{5 / 3}/{2^5} = {10}/{32} = 0.3125

2:PERMUTATION
Permutations are the different ways in which a collection
of items can be arranged.
GENERAL FORMULA:

EXAMPLE:

QUESTION; What is the permutation of 4?

If you meant to say "permutations", then you are probably asking
the question "how many different ways can I arrange the order of
four numbers?" The answer to this question (which you got right)
is 24.
This is the simplest example of permutation.

3:COMBINATION
Generally combination means a result of two products combined .But in
mathematics a combination is a mathematical technique that
determines the number of possible arrangements in a
collection of items where the order of the selection does not
matter.

GENERAL FORMULA:

EXAMPLE: Take a example, given three fruits; say an apple, an

orange, and a pear, three combinations of two can be drawn from this set:
an apple and a pear; an apple and an orange; or a pear and an orange.

More formally, a k-combination of a set is a subset of k distinct elements

of S. If the set has n elements, the number of k-combinations is equal to the
binomial coefficient.
n
Ck = [(n)(n-1)(n-2)….(n-k+1)]/[(k-1)(k-2)…….(1)]
which can be written as;
n
Ck = n!/k!(n-k)!,  when n>k
n
Ck = 0 ,  when n<k

3. Relation between Permutation and

Combination
The combination is a type of permutation where the order of the
selection is not considered. Hence, the count of permutation is
always more than the number of the combination. This is the
basic difference between permutation and combination. 
EXAMPLE :
Example 1: A group of 3 lawn tennis players S, T, U. A team
consisting of 2 players is to be formed. In how many ways can
we do so?
Solution- In a combination problem, we know that the order of
arrangement or selection does not matter.
Thus ST= TS, TU = UT, and SU=US.
Thus we have 3 ways of team selection.
By combination formula we have-
3
C2 = 3!/2! (3-2)!
= (3.2.1)/(2.1.1) =3