Beruflich Dokumente
Kultur Dokumente
6)when two circles are of same radius are overlapped with center common area is 1/2 (4*pi /3 - root
3) r^2
sin(18) = (5 - 1)/4
cos(18) = *(10 + 25)+ / 4
8)Angle between minute hand and hour hand at x minute past h hrs is 11m/2-30*h= angle
Ex find time between 7 and 8 when the hands of a clock are at right angles..so +-90=11m/2 -30*7
Solving we get minute m
14)Fermats Little Theorem. a^p mod p = p ===> a^p-1 mod p = 1 where a & p are co-prime to each
other.
16)If '1 to n' persons are arranged in a circular manner and if a person is to be chosen by removing
alternate persons starting from number 1 then last person remaining will bewrite n= 2^p + m; where m is left over...Answer would be 2m
if alternate persons are removed starting from number 2 then answer would be 2m+1.
17)3 dice -sum will range from 3 to 18, No of ways of getting a sum 3,18 -1 way
4,17 - 3 ways
5,16 - 6 ways
6,15 - 10 Ways
7,14 - 15 ways
8,13 - 21 ways
till this it forms a triangular no series.
9,12 - 25 ways and 10,11 - 27 ways.
18)If m parallel lines are intersected by family of other n parallel lines then the total number of
parallelograms so formed is C(m,2) * C(n,2)
20)If |x| +|y|=a, then the area of the region bounded by the given curve will be 2a^2, This is also
valid when |x+k|+|y+k|=a
21) N=p^a*q^b*r^c....
no of coprime pairs= [ (a+1)^2-a^2][ (b+1)^2-b^2][ (c+1)^2-c^2]+1 /2
23)any single digit number n repeated p-1 times is divisible by p where p is prime>5
e.g 77777.....77 22 times is divisible by 23
26)matchstick game
n matchsticks on table ,p at max can be taken
winning strategy playing first when:a)person who takes last matchstick wins-n%(p+1) should be no of matchsticks in first draw
b)when person who takes last matchstick loses(n-1)%(p+1) should be taken in first draw given that n is not equal to kp+k+1 where k is any integer
>=0
if n=kp+k+1 no matter what first player do he can't win
27)In a triangle 1/r = 1/h1 + 1/h2 + 1/h3 where r=inradius and h1, h2, h3 are height of the triangle.
29) one-one function (injection) : A one-one function from A to B is possible from A to B if n(A)<=n(B)
& if n(A) =m and n(B) = n then number of one to one function is nPm
30) onto function(surjection) is possible from A to B if n(A)>=n(B) & if n(A)=m ,n(B)=n then number
of onto functions is n^m-nC1(n-1)^m+nC2(n-2)^m......+...
31)bijection (both one-one and onto): possible if n(A)=n(B) & if a set A has n elements no. of
bijections from A to B is n!
37)If we have two containers, container 1 is containing "a" litters of milk and container 2 is also
containing "a" litters of water.
If we pour "b" litters of pure milk from container 1 to 2 and then "b" litters of solution from
container 2 to 1, and repeat the process then
assume ratio after any process is 76:49, it means if we talk about container 1 , milk should be more ,
so 76:49 is milk:water in container 1 and this would ratio of water : milk in container 2.
38)if p! ends with k zeroes ,k can take gif(p/5}+1 values for p>=0
41)if sides of rectangle are coprime then no of squares cut by diagonal =a+b-1
42)tournament
knockout
1)no of matches=no of players or n-1
2)no of rounds= no of bits of n when expressed in binary
3)the rth match in round 1 will be played between seed r and n+1-r
4)if there are no upsets then rth match in pth round will be played between seed r and seed (n/2p 1) +1 -r
43)tournament
roundrobin
1)no of matches = n/2* (n-1) where n is no of players
2)if n is even (n-1) rounds are there with n/2 games in each
3)if n is odd n rounds are there with (n-1)/2 games with 1 not playing
44)if we have to color the graph such that no adjacent sides have same colors a maximum of 4 colors
are needed to color any graph
45)A Mbius strip of half-width w with midcircle of radius R and at height z=0 can be represented
parametrically by
x=[R+scos(1/2t)]cost
(1)y=[R+scos(1/2t)]sint
(2)z =ssin(1/2t),
48)if n > 1 and n is not equal to 6, then 2n 1 has a prime divisor not dividing any 2k 1 with k < n.
52)The two hands of a clock will be together between H and (H+1) o' clock
at (60H / 11)minutes past H o' clock.
2) The two hands of a clock will be in the same straight line but not
together between H and (H + 1) o' clock at
(5H30)*(12/11) minutes past H, when H > 6
(5H+30)*(12/11) minutes past H, when H <6
3) Angle between Hands of a clock
When the minute hand is behind the hour hand, the angle
between the two hands at M minutes past H'o clock
=30(HM/5)+M/2 degree
When the minute hand is ahead of the hour hand, the anglebetween the two
hands at M minutes past H'o clock=30(M/5H)M/2 degree
4) The two hands of the clock will be at right angles between H and (H + 1)
o' clock at
(5H15)12/11 minutes past H 'o clock
5) The minute hand of a clock overtakes the hour hand at intervalsof M
minutes of correct time. The clock gains or loses in a day by=
(720/11M)(6024/M) minutes.
53)For any point P in the plane, with distances p, q, and t from the vertices A, B, and C respectively,
3(p^{4}+q^{4}+t^{4}+a^{4})=(p^{2}+q^{2}+t^{2}+a^{2})^{2}
54)inclusion exclusion: application : when n different things to be arranged in r different boxes such
that each boxes gets atleast one is
56)For any set of n positive numbers ,Arithmetic Mean >= Geometric Mean >=Harmonic mean The
equality occurs only when all the numbers are equal .This can be used if the sum(or product ) of
some numbers are given and the maximum(or minimum) value of the product(or sum ) is asked ...
57) For any prime number p, (p-1)times same digit is repeated , then that number formed is exactly
divisible by peg. 666666 is divisible by 7.
59)If three circles touch Each other in a row and they have two direct common tangents, then their
radii are in GP series
60)f a n digit number is multiplied by an (n+1) digit number , the product has 2n or (2n+1) digits.
61)Any nth degree polynomial has exactly n roots. So if f(x) is a polynomial which does not have a
root at 0 (which can be determined by inspection) then the minimum number of complex roots is
equal to
n-(p+q),\,
where p denotes the maximum number of positive roots, q denotes the maximum number of
negative roots (both of which can be found using Descartes' rule of signs), and n denotes the degree
of the equation.
63)Raj Theron Difference between SI* and CI for the third year=Pr^2(r+3*)where r=(R/100) and P is
the amount and R is the rate of interest.Please cross check.
65)total no of 1's used in above= n*2^(n-1) Total no of 0's used=no of digits-no of 1's
66)if n identical dice are thrown ,no of distinct possible outcomes =C(n+5,5)
67)n identical dice are thrown ,no of distinct possible outcomes (Unordered) = 5n+1 (All possible
distinct sum)
68)Number of positive integral solution (possible sets of a, b, c) that can satisfy a^n + b^n = c^n
where n= (integer >2) is = 0
70) Infinite monkey theorem:The infinite monkey theorem states that a monkey hitting keys at
random on a typewriter keyboard for an infinite amount of time will almost surely type a given text,
such as the complete works of William Shakespeare.
71)no of triangle with integer side=<(n+3)^2/48> where<>is nearest integer and n(perimeter) is odd
or <n^2/48> when n is even.
no of scalene triangle with integer side= in formula above substitute n=n-6.
no of isosceles triangle with integer side n= total triangle-scalene,