Академический Документы
Профессиональный Документы
Культура Документы
If CAT 2005 contains 150 questions and each question contains 4 options find the total
number of ways in which a student can answer atleast 2 out of 150 questions.
4. i have infinite no of 1 Re, 5 Re, 10 Re and 25 Re notes...in how many ways can i give the change
for Rs 100???(pg 3)
a+5b+10c+25d=100
i'll xplaine it for one value of d=0 and same process can be used for other values of d....
d=0 or a+5b+10c = 100 or a+5b = 100-10c
for solving such equations we can first find a solution to a+5b=1 which in this case can be found very
easily because the coefficients i.e. 1 and 5 are easier to deal with .....for difficult looking coeffs. we can
use the simple continued fractions....for this case a=-4 and b=1 satisfies the equation a+5b=1.....
therefore a solution to the equation a+5b=100-10c will be
a=-4(100-10c) and b=1(100-10c) which can be understood with a little reasoning..if a solution to
equation type ax+by=c is known (lets say x=A,y=B satisfies it) then whole series of solutions is given
by (A+bt) and (B-at) for any positive or negative integral value of t.....therefore in this case the general
solution is given by a=-400+40c+5t and b=100-10c-t.....since a>=0 and b>=0,
putting the values of a and b we get 80-8c<=t<=100-10c for all integral t's satisfying this conditionwe
will get different solutions for the basic equation....also 0<=c<=10 that makes the series
21+19+17.......
i hope this helps to find a definitive solution...
5. Find the total number of ways in which two sqares (1x1) can be selected from a chess board such
that they will have a side in common.(pg 3)( For a m * n n & required of size p=1 -> [m-(p-1)] * [n-
(p-1)] + [n -(p-1]*[m-(p-1)].)
I think it will not work out when I am selecting 2 squares of side 2 x 2 from a chess board.
If you had followed the generalisation which I made for the chess board
thinking in the same way the generalisation would be:
First the no. lines on a m x n dimensional board would be m+1 vertical lines and n+1
horizontal lines.
Now the no. vertical lines that can be the common side is given by
(m+1-2s) where s is the side of the squares that we are selecting.
Now from each line I can select two squares that share this line in
(m-s+1) ways.
Similary no. of horizontal lines that can be the common side is given by
(n+1-2s).
Now from each line I can select two squares that share this line in
(n-s+1) ways.
2^999 % 25
= (1024^99) x 2^9 % 25
Remainder obtained when 1024 is divided by 25 is 24 but we can take it as -1 also( always take the smallest remainder
irrespective of sign)
So finally the problem becomes
-1 x 2^9 %25
= -512 %25
= -12 =13 ( finally give the positive remainder)
So when our number is divided by 25 the remainder is 13
So when it is divided by 100 the remainders could be
13 or 38 or 63 or 88.
It is evident that the given number is exactly divisible 4.
I am taking 4 here because the other factor of 100 is 4.
So from the above three remainders there is only one remainder which is exactly divisible by 4 i.e 88.
So the remainder obtained when it is divided by 100 is 88 and thus the last two digits are 88.
Remember here once I decide the remainders using 25 in the exam I can make use of the multiple options and then
proceed.
So folks remember when the divisor is big make use of its factors and options given in the exam
That's it folks. These two examples tell u how powerfull our rule is. I think from now however big the divisor is I think we
should be able to give the remainders because
If the divisor is big and prime please phone a friend (i.e FERMAT)
if it's not prime don't call me please make use of the factors of the divisors and ur options in the exam.
Folks, I think most of u are not concentrating on the options given to you.
It is also clear that the above no. leaves a remainder 7 when divided by 11.
Since 11 and 4 are factors of 440 the remainder obtained when N is divided by 440 should be
such that if it is further divided by 11 and 4 it should leave remainders 7 and 1 respectively.
In the given options here I think there's only one option i.e 337 which satisfy the above
condition.So the answer has to be 337.
We know that the total no. of ways in which a no. can be written as product of two
numbers is 1/2(total factors).
Since in the normal case we do not take both of them we get 28 ways.
But here we need to take both of them because
8640 = 864 x 10 means 10 Rs each to 864 people whereas
8640 = 10 x 864 means 864 Rs each to 10 people which are two different ways in
our problem.
So the total no. of ways in which 8640 Rs can be distributed is 56 out of which there
will be only one way of distributing the money among 27 people
( i.e 27 people getting 320 Rs each)
So the probability is 1/56
-----------------
Find the remainder when 1212121212..........1212 (300 digits) is divided by 999
I have a different approach here.
But before that let's look at a small problem here.
Now 5x36/ 34
Since 2 is common in 36 and 34 let me cacel that 2 in 36 and 34
Now my problem becomes 5x 18/17
I think there will be no change in the quotient but my remainder will be altered.
Another example:
= 12 x ( 10^150-1)/99
= 12 x [9999..........9999 ( 150 digits)]/99
= 12 x [10101010...........1010101 (149 digits)] (please remember this
generalisation,don't deduce iteverytime)
i.e ABABABAB.....................ABAB ( 2n digited number)
is equal to AB x [ 101010...........101(2n-1 digits)]
This may seem little bit hectic but i want all of u to get the concepts.
The other faster way for this is as we have discussed earlier split 999 as 111 and
9 Clearly the given no. is exactly divisible by 9 as well as 111.
Now use your options given in the exam.
---------------------
FIND THE SINGLE DIGIT SUM OF THE NUMBER N = 4444^3333
Here comes our next basic funda.
All of us know that the remainder obtained when a number is divided by10 is nothing
but the unit's digit of that no.
Finally the remainder obtained when 4444^3333 is divided by 9 is nothing but the
single digit sum.
4444^3333 % 9
= 7^ 3333 % 9
= 343^ 111 % 9
= 1.
Since the remainder obtained when N is divided by 9 is 1 the single digit sum is 1.
Remember if the remainder obtained is 0 then the single digit sum is not 0
but ofcourse it is 9
Is the five digited number ABCDE divisible by 13?
MOST OF THE PEOPLE WHO ANSWERED THIS USED THE DIVISIBILITY RULE OF 13 OR SOME
OTHER ASSUMPTIONS TAKING EXAMPLES.
GUYS IF THIS IS NOT CLEAR PLEASE LET ME KNOW BECAUSE U NEED GET
INTO THIS BECAUSE THIS IS AGAIN A GENERALISATION
--------------
prove that N= 244 ^ 1500 - 1 is divisible by 1001.
1001 =7 x 11 x 13
7654823986734573975876926.
Let me make it more clear.
If i need the last two digits of this number in binary expansion divide it by 2^2= 4 and the
remainder here is 3.
Now express this 3 in the binary form which is 11. So the last two digits will be 11.
If i need the last three digits of this number in binary expansion divide it by 2^3 = 8 and
remainder here is 7.
Now express this 7 in the binary form which is 111. So the last two digits will be 111.
So if i need the last n digits of any number in binary expansison divide it by 2^n and express
the remainder obtained in the binar form which will be last n digits of that number in the
binary form.
Now coming to our number the last 4 digits of this number in the binary expansion is nothing
but the binary form of the remainder obtained when the no. is divided by 2^4=16
7654823986734573975876926
The remaider obtained when the above no. is divided by 16 is nothing but the
remainder obtianed when the last four digits i.e 6926 is divided by 16 which is
14. Now the binary form of 14 is 1110.
Three teachers respectively distributed 370, 430 and 580 chocolates equally among
their three classes. The number of students in all the three classes was the same.
That evening three students A, B, C one from each of the three classes respectively
got together and shared their chocolates equally after pooling them first. The
teachers also pooled their remaining chocolates, which happened to be the same
number for all of them and distributed these total remaining chocolates among
students of the first class on the next day. The teachers also found that the strength
of the class is maximum satisfying all the above conditions.
1. Find the total no. chocolates received by student A of the first class.
2. Find the total no. chocolates distributed among the students of first class.
The strength of the class should be such that when it divides 370 430 and 580 the remainder
has to be same and it has to be maximum.
So THE STRENGTH OF THE CLASS IS A MAXIMUM NUMBER WHICH LEAVES SAME REMAINDER
WHEN IT DIVIDES 370 430 AND 580.
SINCE IT LEAVES SAME REMAINDER WITH EACH NUMBER IT MUST DIVIDE THE DIFFERENCE
OF THESE NUMBERS EXACTLY.
Initially 360 chocolates are distributed among the students of first class and then the
remaining chocolates with all the three teachers i.e 30 are also distributed among the students
of first class.
Totally 390 and in addition to this A recieved 3 extra chocolates earlier by pooling his
chocolates with B and C .
1.The maximum possible number of squares of side 5 units that can be cut
out of any such rectangle is
2. How many distinct rectangles are there which satisfy the criteria given
3. Suresh takes all such rectangles possible and cuts each of them
completely and perfectly into small squares. What is the minimum number
of total
squares that he can end up with?
Let me explain it .
It is given that the rectangle can be completely cut into squares of max side 12 which means
there must be no wastage of rectangle when I cut it into squares of side 12.
This is possible only if the length of the rectangle as well as width of the rectangle is exactly
divisible by 12. Since it is given that the max side is 12 so the the greatest common divisor of
length and width is 12.
Let W= 12xa and L=12xb (Remember a and b are coprimes here since the GCD is 12)
The maximum possible number of squares of side 5 units that can be cut out of any
such rectangle is
Since the perimeter of the above 4 rectangles is same I can get max no. squares of
side 5 units from a rectangle where L and W are close i.e rectangle 4.
i.e rectangle with dimensions 84 x 108
The no. of squares of side 5 units that i can get from this rectangle is 16 x
21 = 336 . [( 84 x 10 / (5 x 5)]
Suresh takes all such rectangles possible and cuts each of them
completely and perfectly into small squares. What is the minimum number
of total
squares that he can end up with?
Since I need the minimum no. squares the side of the squares has to be maximum
and the max side possible here is 12.
Similarly from second rectangle no. squares that can be obtained is 3 x 13 =39
Similarly from third rectangle no. squares that can be obtained is 5 x 11 =55
and from fourth rectangle no. squares that can be obtained will be 7 x 9 = 63
A SQUARE IS ROTATED 45 o ABOUT ITS VERTEX . FIND THE AREA COMMON TO THE TWO
POSITIONS.
So clearly TP = PC
So PC = a√2 – a = a (√2-1) = TP
Regards,
Suresh
Let { R1,R2,..................., Rn} - where each Ri ( for i= 1-n) represents a rectangle- denote
the set of all possible distinct rectangles with integer sides and having an area of 864 sq units
each. These rectangles are placed one beside the other on the positive X axis starting from the
origin in the following manner.
Each rectangle Ri is placed twice on the X axis - once with one of it's longer sides lying on the
X axis and a second time with one of it's shorter sides lying on the X axis. In this manner all
the rectangles are placed such that the left edge of every rectangle touches the right edge of
the previous rectangle.
1. Find the coordinates of the top right corner of the right most rectangle if it is known that
the last rectangle has the least possible height.
2. If all rectangles placed on the X axis have to traced out using a pencil, and one pencil can
last only for a length of 100 units, find the minimum no. of pencils required.( common
boundaries between any two rectangles will be traced twice- once with each rectangle)
1.ABC is right angled triangle with right angled vertex B. AB=6 cms BC=8 cms
AC=10 cms. A perpendicular dropped from B meets AC at D. Now a circle is drawn by
taking BD as raidus and B as centre. This circle cuts AB at P and BC at Q. Find AP :
CQ
2. Mr. X has a triangle whose area is 150 sqcms. The length of the greatest side is
50cms and length of the other side is 10 cms. Find the length of the third side. (pg
23)
Q1.
So AB x BC = AC x BD
Finally AP: QC = 3: 8
Q2.
Given greatest side is 50 and other side is 10 cms. Let BC = 50 cms and AC = 10 cms.
Since area is given as 150 we have ½ x BC x AD = 150
So ½ x 50 x AD = 150. Hence AD = 6
Now ∆ ADC is a right-angled triangle in which AC =10 and AD= 6. So DC = 8 cms
Hence BD = 42 cms and AD = 6 cms
Since ∆ ABD is right angled AB = √[(42) 2+(6) 2] = √1800 = 30√2 cms
\-------------
A square ABCD of side ‘ a ’ units is drawn. With the vertex A, B, C and D as centers, circles of
radius ‘ a ’ units are drawn. Find the area that is common to all four circles and the square.
1. For n ∈ N, a n = (1000 n)/ n! is greatest when n =?
Solutions
Clearly
a) a n / a n+1 < 1 for 1 ≤ n < 999
b) a n / a n+1 = 1 for n = 999
c) a n / a n+1 > 1 for n > 999
2. A = 50 99 B= 99!
A>B
If a 1+ a 2+ a 3+ a 4+…………+ a n= k (constant)
Since ab + bc + ac =12
So the max value of ab x bc x ac occurs when ab = bc = ac i.e. a = b = c
So now given expression becomes 3a 2 = 12 i.e. a= 2 (a∈R+)
Hence the max value of a x b x c = a 3 = 8
Regards,
Suresh
Pg 27
So total number of chances to distribute the money is nothing but it's total
factors i.e 72 in this case out of which there is only one favourable chance
2. There is only a single track between two stations P and Q. Exactly one hour after train A leaves P
for Q , tain B arrives at P which started at Q. On a partcular day tain A started late by 20 and
inorder to manage the schedule it has doubled its speed. Train B also changed its speed and finally
reached P on time. If their initial speed ratios are 4:1 respectively find the ratio of their modified
speeds.
3. Mr. A starts at a point P at 3 a.m and moves towards Q. Mr.B starts at point Q at 8a.m and moves
towards P. They met at 12 noon. After meeting if they took equal amout of time to reach their
respective destinations, at what time did they reach their destinations.
4. Certain men can do a work in certain number of days. After they worked for 12 days 1/4 of them
have left. To complete the remaining work the remaining have taken as many days as the initial
number of would have taken to complete the entire work. In how many days is the work completed.
1.A set of six different positive integers a<b<c<d<e<f has a range that is
equal to its mean. What is the smallest possible value of a?
2.If the sum of four consecutive positive integers a three digit multiple of 50, the mean of the
these integers must be one of k possible values, where k=
(A) 7 (B) 8 (C) 9 (D) 10