IMPORTANT QUESTIONS & ANSWERS ( ) ∴ R is Reflexive relation.

ii) Symmetric: 6.Let * + and *( )( ) ( )+ Write

CLASS - 11 (REDUCED 2021-2022) Let ( ) , down the minimum number of ordered pairs to be included
( ) a multiple of 7. to to make it (i) reflexive (ii) symmetric (iii) transitive
MATHEMATICS ( ) ∴ R is symmetric (iv) equivalence relation.
iii) Transitive: i) Reflexive:
1.SETS, RELATIONS AND FUNCTIONS Let( ) ( ) ( )( ) we have to include ( ) is reflexive.
1.Two sets have and elements. If the total number of ii) Symmetric:
subsets of the first set is more than that of the second ( ) ( ) we have to include ( ) is symmetric.
set, find the values of and . a multiple of 7. iii) Transitive: Nothing to include.
Let ( ) ( ) ( ) ( ) ∴ R is transitive iv) Equivalece relation:
, ( )- , ( )- ∴ R is an equivalence relation. we have to include ( ) ( ) is an equivalence
( ) ( )
4. Let * + and relation
*( )( )( )( )( )+ Write the minimum 7. Discuss the following relation for reflexivity,
( ) set of ordered pairs to be included to and minimum symmetricity and ttransitivity. On the set of natural
( ) numder of ordered pairs to be deleted from so as to make numbers the relation difined by if
( ) it (i) reflexive (ii) symmetric (iii) transitive (iv) equivalence The relation difined by if for all
( ) relation. is an empty set. *+
i) Reflexive: i) Reflexive: is not reflexive.
( )( ) we have to include ( ) is reflexive. ii) Symmetric: is symmetric.
2. In the set of integers, define if is a ii) Symmetric: iii) Transitive: is transitive.
multiple of Prove that is an equivalence relation. ( ) we have to include ( ) is symmetric Note:(Empty relation can be considered as symmetric and
i) Reflexive: we remove ( ) from is symmetric transitive).
a multiple of 12 iii) Transitive: 8. On the set of natural numbers, let be the relation
( ) ∴ R is Reflexive ( )( ) we have to include ( ) & defined by a if Write down the relation by
ii) Symmetric: ( )( ) we have to include ( ) is transitive. listing all the pairs. Check whether it is (i) reflexive (ii)
Let ( ) , we remove ( ); from is transitive symmetric (iii) transitive (iv) equivalence relation.
( ) a multiple of 12. iv) Equivalece relation: for all
( ) ∴ R is symmetric we have to include ( ) ( ) ( ) ( ) is an *( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )
iii) Transitive: equivalence relation. ( ) ( ) ( ) ( ) ( ) ( ) ( )+
Let( ) ( ) 5. Let * + and *( )( ) ( )+ Write i) Reflexive: ( ) ( ) ∴ is not reflexive.
down the minimum number of ordered pairs to be included ii Symmetric: ( ) ( ) ∴ R is symmetric.
( ) to to make it (i) reflexive (ii) symmetric (iii) transitive iii) Transitive: ( ) ( ) ( )
a multiple of 12. (iv) equivalence relation. ∴ R is not transitive.
( ) ∴ R is transitive i) Reflexive: ( )( ) iv) Equivalece relation: is not an equivalece relation
∴ R is an equivalence relation. we have to include ( ) ( ) is reflexive. 9. On the set of natural numbers, let be the relation
2. In the set of integers, define if is divisible ii) Symmetric: defined by a if Write down the relation
by 7 Prove that is an equivalence relation. ( ) we have to include ( ) is symmetric. by listing all the pairs. Check whether it is (i) reflexive (ii)
define if is divisible by 7 a multiple of 7 iii) Transitive: Nothing to include. symmetric (iii) transitive (iv) equivalence relation.
i) Reflexive: iv) Equivalece relation:
a multiple of 7 we have to include ( ) ( )( ) is an equivalence
M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 1
 a 3 6 9 12 √ is ( - , ) A function and are functions such that
b 8 6 4 2 not defined then both and are bijections and they
*( ) ( )( )(
)+ not defined are inverse to each other.
i) Reflexive: largest possible domain ( )
( ) , but ( ) ( ) ( ) ∴ R is not reflexive. , - ,( - , )- , ) ( -
ii) Symmetric: 13. Find the largest possible domain for the real valued ( )
( ) ( ) ∴ R is not symmetric. √
iii) Transitive: we cannot find two pairs ( )( ) such function given by ( )
√ ( )( ) , -
that ( ) . ∴ R is transitive. value of ( ) Domain;
iv) Equivalece relation: is not an equivalece relation , - ( )( ) [ ] ( )
10. Find the range of √ is not
defined
and are bijections and they are inverse to each other.
must lie outside ( ) ( )
√ is not , -
defined 16. Write the values of at – if
( - , )

not defined ( )
Range of . 1 , ) largest possible domain; {
, - ,( - , )- ) ( ( )
11. Find the range of the fuction ( )
14. If defined by ( ) prove that is a ( )
bijection and find its inverse. ( ) ( ) ( )
A function and are functions such that ( )
then both and are bijections and they ( ) ( ) ( )
are inverse to each other.
17. Write the values of at –
( ) ( )
( ) ( )
( )
( )
; Range of . 1 , ) ( )( ) , -
{
12. Find the largest possible domain for the real valued ( ) ( )
√ ( )( ) [ ] ( ) ( ) ( )
function given by ( )
√ ( )
value of ( ) Domain and are bijections and they are inverse to each other. ( ) ( )
, - ( )
( ) ( )
√ is
not defined 15. If defined by ( ) prove that is a
must lie outside , - bijection and find its inverse.

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 2
18. A salesperson whose annual earnings can be
represented by the function ( )
where is the rupee value of the merchandise he sells. His
son is also in sales and his earnings are represented by the
function ( ) Find( )( ) and ( )
deternine the total family income if they each sell The acid conent in the resulting mixure will be morethan
Rupees1,50,00,000 worth of merchandise. but less than litre; litre;.
( ) ( )
2.Solve
Total income ( )( )
When ;
( )( ) ( )
The percentage of persons who knows only L=39 ( )
19. The formula for converting from Fahrenheit to Celsius
The required number of persons
temperature is . Find the inverse of this fuction
and determine whether the inverse is also a function. 2. BASIC ALGEBRA;
A function and are functions such that 1. A manufacturer has 600 litres of a 12 percent solution of
then both and are bijections and they acid. How many litres of a 30 percent acid solution must be
are inverse to each other. added to it so that the acid content in the resulting mixure
will be morethan 15 percent but less than 18 percent? ( )
( ) Let be the amount of mixing solution of acid Zeros:
Total amount of solution Intervals: ( )( )( )
( ) The acid conent in the resulting mixure will be morethan
but less than
. /
( )( ) [ ] ,; - ( )
, - ( ) ( )
. / - ( )
( )( ) [ ] ( ) ( ) ( )
( ) ( ( ) ( ∴ Solution set ( ) ( )
and are bijections and they are inverse to each other. ( )
3. Find all values of for which
) ) ( )
( ) ( ) Zeros:
( ( Intervals: ( )( )( )( )
20. In a survey of 5000 person in a town, it was found that
45% of the persons know Language A, 25% know ) ) ( )
Language B, 10% know Language C, 5% know Languages ( )
A and B, 4% know Languages B and C, and 4% know
Languages A and C. If 3% of the persons know all the
three Languages, find the number of persons who knows ( )
only Language A? ( )
( )
( )
∴ Solution set ( ) ( )
M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 3
4. Find all values of that satisfies the inequality When ( ) ( )( ) ( )
When ( ) ( )( ) ( )
( )( ) When ( )( ) ( )( )
Zeros: When ( ) ( )( ) , ( ) -( )( )
Intervals: . / . / ( )( ) ( ) When ( )( ) ( )( ) , ( )
( ) )( )( )
( ) ( )
( )( )
( )
( )
7.Resolve into partial fractions ( )( )
( ) When ( )( ) ( )( ) , ( )
( ) -( )( )
( ) ( )( )
( ) ( )( ) ( ) ( ) ( )
( )
( )( ) ( )( )
( ) ( ) ( )( )
∴ Solution set . / ( ) When ( ) ( ) , ( ) -( ) ∴( )
( )( )( )
5. Solve When ( ) ( ) , ( ) -( )
( )( )
( ) ( )
( )( ) When ( ) ,( ) - , ( )
Zeros: -( )
( )( )( )
Intervals: ( )( )( )( )( ) , -( )
( ( ( ( ( )( ) ( ) ( )
( ) ( ) ( )
) ) ) ) ( )( )
( ) 9.Resolve into partial fractions ( )
( )
( )( )
( )
( ) ( ) ( ) ( )
( ) ( )( ) ( ) ( )
( ) 8.Resolve into partial fractions ( ) ( )
( )( )( )
( ) ( ) ( )
( ) ( ) When
( )( )( )
∴ Solution set ( - , ) When ( )
6.Resolve into partial fractions ( )( )( ) When
( ) ( )
( )( ) ( )( ) ( )( )( )
( ) Solving ( ) ( ) we get and
( ) ( )( )( )
( ) ( ) ( )( ) ( )( ) ( )( ∴( )
( ) ( ) ( )
( ) ( ) )( )
( ) When ( )( ) ( )( ) ( )( )( ) 10.Resolve into partial fractions
( )

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 4
Degree of numerator = degree of denominator ( ) ( ) ( )( ) √ √ √ √ √ √ √ √
) (
15. If √ √ find .
( )( )
( ) (√ √ ) √ √
( ) , -( ) √ √ √
( )
( )( ) √ √ √
( ) ( ) , -( ) √ √ √ ( √ )
( )( ) When ; ( )
( ) ( )
√
( )( ) When ;
( ) ( ) Equating the coeffients of
When ( ) 16. Prove that .
When ( )
( )
( ) , -
13. Find the square root of √ . ( ) ( )
( ) √ √ ( )
√ √
11.Resolve into partial fractions;
√ √ ( )√
Degree of numerator degree of denominator
√( √ )
) (
√ , √ √ - 17. If , find the value of .
14. Simplify:
√ √ √ √ √ √ √ √
√ √
( ) ( ) √ (Change of base rule)
√ √ √
( ) √ √ √ √
( )( ) √ √
( ) √ √ √ √ √ √
( ) (Power rule)
√ √ √ √
( )( ) √ √
( ) ( ) √ √ √ √ √ √ ( )
When ; ( ) √ √ √ √
√ √
( ) √ √ √ √ √ √
√ √ ( )
( ) √ 18. Solve
√ √ √
( ) ( )
√ √ √ √ √ √ √ √
12.Resolve into partial fractions √ (√ √ ) √ √ (√ √ ) √

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 5
 ⁄ Total number of numbers which are neither divisible by 2 nor
by 5
(Change of base rule)
3. How many strigs can be formed using the letters of the
word if the word
Let ( ) ( ) either starts with or ends with ?
( ) neither starts with nor ends with ?
(Quotient rule) ( ) Stings starts with L:
⁄ Place ( )
( )
No of ways
Let ( ).
No of ways ( )
19. Prove that . Stings ends with L:
Place ( )
⁄
( ) No of ways
⁄ No of ways ( )
√ √
4.COMBINATORICS & MATHEMATICAL Stings either starts with L or ends with S:
( )
INDUCTION Place ( ) ( )
( ) ( )
( ) 1. To 1. a 1. To travel from a place to place , there are two diffent No of ways
( ) ( ) bus routes , two different train roots and one No of ways ( )
( ) ( ) air route From place to there is one bus route say By the principle of inclusion – exclusion,
, two different train roots say and one air route ( ) ( ) ( ) ( )
Find the number of routes of commuting from to ( )
via without using similar mode of transportation. ( )Filling 5 vacant places by the 5 letters
Place
No of ways
No of ways
20. If then prove that . ∴ Total number of routes ( ) ( ) ( ) Total number of strings which are neither starts with L nor
( ) ( ) ( ) ends with S
Let . 4. A number of four different digits is formed with the use
2. How many numbers are there between and of the digits and in all possible ways. Find the
(both inclusive) which are divisible neither by 2 nor by 5? following
( ) ( ) How many such numbers can be formed?
Total numbers between 1 and 1000 (both inclusive)
( ) ( ) How many of these are even?
Total number of numbers which are divisible by 2 ( )
( ) ( ) How many of these are exactly divisible by ?
Total number of numbers which are divisible by 5 ( )
Adding the above we get, ( ) Numbers 5 ( and ) Digits:
Total number of numbers which are divisible by 2 and 5
( ) ( )- The number of four digits numbers is formed with use of
,
Total number of numbers which are divisible by 2 or 5
( ) ( ) ( ) ( ) ( ) For even numbers last digits must be or .
21. Solve . ( ) (⏟ ) ( ) ( ) ( ⏟ ⁄ )
⁄

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 6
The required number of ways ( )( ) ( ) There are no restriction , if
( ) Since the number is divisible by 4, then last two digits ( ) Either F or M drives the van ( ) The vowels and consonants are alternative
must be divisible by 4. The last two digit must be 12, 24, 32, ( ) sits next to a window and F driving. ( ) All the vowels are together
52 (4 ways) ( ) Vowels are never together
(⏟ ) ( ) (⏟ ) ( ) No two vowels are together
Total letters
The required number of ways Number of family members Number of seats Number of vowels= ( ) ( ) (3 times).
( )( ) ( ) There are no restriction: Number of consonants ( ) ( )
5. How may different strings can be formed together using The number of ways of occupying the driver seat is ( ) The vowels and consonants are alternative:
the letters of the word so that The number of ways of occupying the remaining 7 seats by the The 6 vowels ( ) can be arranged themselves in
( ) the vowels always come together? remaining 6 people is
( ) the vowels never come together? The total number of ways ( )( )

Total letters 8( ) Vowels 5( ) ( ) Either F or M drives the van: As the driver seat can be The 6 consonants ( ) can be arranged
( )The number of permutations of different objects, taken all occupied by only F or M, there are only two ways it can be themselves in ( )
at time, when specified objects are always together is occupied. Total number of ways ( )
( ) The number of ways of occupying the remaining 7 seats by the (Since the vowels and consonants come together are arranged
Here remaining 6 people is in ways )
The total number of strings in which the vowels always come The total number of ways ( ) All the vowels are together
together ( ) ( )( ) ( ) sits next to a window and F driving: Number of vowels
Number of window seats Total number of ways ( )
( )The total number of all strings The number of ways of occupying the window seats by Since I and T occurs twice, E occurs thrice, So the required
.
The number of ways of occupying the remaining 4 seats by the number of ways in which vowels are together
The total number of strings in which the vowels are never
come together The total number of all strings The total remaining 5 people is
number of strings in which the vowels always come together The total number of ways ( ) Vowels are never together: The number of all ways
8. 8 women and 6 men are standing in a line.
involving 12 letters
6. There are 15 candidates for an examination. 7 ( ) How many arrangements are possible if any individual
candidates are appearing for mathematics examination can stand in any position? The required number of ways The number of all ways
while the remaining 8 are appearing for different subjects. ( ) In how many arrangements will all 6 men be standing involving 12 letters The required number of ways in which
In how many ways can they be seated in a row so that no next to one another? vowels are together
two mathematics candidates are together? ( ) In how many arrangements will no two men be ( ) GAP METHOD: No two vowels are together:
GAP METHOD: , standing next to one another?
The required number of arrangements ( ) Total members= 6 mens+8 womens = 14 The number of ways ( )
( ) ( ) The number of arrangements if any individual can stand in Since I and T occurs twice, E occurs thrice, So the required
any position is number of ways in which no two vowels are together
, - ( ) STRING METHOD:
( )
7. A van has 8 seats. It has two seats in the front with two The number of arrangements ( )
( ) 10. Each of the digits and 4 is written on a
rows of three seats behind. The van belongs to a family,
( ) GAP METHOD: separate card. The six cards are then laid out in a row to
consisting of seven members, . How
The number of arrangements ( ) form a 6-digit number.
many ways can the family sit in the van if
9. How many strings are there using the letters of the word ( ) How many distinct 6-digit numbers are there?

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 7
( ) How many of these 6-digit numbers are even? 12. Find the number of strings that can be made using all 15. Find the sum of all - digit numbers that can be formed
( )How many of these 6-digit numbers are divisible by 4? letters of the word If these words are written as in a using the digits and 5 repetitions not allowed?
Given digits are 1, 1, 2, 3, 3, 4 (6 digits) dictionary, what will be the string? Here
1 occurs twice , 3 occurs twice Dictionary order: The sum of all digit numbers that can be formed using the
( ) The number of 6 digit numbers given nonzero digits is
( ) The unit place must be 2 or 4. *( ) ( sum of the digits) ( )+
( ) ( ) ( ) ( ) ( ) (⏟ ) Required Sum ( ) ( ), -( )
⏟
( )
The number of 6 digit even numbers
16. Find the sum of all - digit numbers that can be formed
(1 occurs twice , 3 occurs twice)
using the digits without repetition.
( ) A number is divisible by 4, then last two digits of that string is Here
number is divisible by 4. So last two digits are . 13. If the letters of the word are permuted in all If is one digit among the given digits, then the sum of the
When the last two digits are 12, the number of 6 digit numbers possible ways and the words thus formed are arranged in digits numbers that can be formed using the given digits
( 3 occurs twice) the dictionary order(alphabetical order), find the ranks of (including ) is If
When the last two digits are 24, the number of 6 digit numbers the words ( ) ( ) *( ) ( sum of the digits) ( )+
( 1 occurs twice , 3 occurs twice) () *( ) ( sum of the digits) ( ) )+
5 1 2 4 3 ( ) ( ), -( )
When the last two digits are 32, the number of 6 digit numbers
T A B L E ( ) ( ), -( )
( 1 occurs twice) 4! 3! 2! 1! 0!
The number of 6 digits numbers which are divisible by4 4 0 0 1 0 ( )( )( ) ( )( )( )
Rank of ( ) ( ) ( )
11. If the letters of the word are permuted in all 17. find( ) ( ) , find
possible ways and the strings thus formed are arranged in
the dictionary order, then find the ranks of the words ( ) ( )
( )
() ( ) 2 4 3 1 5 ( )
() B L E A T ( ) ( )
4 1 6 2 3 5 ( )
4! 3! 2! 1! 0! ( ) ( )
G A R D E N 1 2 1 0 0
5! 4! 3! 2! 1! 0! ( ) ( )
Rank of ( ) ( ) ( )
3 0 3 0 0 0 ( )( ) ( )
Rank of ( ) ( ) 14. Find the sum of all - digit numbers that can be formed ( )
( ) ( ) using the digits . ( )( )
( ) Here
2 1 5 4 3 6 ( )( )
The sum of all digit numbers that can be formed using the
D A N G E R 18. An exam paper contais 8 questions, 4 in Part A and 4 I
given nonzero digits is
5! 4! 3! 2! 1! 0! Part B. Examiners are required to answer 5 questions. In
*( ) ( sum of the digits) ( )+
1 0 2 1 0 0 how many way can this be done if (i) There are no
Required Sum ( ) ( ), -( )
( ) ( ) ( ) restrictions on choosing a number of questions in either
Rank of ( ) parts (ii) At least two questios from Part A must be
answered.
M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 8
( )The total number of ways of attempting 5 questions from 8 Find the number of ways in which this can be done.
questions is Further find in how many of these committees
(i) a particular teacher is included?
( )
(ii) a particular student is excluded?
Part A Part B Number of selectios
Number of teachers=5; Number of students=20
2 3 The number of ways to select 2 teachers and 3 students is
Total number of ways
3 2 23. A committee of 7 peoples has to be formed from 8 men
( )A particular teacher should be included. Remaining number and 4 women. In how many ways can this be done when the
4 1 of teachers=4. committee consists of
The number of ways to select 1 teacher from 4 teachers and ( ) exactly 3 women?
Total 52 and 3 students from 20 students is ( ) at least 3 women?
19. Find the number of strings of 5 letters that can be ( )at most 3 women? ()
formed with the letters of the word . Women( ) Men( ) Arrangements
Total letters There are four distinct letters (R, S, T, N), ( ) A particular student should be excluded. Remaninig
sets of two alike letters (PP, II), I set of three alike letters number of students=19.
(OOO). The number of ways to select 2 teachers from 5 teachers and
Letter options Arrangemets and 3 students from 19 students is ( )
5 distinct Women( ) Men( ) Arrangements
( )
1 set of 3 alike (OOO), 21. Determine the number of 5 card combinations out of a
1 set of 2 alike (PP, II) deck of 52 cards if there is exactly three aces in each
combination.
Card Number of Selections Arragements
1 set of 3 alike (OOO), Card
2 distict ( )1 options
distict Ace
Total number of ways
Others
2 set of 2 alike ( ), ( )
1 distict ( and Wome( ) Men( ) Arrangements
remaining one in 2 alike) Total Number of Arrngements
22. Find the number of ways of forming a committee of 5
1set of 2 alike ( ),
members out of 7 indians and 5 Americans, so that always
3 distinct ( and
Indians will be the majority in the committee.
remaining two in 2 alike)
Indians(7) Americans(5) Arragements

Total number of strings

20. There are 5 teachers and 20 students. Out of them a
committee of 2 teachers and 3 students is to be formed.

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 9
 alike letters (AA, II, NN)
Letter options Arrangemets Steps for Mathematical Induction
5 distinct (i) P(1) is true.
( ) (ii) Assume P(k) is true.
2 set of 2 alike ( ) (iii) P(k+1) is true.
(iv) By mathematical induction, P(n) is true for all .
5.BINOMIAL THEOREM, SEQUENCE AND SERIES
Total number of ways 1set of 2 alike ( ) 1. Fid seven numbers so that the sequence
24. 7 relatives of a man comprises 4 ladies and 3 gentlemen, 2 distinct( and is in arithmetic progression and also 4
his wife also has 7 relatives; 3 of them are ladies and 4 remaining two in two alike) numbers so that the sequence
gentlemen. In how many ways can they invite a dinner is in geometric progression.
party of 3 ladies and 3 gentlemen so that there are 3 of
Given A.P is Here
man’s relative and 3 of the wife’s relatives? Total number of ways
Husband’s Wife’s relations Arrangemets 27. How many triangles can be formed by 15 points, in
relations which 7 of them lie on one lie and the remaining 8 on
Men Women Men Women another parallel line? ( )( )( )( )(
(3) (4) (4) (3) Line I Line II Arrangemets )( )( )
(7 ponits) (8 ponits)
( ) ( ) ( ) ( ) ( ) (
1 2
) ( )
2 1

Total number of ways 364

Total number of ways
25.A box contains two white balls, three black balls and
four red balls. In how many ways can three balls be drawn 28. There are 11 points in a plane. No there of these lies in Given G.P is Here
from thebox, if atleast one black ball is to be included in the same straight line except 4 points, which are collinear.
the draw? Find, ( )
Black White(2) Red(4) Arrangements ( ) the number of straight lines that can be obtained from
(3) =6 the pairs of these points?
( ) the number of triangles that can be formed for which
the points are their vertices?
( ) Total number of lines
( ) ( ) ( ) ( )
2.If the product of the and terms of a geometric
Total number of ways progression is and if the product of the
26. Find the number of strings of 4 letters that ca be ( ) Total number of triangles terms of it is , find the sum of first
formed with the letters of the word ? terms og the geometric progression.
Total letters
There are five distinct letters (E, X, M, T, O), 3 sets of two
The terms are and
M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 10
their Product ∴ are in arithmetic progression. Taking on both sides ( )
( ) 5. If is the term of a GP, then show that
The terms are and also form a GP for any positive iteger . ( )
their Product ( ) ( ) ( )( )
( )
( ) ( ) ( ) ( )
( ) ( ) ( )
( ( ) are in GP.
8. Find the sum of the terms of the series
Substitute in;( ) ( ) 6. If the roots of the equation ( ) ( ) .
are equal, then show that and are in AP. √ √ √ √ √
( ) ( )
( ) ( ) √ √
( ) , - ( ) √ √ √ √ √ √
3. The product of three increasing numbers in G.P is 5832.
( ) , - ( ) √ √ √ √ √ √
If we add 6 to the second number and 9 to the third
number, then resulting numbers form an A.P. Find the ( ) ,( ) ( )- ( ) ( )
( ) ( ) ( ) ( ) √ √
numbers in G.P. √ √
( ) , - ( ), -
Let three numbers are
( ), ( ) ( )-
Product √ √ √ √ √ √ √ √
√
are in A.P. ( roots are equal ) 9. Find ∑
( )

( ) , -
∴ are in AP. ( )
( ) 7. If are respectively the , and terms of a + . / . / ( )
GP, show that ( ) ( ) (
) .
10. Find ∑
( )( )

∴ Three numbers are Taking on both sides ( ) ( )( ) ( ) ( )

() ( )
( ) ( ) ( )( ) ( ) ( )
( ) ( )
( ) ( )
4. If are in geometric progression, and if ⁄ ( ) ( )
Taking on both sides ( )
⁄ ⁄
, the prove that are in arithmetic
progression. ( ) ;
( ) ( ) ( ) ( )( )
⁄ ⁄ ⁄ ( )
Let . ∴∑
( ) ( ) ( ) ( )
M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 11
11. Expand ( )
in powers of Find a condition on ( ) ⁄
| | . /
[ ( ) ]
for which the expansion is valid.
. /
( ) ( )( ) [ ( ) ]
( ) . /
[ ] [ ]
( )- . /
( ) , . /- [ ] [ ]
( ) ( )( )
, ( ) ( ) ( ) Since is large, is very small and higher powers of are
- negligible.
Since is large, is very small and higher powers of are
[ ] √ √ [ ]
negligible.
√ √ [ ]
[ ]
14. Prove that √ is approximately equal to
| | , | |
37.Prove that √ √ is approximately equal when is very small.
| | | | to when is sufficientely large. ( ) ( )( )
( )
12. Prove that √ √ is approximately equal ( ) ( )( )
( ) ( ) ( )( )
to when is large. ( )
⁄
( ) ( )( ) ⁄
( ) √ ( ) [ ( )] ⁄
√ ( ) ⁄ ( ) ⁄
⁄
( )
⁄
⁄ ( ) | |
√ ( ) [ ( )]
. / . / . /
( ) ⁄
| | [ ( ) ] [ ][

. /
[ ( ) ] . /
[ ] [ ] ]

. /
[ ] [ ] [ ][ ]
⁄
√ ( ) ⁄
[ ( )]
⁄ ⁄ . / ( )( is very small )
⁄ ( ) | |
√ ( ) [ ( )]

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 12
15. If is small compared to either or , then show
( ) ( )
that √ ( ) ( )
. Hence find √ .

( ) ( ) ,( ) ( )
( ) ( ) ,( ) ( )
( )0 . /1

( )0 . /1
⁄
. / . /
( ( ) )
⁄
. / . /
⁄ ⁄ ⁄
( ) ( ) ( )
( ) ⁄ ( ) ⁄ ( ) ⁄

⁄ ⁄ ⁄
⁄
( ) √
⁄ ⁄ ⁄

( ) ( ) ( )
√
( ) ( ) ( )

M.SURESH,PGT,GHSS,ERIYUR & V.GNANAMURUGAN, PGT, GHSS, O.SIRUVAYAL, SIVAGANGAI DT – 94874 43870 Page 13