You are on page 1of 15

KAPIL YADAV

GENERAL APTITUDE AND REASONING

Reciprocal relations of Trigonometric Ratios

 1 / sin x = cosec x
 1 / cos x= sec x
 1 / sec x= cos x
 1 / tan x= cot x
 1 / cot x= tan x
 1/ cosec x = sin x

Sin cos tan


P B P
H H B
Cosec sec cot

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

Number System:
Rational number : Non terminating repeating (10/3)
Irrational Number : Non terminating, non repeating (22/7)
Real Number : (Rational + Irrational) - All numbers are Real Numbers.
Integers : integers are whole numbers (not fractions) that can be positive,
negative or zero.
Whole Number : whole numbers are natural numbers including 0.
Natural Number : natural numbers starts from 1……

Number= ap x bq x cr
Total Factors= (p+1) (q+1) (r+1)

Where a, b, c are distinct prime numbers and p, q, r are natural numbers.


Q1.) N= 9000 = 23*32*53

Total factors =(3+1)*(2+1)*(3+1) = 4*3*4= 48


Odd factors =(2+1)*(3+1)= 3*4=12 { 3 & 5 are odd numbers }
Even factors = Total factors – odd factors = 48-12=36
Prime factors= 3 {2,3 and 5}
Composite factor= totalFactors – primeFactors – 1
Not prime Not Composite: 1

 Sum of all factors: Number= ap x bq Sum=


a p 1
 1
x
b p 1
 1
(a  1) (b  1)

 Product of all factors: Numbers(total factors/2)

FACTORIAL

 X ! = (P is Prime Number)
P
n

Q1.) What is the Highest Power of 7 in 100!


Ans.) 16
Q2.) what is the highest power of 15 in 100!
Ans) 100! / 15 = 100! / (348 x 524) = 100!(324 x 524) x 324 = 100!/ (1524) x 324 =24

(IF NUMBER IS NOT DIVIDED BY PRIME NUMBER, BREAK IT IN THE FORM OF PRIME
NUMBERS

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

NOTE: 297 * 348 * 524 * 716 * 119 * 137 * 175

CYCLICITY

UNIT 2 3 7 8
PLACE UNIT PLACE 4 9
4N+1 2 3 7 8
4N+2 4 9 9 4 ODD POWER 4 9
4N+3 8 7 3 2 EVENPOWER 6 1
4N 6 1 1 6

0,1,5,6 = no change
Q1.) (732)635 = (732)635/4 = REMAINDER 3.
{ divide the last two digits of the power by 4 i.e. 35/4}
When unit place is 2, and remainder is 3, check in table, answer is 8.
Q2.)(523)222= 22/4=remainder 2 = 9
Q3.) (76)237 x (74)51 = 6x4=4
CALENDER
1.) Multiple of 4 is Leap Year (4,8, 12, 16,….)
2.) Century Year is Non Leap year (100,200,300).
3.) 4th century year is Leap Year (400, 800, 1200, 1600….)
4.) 100 years= 5 odd days
200 years = 10/7 =3 odd days
300 years = 15/7 = 1 odd day
400 years= 20/7 = 6 + 1 more extra day= 0 odd day
5.) 1st odd day is Monday.

Jan Feb March April May June July Augu Sept Oct Nov dec
0 3 3 6 1 4 6 2 5 0 3 5

NOTE: If leap year add 1 in every column from feb month…otherwise take same days for
months. For ex, for 22 october 1997, take no of days from table = 0, now calculate odd days
for 22 days= 1, so total odd days till in 22 october is 0+1=1;

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

PERCENTAGE

x x
  
100  x 100  x

 10  9.09 
 20  16.6 
 25  20 
 33.3  25 
 50  33.3 

R = A x B {WHERE A IS X%, B IS Y%}


CHANGE IN R% = X + Y + XY/100

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

PROFIT AND LOSS

( SP  CP )
P% = *100
CP
(CP  SP )
L% = *100
CP

1.) Two articles are sold at a common selling price of Rs $ each. One is sold at a profit of
p percent and another at a loss of p percent. Then effectively, there is always a loss
during the entire transaction.

2 p2 $
Loss value  ( )
100  p
2 2

p2
Loss%  *100
100

2.) Two articles are bought at common CP. One is sold at the profit of P% and another at
a loss of P%, then effectively there is NO PROFT NO LOSS.

https://www.linkedin.com/in/kapilyadav22
KAPIL YADAV

MIXTURE

Qc PD  MP
( )
Qd MP  PC
Where Qc =
Qd=
PD=
PC=
MP=

n
Quantity of milk left after n thoperation a b
=
 a 
Replacements:
initial quantity of milk

n
 b
Quantity of milk left after n operation = Initial Quantity 1  
th
 a
Where a is initial quantity, b is quantity taken out and replace by water every time, n is no of
operations.
NOTE: this formula is valid when volume is conserved, when volume is not conserve, do
manualy.

TIME, SPEED AND DISTANCE


If equal distances covered with different but uniform speeds. average speed will be
harmonic mean of individual speed.
N
HARMONIC SPEED =
1 1 1 1 1
    .................
x1 x 2 x 3 x 4 xn

 X1 * X 2 * X M 
1/ N
GEOMETRIC MEAN =

https://www.linkedin.com/in/kapilyadav22
KAPIL YADAV

RACES
LINEAR RACES:

CIRCULAR RACES:
1.) Meeting at starting point for first time:
LCM  (Timea, Timeb)

Circumference Circumference
LCM  ( , )
SPA SPB

2.) Meeting for the first time(Orientation: clockwise/ anti clockwise)


Circumference
Re l ( SPa  SPb)

(+ symbol when opposite direction and – symbol when both are in same direction)
p
Let p be the starting point time, q is the meeting for first time (Orientation), then is the
q
number of distinct points where they meet.

BOATS:
Downward Speed=B+C (HIGH) B C
Upward speed = B-C (LOW)

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

LT
Train passes a pole =
SPT
LT  LP
Train passes a platform =
SPT
L1  L 2
Two Train crossing/ overtaking each other =
Re lative( SA  SB)

(+ symbol when opposite direction and – symbol when both are in same direction)

CLOCK
MINUTE HAND HOUR HAND
60 MINUTES= 360  12 HOURS= 360 

1 MINUTE - 6  1 HOUR= 30 

1  = 1/6 MINUTES 1 MINUTE= (1/2) 

1
RELATIVE GAIN WITH THE MINUTE HAND OVER HOUR HAND = (5 )
2
1
FOR RELATIVE GAIN OF (5 ) = MINHAND(6)
2
12
FOR RELATIVE GAIN OF 1  =
11

(IN 12 HOURS) (IN 24 HOURS)

COINCIDENCES - 11 COINCIDENCES - 22

OPPOSITE- 11 OPPOSITE- 22

RIGHT ANGLE- 22 RIGHT ANGLE- 44

 (X) & (X+1) O’ clock ( when time is given in minutes )


12
COINCIDENCES - 5x *
11
12
OPPOSITE- (5 x  30) *
11

https://www.linkedin.com/in/kapilyadav22
KAPIL YADAV

12
RIGHT ANGLE- (5 x  15) *
11

 (X) & (X+1) O’ clock (when time is given in degree form)

 0  12
COINCIDENCES - (5 x  ( 6 ) * 11

 180  12
OPPOSITE-  (5 x  ( ) *
6  11

 90  12
RIGHT ANGLE- (5 x  ( 6 ) * 11

NOTE: GENERALIZED FORMULA:


 D  12
(5 x  ( 6 ) * 11

ALGEBRA:

log m 1 1
1.) lognm = = =
log n log m log mn
log n
2.) ax=p
xloga = logp
x = logap
Loops

n
n(n  1)
(1) 1  2  3  4  .......  n   i 
i 1 2
n
n(n  1)(2n  1)
(2) 12  22  .....  n 2   i 2 
i 1 6

 n(n  1) 
n 2

(3) 1  2  .....  n   i  
3 3 3 3

i 1  2 

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

(4) 1  3  5  .......  (2n  1)  n2

1 1 1 1 n
(5)    ............. 
1.2 2.3 3.4 n(n  1) n  1

1 1 1 1
(6)    .............  log n.
2 3 n
(4) A.P.
Tn  a  (n  1)d (d  Tn  Tn 1 )

n n n
Sn  [2a  (n  1)d ]  [a1  an ]  [a  a  (n  1)d ]
2 2 2
(5) G.P.

Tn  ar n 1

 Tn 
a, ar , ar 2 ,...... r  
 Tn 1 

a (1  r n )
Sn  r 1
1 r

a (r n  1)
Sn  r 1
r 1
a
S  when infinite terms are there.
1 r
QUADRATIC EQUATION
Y= aX2+bX+c=0
D= b2-4ac
D>0 = Real and distinct roots
D=0 = Real and equal roots
D<0 = Non-real roots
2.) Ax3+Bx2+Cx+d=0
1.) Ax2+ Bx + c=0 B
B     
   A
A C
     
C A
 
A d
 
A

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

GEOMETRY
1.) EQUILATERAL TRIANGLE:

a2
H= a2 
4

3
H= a
2

3 2
A= a
4

2.) ISOSCELES TRIANGLE:

c2
H= b2 
4

c
A= 4b 2  c 2
4

3.ISOSCELES RIGHT TRIANGLE:

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

4.

3 D GEOMETRY

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

CUBE
1s= 6 x (n-2)2
2s= 12 x (n-2)
3s= 8
0s = (n-2)3
Where n is the length of the side of cube.

CHESSBOARD
 n(n  1) 
2

 n   2 
3
1. Rectangles = Horizontal linesC2 * Vertical LinesC2 =

Rectangles without squares = No of rectangles- No of squares.

 n(n  1)(2n  1) 
n
2
2. Squares =  
 6

n(n  1)
3. Different types of rectangles =  n 
2
Where n x n is the size of chessboard.

( R  C )!
4. Shortest path from A to B: where R are no of rows, C are no of Columns
R !* C !
Ex: B
Every small square are equal and have size 1 unit & not
allowed to enter inside.

A (5  3)!
Find no of shortest path from A to B =
5!*3!

DATA INTERPRETATION
( finalvalue  Initialvalue)
% CHANGE = *100
Initialvalue

%increase = Growth rate


% decrease= Decline rate

https://www.linkedin.com/in/kapilyadav22/
KAPIL YADAV

SI AND CI

P *R *T
SI= R 2
100 (CI-SI) 2y = p ( )
100
CI= AMOUNT –P
R 3 R 2
R n (CI-SI) 3y = p( )  3 p( )
AMOUNT= P (1  ) 100 100
100

PERMUTATIONS AND COMBINATIONS


n!
Permutation: nPr =
(n  r )!

n!
Combination: nCr =
(n  r )!* r !

Geometry P & C:

 n(n  1) 
No of Diagonals of any n-sided polygon =   n
 2 

https://www.linkedin.com/in/kapilyadav22/

You might also like