Best Formulas For Clocks and Calendars
Best Formulas For Clocks and Calendars
Take an example of finding the highest common factor of 100, 125 and 180.
Now let us write the prime factors of 100, 125 and 180.
100 = 2 × 2 × 5 × 5
125 = 5 × 5 × 5
180 = 3 × 3 × 2 × 2 × 5
The common factors of 100, 125 and 180 are 5
Therefore, HCF (100, 125, 180) = 5
120) 180 (1
120
---------
60) 120 (2
120
---------
000
Lets take two numbers i.e., 25 and 35, now to calculate the LCM:
Then multiply each factor the most number of times it occurs in any
number.
If the same multiple occurs more than once in both the given numbers, then
multiply the factor by the most number of times it occurs.
The occurrence of Numbers in the above example:
5: two times
7: one time
LCM = 7 × 5 × 5 = 175
Let us see with the same example, which we used to find the LCM using prime
factorization.
Solve LCM of (25,35) by division method.
5 | 25, 35
----------
5 | 5, 7
---------
7 | 1, 7
---------
| 1, 1
Therefore, LCM of 25 and 35 = 5 x 5 × 7 = 175
Question:
Calculate the highest number that will divide 43, 91 and 183 and leaves the
same remainder in each case
Options
A. 4
B. 7
C. 9
D. 13
Solution:
So differences are
183 – 91 = 92,
183 – 43 = 140,
91 – 43 = 48.
48 = 2 × 2 × 2 × 2 × 3
92 = 2 × 2 × 23
140 = 2 × 2 × 5 × 7
HCF = 2 × 2 = 4
And 4 is the required number.
Correct Answer : A
Question:
Options
A. 9700
B. 9600
C. 9800
D. 9650
Alternatively,
99996006009999 = 16.66500
Correct Answer : B
Question:
The greatest possible length which can be used to measure exactly the lengths
7 m, 3 m 85 cm, 12 m 95 cm is:
Options
A. 25 cm
B. 15 cm
C. 35 cm
D. 55 cm
Solution: Required length = H.C.F. of 700 cm, 385 cm and 1295 cm = 35 cm.
Correct Answer : C
Suppose the question asks to calculate the HCF of any two numbers. Then
Divide the larger number by the smaller one.
Now divide the divisor by the remainder.
Keep dividing the preceding divisor with the remainder until a Zero
remainder is obtained.
The last divisor obtained will be the HCF of those two given number.
HCF in case of more than two numbers:
The HCF of these two numbers and the third number will be the HCF of all
three numbers and so forth.
Choose any two numbers and find their HCF by applying the above-
mentioned method.
The rule for Solving HCF and LCM Questions and Answers:
Calculate the multiples or the factors of the larger number until one of them
is also a multiple of the smaller number.
Then multiply all these factors, and the resultant will be the LCM of the
given numbers.
Question 1. The greatest possible length which can be used to measure exactly
the lengths 5 m, 4 m, 12 m 55 cm is
Options
A. 2
B. 10
C. 25
D. 5
The factors of 400 are: 1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 200, 400
The factors of 500 are: 1, 2, 4, 5, 10, 20, 25, 50, 100, 125, 250, 500
Then the highest common factor is 5. (Since, only 5 is common in all three
Correct option: D
Question 2. The H.C.F. and L.C.M. of two numbers are 10 and 560
respectively. If one of the numbers is 70, find the other number?
Options
A. 80
B. 300
C. 308
D. 280
70 x a = 10 x 560
Correct option: A
Question 3. Find the greatest number which on dividing 1484 and 2045 leaves
remainders 4 and 5 respectively?
Options
A. 20
B. 30
C. 10
D. 40
1480 = 2 x 2 x 2 × 5 × 37
2040 = 2 x 2 x 2 × 3 × 5 × 17
Correct option: D
Options
A. 350
B. 280
C. 250
D. 300
Therefore, numbers are (4 x 300), (3 x 300) and (6 x 300) = 1200, 900, 1800
1200=24∗3∗521200=24∗3∗52
900=22∗32∗52900=22∗32∗52
1800=23∗32∗521800=23∗32∗52
=22∗3∗52=300=22∗3∗52=300
Correct option: D
Options
A. 2
B. 4
C. 34
D. 8
Correct option:A
Options
A. 19359351
B. 29359352
C. 293932
D. 235352
HCF
= 𝐻𝐶𝐹𝑜𝑓𝑛𝑢𝑚𝑒𝑟𝑎𝑡𝑜𝑟𝐿𝐶𝑀𝑜𝑓𝐷𝑒𝑛𝑜𝑚𝑖𝑛𝑎𝑡𝑜𝑟LCMofDenominatorHCFofnumerato
r
HCF = 𝐻𝐶𝐹(2,4,6)𝐿𝐶𝑀(11,17,5)LCM(11,17,5)HCF(2,4,6)
HCF = 29359352
Correct option:B
OType 3: How to Solve when sum of two numbers is given , LCM and HCF is
given to find the sum of reciprocals.
Question: Sum of two numbers is 55 and the H.C.F. and L.C.M. of these
numbers are 5 and 120 respectively, then the sum of the reciprocals of the
numbers is equals to:
Options
A. 1112012011
B. 1122022011
C. 2112012021
D. 1132032011
1𝑎+1𝑏=55600a1+b1=60055
1112012011
Correct Option : A
Type 4: How to Solve HCF, LCM Problems related to finding the biggest
container to measure quantities
Options :
A. 31 litres
B. 21 litres
C. 41 litres
D. 30 litres
403=13×31
434=2×7×31
465=3×5×31
Correct Option : A
Options :
A. 8
B. 16
C. 9
D. 10
Hence, the bells will toll together after every 120 seconds(2 minutes).
Type 6 : How to Solve HCF, LCM Problems related to Circle Based Runner
Problem.
Options
A. 30 seconds
B. 26 seconds
C. 10 seconds
D. 20 seconds
Solution : Time taken to meet for the 1st time= 40040+1040+10400=8 sec.
Correct Option B
The H.C.F of two or more numbers is smaller than or equal to the smallest
number of given numbers
The smallest number which is exactly divisible by a, b and c is L.C.M of a,
b, c.
The L.C.M of two or more numbers is greater than or equal to the greatest
number of given numbers.
The smallest number which when divided by a, b and c leaves a remainder R
in each case. Required number = (L.C.M of a, b, c) + R
The greatest number which divides a, b and c to leave the remainder R
is H.C.F of (a – R), (b – R) and (c – R)
The greatest number which divide x, y, z to leave remainders a, b, c is H.C.F
of (x – a), (y – b) and (z – c)
The smallest number which when divided by x, y and z leaves remainder of
a, b, c (x – a), (y – b), (z – c) are multiples of M
Required number = (L.C.M of x, y and z) – M
Question 1. Find the greatest 5 digit number divisible by 5, 15, 20, and 25
Options
A. 99900
B. 99000
C. 99990
D. 90990
9999930030099999 = 333.33
Therefore, the highest 5 digit number divisible by 300 would be 333 * 300 = 99900
Correct option: A
Options
A. 110
B. 108
C. 36
D. 120
Solution: Let the two numbers be 36x and 36y
xy =388836×3636×363888
xy = 3
36 * 3 = 108
Correct option: B
Type 3: Tips , Tricks and Shortcuts when sum of two numbers is given , LCM
and HCF is given to find the sum of reciprocals.
Question: Sum of two numbers is 60 and the H.C.F. and L.C.M. of these
numbers are 5 and 100 respectively, then the sum of the reciprocals of the
numbers is equals to:
Options
A. 325253
B. 1122022011
C. 2112012021
D. 1132032011
= 500
1𝑎+1𝑏=𝑎+𝑏𝑎×𝑏a1+b1=a×ba+b
1𝑎+1𝑏=60500a1+b1=50060
325253
Correct Option : A
Type 4: How to Solve HCF, LCM Problems related to finding the biggest
container to measure quantities
Options :
A. 31 grams
B. 21 grams
C. 41 grams
D. 30 litres
403=13×31
434=2×7×31
465=3×5×31
Correct Option : A
Type 5 :Tips , tricks and Shortcuts of HCF, LCM Problems related to Bell
ring.
Question: Six bells commence tolling together and toll at intervals of 2, 4, 6, 8
10 and 12 seconds respectively. In 30 minutes, how many times do they toll
together ?
Options :
A. 8
B. 16
C. 9
D. 10
Hence, the bells will toll together after every 120 seconds(2 minutes).
Correct Option B
Type 6 : Tips , tricks and Shortcuts of HCF, LCM Problems related to Circle
Based Runner Problem.
Options
A. 30 seconds
B. 26 seconds
C. 10 seconds
D. 20 seconds
Solution : Time taken to meet for the 1st time= 40040+1040+10400=8 sec.
Now P’s speed = 20m/s and Q’s speed=20 m/s.
Correct Option B
Options
(A) 5
(B) 4
(C) 12
(D) 16
Solution Find the difference between 12 and 16. The difference is 4. Now, check
whether the numbers are divisible by the difference. 12 is divisible by 4 and 16 is
divisible by 4.Hence, the HCF is 4.
Correct Option B
Options
(A) 2
(B) 4
(C) 18
(D) 36
Solution Find the difference between 18 and 22. The difference is 4. Now,
check whether the numbers are divisible by the difference. Both 18 and 22 are not
divisible by 4. So take the factors of the difference. The factors of 4 are 2*2*1.
Now, check whether the numbers are divisible by the factors. 18 and 22 are
divisible by factor 2.
Note: If there are more than two numbers, take the least difference.
Correct Option(A)
Options
(A) 16
(B) 18
(C) 12
(D) 2
2 =2
8 = 23
16 = 24
Choose the largest number. In this example, the largest number is 16. Check
whether 16 is divisible by all other remaining numbers. 16 is divisible by 2, 4, 8.
Hence, the LCM is 16.
Options
(A) 21
(B) 44
(C) 36
(D) 42
Solution Choose the largest number. The largest number is 21. Check whether
21 is divisible by all other remaining numbers. 21 is divisible by 3 and 7 but not by
2. So multiply 21 and 2. The result is 42. Now, check whether 42 is divisible by 2,
3, 7. Yes, 42 is divisible. Hence, the LCM is 42.
page you will get to know about the Logarithms Questions and Answers as well as
some of the concepts also.
DefinitionA Logarithm is power to a number that must be raised to in order
to obtain another number. The majority of the Logarithm aptitude questions
are formula-based.
Logarithms Formula𝑙𝑜𝑔𝑏(𝑥)logb(x) if and only if 𝑏𝑦=𝑥by=x
Given an example, consider that someone inquired “2, raised to which power is
equivalent to 16”? The result will be 4. It is further articulated by the logarithmic
calculation, i.e. log2 (16) = 4, which is further spoken as “log base two of sixteen
is four.”
Logarithm form
Log2(8) = 3
Log4(64) = 3
Log5(25) = 2
Exponential form
2^3= 8
4^3= 64
5^2= 25
Generalizing the examples above leads us to the formal definition of a logarithm.
Logb (a) =c ↔ bc =a
Ordinary Year
The year which is not a leap year is called an ordinary year. An ordinary
year has 365 days.
Leap Year
A leap year has 366 days.
o Every year divisible by 4 is a leap year, if it is not a century.
o Every 4th century is a leap year and no other century is a leap year.
Odd Days:We are supposed to find the day of the week on a given date.
For this, we use the concept of 'odd days'. In a given period, the number of
days more than the complete weeks are called odd days.
o through Calendar Questions Page to get all the sample Calendar Questions for Practicing for Competitive Exam. Here you will also get some Formula that’ ll make Calendar Questions Solving easy.
oThe concept of odd days is used in the doomsday rule to find the day
of the week for a given date within the same year.
o In a normal (non-leap) year, there are 365 days, which is equivalent to
52 weeks and 1 day (1 odd day).
o In a leap year, there are 366 days, which is equivalent to 52 weeks and
2 days (2 odd days).
Doomsday rule:
The calendar starts on 1st January and ends on 31st December. The year is
classified into two types:
1.
1. ordinary years (365 days)
2. Leap year (366 days).
Question 1. It was a Saturday on 8th December 2007. What was the day on
8th Dec 2006?
Options:
A. Tuesday
B. Friday
C. Sunday
D. Saturday
Now, 8th Dec 2007 will be 1 day beyond the day on 8th December 2006 due to
one odd day.
Since 8th December 2007 was Saturday, therefore, 8th December 2006 was Friday.
Correct option: B
Type 3: Shortcuts Tips and Tricks of Calendar To -Identify the year having
same calendar.
Question 1. Which year will have the same calendar as that of the year
2007?
Options:
A. 2017
B. 2018
C. 2019
D. 2012
Solution: Count the number of odd days from the year 2007 onwards to
get the sum equal to 0 odd day.
200 200 200 201 201 201 201 201 201 201 201
Year 7 8 9 0 1 2 3 4 5 6 7
Odd 1 2 1 1 1 2 1 1 1 2 1
Days
Sum = 14 odd days = 0 odd days
Therefore, calendar of the year 2018 will have the same calendar as that of the year
2007.
Correct option: B
Calendar Formulas
Formulas To Solve Calendars Problem in Aptitude
Onis page, you will find out all the Calendar Formula for Solving Questions in
Competitive Exams. Go through this page to get useful Insights to solve Calendar
Questions.
1.
1. Ordinary years (365 days)
2. Leap year (366 days.)z
Odd days are the number of days that are more than the number of
days in a complete week.
For example: Calculate odd days for 10 and 14 days
10 days = 1 week (7 days) + 3 days. Here, 3 days are odd days
Similarly, all the 4th centuries 800 years, 1200 years, 1600 years, 2000
years etc. have 0 odd day.
Reference Chart that gives odd days for the given months
1.
1. If the year is evenly divisible by 4, go to step 2. Otherwise, go to step
5.
2. If the year is evenly divisible by 100, go to step 3. Otherwise, go to
step 4.
3. If the year is evenly divisible by 400, go to step 4. Otherwise, go to
step 5.
4. The year is a leap year (it has 366 days).
5. The year is not a leap year (it has 365 days).
For example:
1. Check for years not ending with “00”.
Year 1997 is not a leap year because it is not divisible by 4.
Year 1900 is not a leap year because it is divisible by 4 and 100 but not 400.
o For this reason, the following years are not leap years:
1700, 1800, 1900, 2100, 2200, 2300, 2500, 2600
This is because they are evenly divisible by 100 but not by 400.
The following years are leap years:
o
1600, 2000, 2400
This is because they are evenly divisible by both 100 and 400.
Points to remember
b. 1stJanuary of both the years must be the same day of the week.
Solution:
To find the number of odd days in 3000 days, divide 3000 by 7 (the number of
days in a week)
So, there are 428 weeks with no odd days and 4 odd days remaining.
Solution:
To determine if the year 2100 is a leap year, we need to check if it satisfies the leap
year rule.
A year is a leap year if it is divisible by 4, except for years that are divisible by 100
but not divisible by 400.
Year = 2100
Since the year 2100 satisfies all three conditions, it is a leap year.
Question: 3 In a leap year, how many days are there between February 15th
and September 10th inclusive?
Solution:
In a leap year, February has 29 days, and all other months have their usual number
of days.
Question: 4 What is the next year that will have the same calendar as the year
2023?
Solution:
The calendar repeats itself every 28 years because the days of the week and the
number of days in each month follow a 28-year cycle.
2023 + 28 = 2051
Thus, the year 2051 will have the same calendar as the year 2023.
Question: 5 If today is Sunday, what day of the week will it be 10 days from
today?
Solution:
Since there are 7 days in a week, to find the day of the week 10 days from today,
We can divide 10 by 7 to get the number of complete weeks and then find the day
of the week for the remaining days.
Counting forward 3 days from Sunday, we determine the day of the week.
Get Pr
m
e
Important Observations and Formulas of Clock :
Solution:
The third Monday of September falls on the day after 14 days (2 weeks)
In 2027, September 1st will be a Wednesday (since the days advance by 2 days
each year)
Question: 2 Sarah set her clock to show 3 o’clock in the afternoon. How many
degrees will the hour hand of the clock rotate when the clock shows 8 o’clock
at night?
Solution:
So, the hour hand will rotate 150° from 3 o’clock in the afternoon to 8 o’clock at
night.
Question: 3 Determine the year in which the calendar will repeat exactly as it
was in the year 2015.
Solution:
2015 + 11 = 2026
Therefore, the calendar for the year 2026 will be the same as the calendar for the
year 2015
Solution:
When the 9th of the month falls on the day preceding Sunday, we establish that the
8th of the month is a Saturday.
To determine the day when the 1st of the same month will arrive, we proceed with
the following sequence:
1. Saturday (8th)
2. Sunday (9th)
3. Monday (10th)
4. Tuesday (11th)
5. Wednesday (12th)
6. Thursday (13th)
7. Friday (14th)
Therefore, if the 9th of the month is positioned just before Sunday, the 1st of the
same month will fall on a Friday.
Question: 5 A wager was made between two friends, Harry and Ronald, to
determine the probability of randomly selecting a leap year that has 53
Fridays.
Solution:
2/7 in a leap year there are 366 days means 52 weeks and 2days. So already we
have 52 Fridays.
Now the rest two days can be:
1.
1. (Sunday, Monday)
2. (Monday, Tuesday)
3. (Tuesday, Wed)
4. (Wednesday, Thursdays)
5. (Thursday, Friday)
6. (Friday, Sat)
7. (Sat, Sun)
So, the probability of 53 Fridays = 2/7
Basic Rules
Rule 0
Rem[(xy)/d] = Rem[ry/d]
Example
Rem[(3132)/3]
= Rem[132/3] (as remainder is 1 when 31 is divided by 3)
=1
or
Rem[(2929)/3] = Rem[(-1)29/3] = -1 = +2
The above -1 can be written as 2 as -1 remained in case of 3 is nothing but + 2
remainder.
or
Rem[(2930)/3] = Rem[(-1)30/3] = 1
Rule 1
Rem[(a*b*c)/d] = Rem[a/d] * Rem[b/d] * Rem[c/d]
Example
3
Rule 2
Example
Rem[(3030)/7]
Solution
Solution
Rem[(303132)/7] = Rem[(23132)/7] (as Rem[30/7] = 2)
Hypothesis
Rem[3132/3] = Rem[132/3] = 1
Thus, can be written in format 3k+1
Common Factor
Example
When trying to find out the remainder, if the divisor can be broken down into
smaller co-prime factors; then
Rem[M/N] = Rem[M/(a*b)]
Such that ax + bx = 1
Example
Rem[(715)/15]
15
Rem[(7 )/(3*5)]
a=3&b=5
Rem[(715)/(3)] = 1 &
15 15
Rem[(7 )/(5)] = Rem[(2 )/(5)] = 3
(Trick) How is Rem[(215)/(5)] = 3 ?
(21)/5 , Rem is 2
(22)/5 , Rem is 4
(23)/5 , Rem is 3
4
(2 )/5 , Rem is 1
5
(2 )/5 , Rem is 2
6
(2 )/5 , Rem is 4
7
(2 )/5 , Rem is 3
8
(2 )/5 , Rem is 1
So remainder for (215)/5 is 3.
So we now have,
r2 = 3, r1= 1
Fermat Theorem
Example
Rem[2345/11]
10 34
Rem[((2 ) (2))/11]
10 34 5
Rem[((2 ) )/11] * Rem[(2) )/11]
p = 11 and p – 1 = 10 so using fermats theorem
34 5
Rem[((1) )/11] * Rem[(2) )/11]
34 5
Rem[((1) )/11] * Rem[(2) )/11]
Rem[1/11] * Rem[32)/11]
1 * 10
10
Euler’s Remainder Theorem
For a number of the form Px/Q , where P & Q are co-primes, then
Rem[Pϕ(Q)/Q] =1, where
ϕ(Q) is called the Euler’s Number.
Remainer of 267/33
Here P = 2 , Q = 33 and x = 67
P and Q are co-prime i.e 2 and 33 are co-prime to each other
1 1
Q = 33 can be prime factorised as { 11 x 3 } which means a = 11 and b = 3
ϕ(Q) = ϕ(33) = 33 (1 – 1/11) (1 – 1/3) = 20
So ϕ(Q) = 20
Now Divide x by ϕ(Q) and find the remainder ‘y’
y = Rem[x / ϕ(Q)]
y = Rem[67 / 20] = 7
y
Now find Rem[P /Q]
7
i.e Rem[2 /33] = 29
67
So, Rem[2 /33] = 29
Answer = 29
Example 2 Using Euler’s Theorem
Remainder of 353/63
Here P = 3 , Q = 63 and x = 53
P and Q are not co-prime i.e 3 and 63 are not co-prime to each other
353/63 = { 32 x 351 } / { 32 x 7 }
353/63 = { 351 } / { 7 }
New Values P=3 and Q=7 are co-prime to each other. And New value of x =
51
ϕ(7) = 6
Now Divide x by ϕ(Q) and find the remainder ‘y’
y = Rem[51 / 6] = 3
y
Now find Rem[P /Q]
3
i.e Rem[3 /7] = 6
53
So, Rem[3 /63] = 6 * 9 = 54 (as we eliminated 9 as common factor
initially )
Answer = 54
Wilson’s Theorem
o When (P-1)! is divided by P, the remainder is (P-1), where P must
be a prime number.
o When (P-2)! is divided by P, the remainder is 1, where P must be
a prime number.
Example 1
Rem[40!/41]
Rem[ (41-1)! / 41]
Here P = 41 is a prime number.
So Rem[ (41-1)! / 41] = (41 – 1) = 40
Example 2
Rem[45!/47]
Rem[ (47-2)! / 47]
Here P = 47 is a prime number.
So Rem[ (47-2)! / 47] = 1
Example 3
Rem[21!/361]
Rem[ (21*20*19*18!) / (19 * 19)]
Rem[ (21*20*18!) / 19] , removing common terms
Rem[(21*20*18!)/19] = Rem[21/19] * Rem[20/19] * Rem[18!/19]
Rem[2] * Rem[1] * Rem[18!/19]
Now, P = 19 is a prime number.
Rem[2] * Rem[1] * Rem[18!/19]
Rem[2] * Rem[1] * Rem[(19-1)!/19]
Rem[2] * Rem[1] * Rem[19-1], by wilson’s theorem
Rem[(2*1*18)/19]
Rem[36/19]
17
Now we removed common term 19 initially
So final answer would be 17*19 = 323