0% found this document useful (0 votes)
256 views56 pages

Best Formulas For Clocks and Calendars

Uploaded by

SadhanaMonga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
256 views56 pages

Best Formulas For Clocks and Calendars

Uploaded by

SadhanaMonga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 56

ost underrated topic in mathematics. But it is important to know that the topic consists multiple level of Questions.

Let us review thoroughly How To Solve LCM and HCF Quickly.

HCFThe highest Common Factor is also known as Greatest Common


divisor i.e. the largest positive integer that divides more than one integer is
called as the greatest common divisor.
LCMLeast Common Multiple is also known as Smallest Common Multiple
i.e. the smallest positive integer that is divisible by more than one integer.

LCM and HCF Formulas


LCM and HCF Formulas
HCF and LCM FormulaProduct of Two numbers = (HCF of the two
numbers) x (LCM of the two numbers)
How to find HCFH.C.F. of Two numbers = Product of Two numbers/L.C.M
of two numbers
How to find LCML.C.M of two numbers = Product of Two numbers/H.C.F.
of Two numbers
HCF by Prime Factorization Method

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

HCF by Division Method

Steps to find the HCF of any given numbers:

1. Larger number/ Smaller Number


2. The divisor of the above step / Remainder
3. The divisor of step 2 / remainder. Keep doing this step till R = 0(Zero).
4. The last step’s divisor will be HCF.
Example:

Let’s take two number 120 and 180

120) 180 (1
120
---------
60) 120 (2
120
---------
000

LCM by Prime Factorization Method

A technique to find the Least Common Multiple (LCM) of a set of numbers by


breaking down each number into its prime factors and then multiplying the highest
powers of each prime factor.

Lets take two numbers i.e., 25 and 35, now to calculate the LCM:

 List the prime factors of each number first.


25 = 5 × 5
35 = 7 × 5

 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

LCM by Division Method

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

Questions and Answers of HCF and LCM

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:

Here the trick is :

1. Find the Differences between numbers


2. Get the HCF ( that differences)
We have here 43, 91 and 183

So differences are

183 – 91 = 92,
183 – 43 = 140,
91 – 43 = 48.

Now, HCF (48, 92 and 140)

 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:

Which of the following is greatest number of four digits which is divisible by


15, 25, 40 and 75 is:

Options

A. 9700
B. 9600
C. 9800
D. 9650

Solution: Greatest number of 4-digits is 9999.

Now , find the L.C.M. of 15, 25, 40 and 75 i.e. 600.

On dividing 9999 by 600, the remainder is 399.

Hence, Required number (9999 – 399) = 9600.

Alternatively,

99996006009999 = 16.66500

Ignore the decimal points, required number would be 16 * 600 = 9600

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

HCF in case of only two numbers:

 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.

How to Solve HCF as well as LCM Questions Quickly

 HCF – It is important to note that HCF of the given numbers cannot be


greater than any one of them.
 LCM – It is important to note that LCM of the given numbers cannot be
smaller than any one of them.
 If 1 is the HCF of 2 numbers, then their LCM will be their product.
 For two co prime numbers, the HCF is always 1.
 The most common methods to solve HCF and LCM easily is
LogType 1: Find the greatest or smallest number.

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

Solution: H.C.F. of (500 cm, 400 cm, 1255 cm) = 5 cm

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

The factors of 1255 are: 1, 5, 251, 1255

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

Solution: We know that, Product of two numbers = H.C.F x L.C.M

70 x a = 10 x 560

Therefore, a = 10×56017517510×560 = 560070705600 = 80

So, the other number = 80

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

Solution: Required number = H.C.F. of (1484 – 4) and (2045 – 5)

H.C.F. of 1480 and 2040

1480 = 2 x 2 x 2 × 5 × 37

2040 = 2 x 2 x 2 × 3 × 5 × 17

H.C.F 1480 & 2040 = 2 x 2 x 2 x 5=40

Correct option: D

Type 2: Find HCF


Question 1. Three numbers are in the ratio of 4: 3: 6 and their L.C.M. are
3600. Find their H.C.F:

Options

A. 350

B. 280

C. 250

D. 300

Solution: Let the numbers be 4x, 3x and 6x

Then, their L.C.M. = (4x * 3x *6x) = 12x

So, 12x = 3600 or x = 300

Therefore, numbers are (4 x 300), (3 x 300) and (6 x 300) = 1200, 900, 1800

Let us do the prime factorization to find HCF

1200=24∗3∗521200=24∗3∗52

900=22∗32∗52900=22∗32∗52

1800=23∗32∗521800=23∗32∗52

Hence, required H.C.F.

=22∗3∗52=300=22∗3∗52=300

Correct option: D

Question 2. Find the HCF of 34, 48, 56, and 74

Options

A. 2

B. 4
C. 34

D. 8

Solution: The factors of 34 are: 1, 2, 17, 34

The factors of 48 are: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

The factors of 56 are: 1, 2, 4, 7, 8, 14, 28, 56

The factors of 74 are: 1, 2, 37, 74

Therefore, the highest common factor is 2.

Correct option:A

Question 3. Find the HCF of 211,417,65.112,174,56.

Options

A. 19359351

B. 29359352

C. 293932

D. 235352

Solution: We know that

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

Solution : Let the numbers be a and b.

Now , given a+b = 55

a × b = HCF × LCM = 5 × 120


HCF × LCM = 600

Now, as we know that 1𝑎+1𝑏=𝑎+𝑏𝑎×𝑏a1+b1=a×ba+b

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

Question : Suppose there are three different containers contain different


quantities of a mixture of milk and water whose measurements are 403 litres,
434 litres and 465 litres What biggest measure must be there to measure all
the different quantities exactly?

Options :

A. 31 litres

B. 21 litres
C. 41 litres

D. 30 litres

Solution : Prime factorization of 403,434 and 465 is

403=13×31

434=2×7×31

465=3×5×31

H.C.F of 403, 434 and 465=31

Correct Option : A

Type 5 : How to Solve 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

Solution : L.C.M. of 2, 4, 6, 8, 10, 12 is 120.

Hence, the bells will toll together after every 120 seconds(2 minutes).

Therefore, in 30 minutes ,number of times bells toll together is 302+1230+1 = 16


(We added 1 because in starting i.e. 0 mins all the bells would ring once together)
Correct Option B

Type 6 : How to Solve HCF, LCM Problems related to Circle Based Runner
Problem.

Question: Two people P and Q start running towards a circular track of


length 400 m in opposite directions with initial speeds of 10 m/s and 40 m/s
respectively. Whenever they meet, P’s speed doubles and Q’s speed halves.
After what time from the start will they meet for the third time?

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.

Time taken to meet for the 2nd time= 40020+2020+20400 = 10 sec.

Now P’s speed =40 m/sec and Q’s speed = 10 m/sec.

Time taken to meet for the 3rd time= 40010+4010+40400=8 sec.

Therefore, Total time= (8+10+8) = 26 seconds.

Correct Option B

HCF and LCM tricks


HCF is the greatest common divisor of more than one integer. Hence, the
largest positive integer that divides more than one integer is known as the
Highest common factor. LCM is the least common multiple of two or more
integers. Let us move forward and look up some of the Tips and Tricks Of
HCF and LCM.
Here, are some easy tips and tricks for you to solve HCF and LCM questions
quickly, easily , and efficiently in competitive exams.

HCF and LCM Tips and Tricks and Shortcuts

 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

Prime Course Trailer


Type 1: Tips and Tricks and Shortcuts to find the greatest or smallest number

Question 1. Find the greatest 5 digit number divisible by 5, 15, 20, and 25

Options

A. 99900

B. 99000

C. 99990

D. 90990

Solution: LCM of 5, 15, 20, and 25 is 300

The greatest 5 digit number is 99999

9999930030099999 = 333.33

Therefore, the highest 5 digit number divisible by 300 would be 333 * 300 = 99900

Correct option: A

Type 2: Find the numbers, sum of numbers, product of numbers if

 Their ratio and H.C.F. are given.


 Product of H.C.F. and L.C.M are given

Question 2. The product of two numbers is 3888. If the H.C.F. of these


numbers is 36, then the greater number is:

Options

A. 110

B. 108

C. 36

D. 120
Solution: Let the two numbers be 36x and 36y

Now, 36x * 36y = 3888

xy =388836×3636×363888

xy = 3

Now, co-primes with product 3 are (1, 3).

Therefore, the required numbers are 36 * 1 = 36

36 * 3 = 108

Therefore the greatest number is 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

Solution : Let the numbers be a and b.

Now , given a+b = 60

a × b = HCF × LCM = 5 × 100

= 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

Question : Suppose there are three different containers contain different


quantities of a mixture of Sugar and rice whose measurements are 403
grams, 434 grams and 465 grams What biggest measure must be there to
measure all the different quantities exactly?

Options :

A. 31 grams

B. 21 grams

C. 41 grams

D. 30 litres

Solution : Prime factorization of 403, 434 and 465 is

403=13×31

434=2×7×31

465=3×5×31

H.C.F of 403, 434 and 465=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

Solution : L.C.M. of 2, 4, 6, 8, 10, 12 is 120.

Hence, the bells will toll together after every 120 seconds(2 minutes).

Therefore, in 30 minutes ,number of times bells toll together is 302+1230+1 = 16

Correct Option B

Type 6 : Tips , tricks and Shortcuts of HCF, LCM Problems related to Circle
Based Runner Problem.

Question: Two people P and Q start running towards a circular track of


length 400 m in opposite directions with initial speeds of 10 m/s and 40 m/s
respectively. Whenever they meet, P’s speed doubles and Q’s speed halves.
After what time from the start will they meet for the third time?

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.

Time taken to meet for the 2nd time= 40020+2020+20400 = 10 sec.

Now P’s speed =40 m/sec and Q’s speed = 10 m/sec.

Time taken to meet for the 3rd time= 40010+4010+40400=8 sec.

Therefore, Total time= (8+10+8) = 26 seconds.

Correct Option B

Tips and Tricks and Shortcuts to find HCF easily

Question. 3 Find HCF of 12 and 16.

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

Question. 4 Find HCF of 18 and 22.

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.

Hence, the HCF is 2.

Note: If there are more than two numbers, take the least difference.

Correct Option(A)

Tips and Tricks and Shortcuts to find LCM easily

Question 5 Find LCM of 2,4,8,16.

Options

(A) 16

(B) 18

(C) 12

(D) 2

Solution Factorize of above numbe

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.

Correct Option (A)


Question 6 Find the LCM of 2,3,7,21.

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.

Correct Option (D)

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

Logarithm Questions and Answers

Common Logarithm and Natural Logarithm:

 Common logarithm has base 10 ($b = 10$) and is denoted as $\log(x)$,


while natural logarithm has base $e$ (Euler’s number) and is denoted as $\
ln(x)$.
Logarithm Rules:
 Product Rule: 𝑙𝑜𝑔𝑏(𝑥𝑦)=𝑙𝑜𝑔𝑏(𝑥)+𝑙𝑜𝑔𝑏(𝑦)logb(xy)=logb(x)+logb(y)
 Quotient Rule: 𝑙𝑜𝑔𝑏(𝑥𝑦)=𝑙𝑜𝑔𝑏(𝑥)−𝑙𝑜𝑔𝑏(𝑦)logb(yx)=logb(x)−logb(y)
 Power Rule: 𝑙𝑜𝑔𝑏(𝑥)𝑛=𝑛𝑙𝑜𝑔𝑏(𝑥)logb(x)n=nlogb(x)
A logarithm denote as the contradictory of power. In other terms, if we go for
a logarithm of a particular value, we unknot exponentiation. Logarithm
Questions and Answers are discussed below:

For instance: If the base is taken as b = 3 and increase it to the power of k = 2 we


get the result as 32. The result is referred as c, showed by 32 = C. The rules of
exponentiation can be used to evaluate that the result is C =32 = 8.

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

Both the equations define the similar link where:


‘b’ is considered as the base,
c is considered as the exponent
a is considered as the argument
Best Formulas for Clocks and Calendars

We will be discussing Clocks and Calendar Formulas to help student with


variety of formulas that they can use to solve several type of Questions. Here on
this page you will get useful key points and formulas for solving Combined
Questions of Clock and Calendar.

Clock and Calendar Questions Solving:Solving clock and calendar


questions sharpens logical thinking, enhances time management skills, and
boosts problem-solving abilities. It offers practical insights into
understanding time relationships, scheduling events accurately, and
interpreting calendars effectively, all of which are valuable in everyday life,
business, and various fields that require precise timing and planning.
Clock

Minute Spaces:The face or dial of clock is a circle whose circumference is


divided into 60 equal parts, named minute spaces.
Hour hand and Minute Hand:The smaller hand of a clock is called the hour
hand or shorthand and the larger hand ( instead of one ) is called the
minute hand or long hand.
Calendar

Ordinary & Leap Year:

 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.

Calendar Questions and Answers


Calendar Questions

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.

About Calender:Basically, there are 365 days in an ordinary year, which


means 52*7+1 day or 52 weeks plus one day per year. This concept is
applicable only for years excluding the leap year.
Facts About Calendar:The word calendar comes from 'calendae' , the word
used for the first day of the month in the Roman calendar, related to the
verb calare means "to call out" , referring to the "calling" of the new moon
when it was first seen.
Formula or Rule for solving CALENDAR questions

 100 years give us 5 odd days


 200 years give us 5 x 2 = 10 – 7 (one week) = 3 odd days.
 300 years have 5 x 3 = 15 – 14 (two weeks) =1 odd day.
 400 years have [{5 x 4 + 1 (leap century)} – 21] (three weeks)= 0 odd days.
 January has 31 – 28 = 3 odd days.
 February has 28 – 28 = 0 odd day in a typical year and 1 odd day in a leap
year and so on for all the other months.
Concept of Odd Days:Whenever we are asked to find out a day of the week
on a specific date, we use the concept of 'odd days'. Odd days may be
defined as the number of days more than whole weeks.
Leap Year:If it is not a century, then each year divided by four is a leap
year. One point also to be noted here is that leap year comes in every 4’th
century.
Points To Remember:

 Leap year rule:

o A year is a leap year if it is divisible by 4.


o However, if a year is divisible by 100, it is not a leap year unless it is
also divisible by 400.
o For example, the year 2000 was a leap year because it is divisible by
both 4 and 400.
 Odd days:

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:

o The doomsday rule is a mental calculation technique to find the day of


the week for any date in a given year.
o It is based on a set of anchor days for each century (e.g., 1800, 1900,
2000) and applying simple arithmetic to find the day of the week.
oWith practice, this rule can be used to quickly determine the day of
the week for any date.
Best Tips , Tricks and Shortcuts on Calendar in Aptitude.

 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).

 In an ordinary year, there are 365 days, which means 52 x 7 + 1, or 52 weeks


and one day.
 Here, are easy tricks and tips on Calendar problems Learn tricks on calendar.
 There are 3 types of questions asked in exams
Type 1: Calendar Tips and Tricks- To find the day of given date
Question 1. What was the day on 27th May 2006?
Options:
A. Monday
B. Saturday
C. Sunday
D. Friday
Solution: 27th May, 2006 = (2005 years + Period from 1.1.2006 to
27.5.2006)
To calculate number of odd days till 2000, we need
Number of odd days in 1600 years = 0
Number of odd days in 400 years = 0
Now, for calculating odd days in the next five years,
5 years = (4 ordinary years +1 leap year) = (4+2)
= 6 odd days
Now to calculate number of odd days from 1st January 2006 to 27th May
2006
January (31 days) + February (28 days because 2006 is an ordinary year) +
March (31 days) + (April 30 days) + May 27 days = 147 days
Total number of odd days in 147 days = ((147/7) = 21 weeks+ 0 odd days
Total number of odd days in the entire period = 0 (1600 years) + 0 (400
years) + 6 (5 years) + 0 (Period from 1.1.2006 to 27.5.2006) = 6 odd days
As per the table, on 27th May 2006 the day was Saturday.
Da Sund Mon Tues Wednes Thurs Frid Satur
ys ay day day day day ay day
No 0 1 2 3 4 5 6
. of
Od
d
Da
ys
 Correct option: B

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

Solution: 2006 was an ordinary year.

Therefore the number of odd days in 2006 was = 1

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.

About CalendarCalendar is a method of organizing the days in a year. The


calendar starts on 1st January and ends on 31st December. The year is
classified into two types: ordinary years (365 days) and leap years (366
days).In an ordinary year, there are 365 days, which means 52 x 7 + 1, or
52 weeks and one day.

Calendar Formulas & Definitions


 A calendar is a method for systematically organizing days for religious,
social, commercial or administrative purposes.It is done by giving names to
periods of time, such as days, weeks, months and years.
 A date is single, specific day within such a system
 The year is classified into two type:

1.
1. Ordinary years (365 days)
2. Leap year (366 days.)z

 The calendar starts on 1st January and ends on 31st December.


Calendar Formulas for Odd days

 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

14 days = 2 weeks (14 days) + 0 day (0 odd day).

Formulas of Calendar For Number of Odd Days

 1 ordinary year has 1 odd day


Explanation : In an ordinary year, there are 365 days, which means 52 x 7 + 1, or
52 weeks and one day. This additional day is called an odd day.

 1 leap year has 2 odd days


Explanation: A leap year has 366 days. There are 29 days in February in a leap
year. There are 52 weeks and 2 odd days in a leap year.

 100 years has 5 odd days


Expalnation : Odd days in a leap year = (52 weeks +2) days .In 100 years , there
will be 24 leap years and 76 non-leap years. So odd days in 100 years will be (76 x
1 + 24 x 2) which is 124 odd days. This can also be written as 17 weeks + 5 days.
So every 100 years will have 5 odd days.

 200 years has 3 odd days


Expalnation: 100 years give us 5 odd days as calculated above. 200 years give us
5 x 2 = 10 .Hence , 7 days (one week) = 3 odd days.
 300 years has 1 odd day
Expalnation: 300 years give us 5 x 3 = 15.Hence, 14 days (two weeks) = 1 odd
day.

 400 years has 0 odd day


Expalnation: The number of odd days in 400 years will be ( 5 x 4 + 1) because
400 is itself a leap year and that is why it has one odd day extra. Thus odd days in
400 will be 0.

 Similarly, all the 4th centuries 800 years, 1200 years, 1600 years, 2000
years etc. have 0 odd day.

 Mapping of the number of odd day to the day of the week


Da Sund Mond Tuesd Wednes Thurs Frid Satur
ys ay ay ay day day ay day
No. 0 1 2 3 4 5 6
of
Od
d
Da
ys

Reference Chart that gives odd days for the given months

 To determine whether a year is a leap year, follow these steps:

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 2016 is a leap year because it is divisible by 4.

2. Now, check for years ending with “00”.

Year 2000 is a leap year because it is divisible by 4,100 and 400.

Year 1900 is not a leap year because it is divisible by 4 and 100 but not 400.

Year 1600 is a leap year because it is divisible by 4, 100, and 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

 Last day of a century cannot be Tuesday or Thursday or Saturday because of


the number of odd days.
 For the calendars of two different years to be the same, the following
conditions must be satisfied.
a. Both years must be of the same type. i.e., both years must be ordinary
years or both years must be leap years.

b. 1stJanuary of both the years must be the same day of the week.

Sample Calendar Questions with Solution

Question:1 How many odd days are there in 3000 days?

Solution:
To find the number of odd days in 3000 days, divide 3000 by 7 (the number of
days in a week)

= 3000 ÷ 7 = 428 with a remainder of 4

So, there are 428 weeks with no odd days and 4 odd days remaining.

Therefore, the number of odd days in 3000 days is 4.

Question: 2 Is the year 2100 a leap year?

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

Step 1: Check if it is divisible by 4. 2100 ÷ 4 = 525 with no remainder. So, it is


divisible by 4.

Step 2: Check if it is divisible by 100. 2100 ÷ 100 = 21 with no remainder. So, it is


divisible by 100.

Step 3: Check if it is divisible by 400. 2100 ÷ 400 = 5 with no remainder. So, it is


divisible by 400.

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.

Number of days from February 15th to February 29th = 29 – 15 + 1 = 15 days

Number of days from March 1st to August 31st (inclusive) = 31 + 30 + 31 + 30 +


31 + 31 = 184 days

Number of days from September 1st to September 10th = 10 days

Total days = 15 + 184 + 10 = 209 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.

10 ÷ 7 = 1 week with a remainder of 3 days.

Counting forward 3 days from Sunday, we determine the day of the week.
Get Pr

m
e
Important Observations and Formulas of Clock :

 A clock is a complete circle having 360 degrees. It is divided into 12 equal


parts i.e. each part:
36012=3012360=30
 As the minute hand takes a complete round in one hour it covers 360
degrees in 60 min.
Minute Hand covers 36060=6𝑑𝑒𝑔𝑟𝑒𝑒𝑚𝑖𝑛𝑢𝑡𝑒60360=6minutedegree
 Also, as the hour hand covers just one part out of the given 12 parts in one
hour, this implies
Hour Hand covers 300 in 60 min. i.e. 1/2 degree per minute.
 Therefore, the relative speed of the minute hand is 6–12=512𝑑𝑒𝑔𝑟𝑒𝑒𝑠6–
21=521degrees
 Every hour, both the hands coincide once. In 12 hours, they will coincide 11
times.
It happens due to only one such incident between 12 and 1’o clock.
 The hands are in the same straight line when they are coincident or opposite
to each other.
 When the two hands are at a right angle, they are 15-minute spaces apart.
 In one hour, they will form two right angles and in 12 hours there are only
22 right angles. It happens due to right angles formed by the minute and
hour hand at 3’o clock and 9’o clock.
 When the hands are in opposite directions, they are 30-minute spaces apart.
 If a clock indicates 9.15, when the correct time is 9, it is said to be 15
minutes too fast. On the other hand, if it indicates 8.45, when the correct
time is 9, it is said to be 15 minutes too slow.
 If both the hour hand and minute hand move at their normal speeds, then
both the hands meet after 65511𝑚𝑖𝑛𝑢𝑡𝑒𝑠65115minutes.
 22 times in a day, the hands of a clock will be in a straight line but opposite
in direction.
 44 times in a day, the hands of a clock will be straight.
 44 times in a day, the hands of a clock are at right angles.
 22 times in a day, the hands of a clock coincide.
Formula For Clocks 1:When the minute hand is behind the hour hand, the
angle between the two hands at M minutes past H 'o clock will be:
30(𝐻−𝑀5)+𝑀2𝑑𝑒𝑔𝑟𝑒𝑒30(H−5M)+2Mdegree
Formula For Clocks 2:When the minute hand is ahead of the hour hand,
the angle between the two hands at M minutes past H 'o clock will be:
30(𝐻−𝑀5)−𝑀2𝑑𝑒𝑔𝑟𝑒𝑒30(H−5M)−2Mdegree
Important Observations and Formulas for Calendars:

 A leap year has 366 days


 Every year divisible by 4 is a leap year, if it is not a century.
 Every 4th century is a leap year and no other century is a leap year.
 Counting odd days
1 ordinary year ≡ 365 days ≡ (52 weeks + 1 day)
Hence number of odd days in 1 ordinary year= 1.
1 leap year = 366 days = (52 weeks + 2 days)
Hence number of odd days in 1 leap year= 2.
100 years = (76 ordinary years + 24 leap years)
= (76 x 1 + 24 x 2) odd days
= 124 odd days.
= (17 weeks + 5 days)
= 5 odd days.
Hence number of odd days in 100 years = 5.
Number of odd days in 200 years = (5 x 2) = 10 = 3 odd days
Sample Clock and Calendar Questions with Solution

Question: 1 If your birthday falls on the third Monday of September 2023, on


what date will your birthday fall in 2027?

Solution:

In 2023, September 1st is a Friday

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)

Adding 14 days (2 weeks) to Wednesday, we get Wednesday + 14 = Thursday

So, your birthday in 2027 will fall on a Thursday

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:

From 3 o’clock in the afternoon to 8 o’clock at night is a total of 5 hours.

Since standard clock, the hour hand completes 360°- in 12 hours.

So in 1 hour, it moves 360° / 12 hours = 30° per hour.

Now, for 5 hours:


Degrees rotated by the hour hand = 5 hours × 30° per hour = 150°

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 is a non-leap year.


To find a year with the same calendar, we need to look for a year that is 11 years
after 2015

2015 + 11 = 2026

Therefore, the calendar for the year 2026 will be the same as the calendar for the
year 2015

Question: 4 Thomas Miller, a curious individual, approaches his mathematics


teacher with a question regarding the day on which the 1st of the month will
occur, given that the 9th of the month falls on the day just before Sunday.

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]

where r is remainder when x divided by 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.

We didn’t do 2 power 29 as it would have taken additional steps and would’ve


been lengthy

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

 Rem[(30*31*32)/7] = Rem[30/7] * Rem[31/7] * Rem[32/7]

 Rem[2] * Rem[3] * Rem[4]

 Rem[2*3*4] => Rem[24/7]

 3

Rule 2

Rem[(a+b+c)/d] = Rem[a/d] + Rem[b/d] + Rem[c/d]

Example

 Rem[(30+31+32)/7] = Rem[30/7] + Rem[31/7] + Rem[32/7]


 Rem[2] + Rem[3] + Rem[4]
 Rem[2+3+4] => Rem[9/7]
 2
Applications of above rules

Rem[(3030)/7]

Solution

 Rem[(3030)/7] = Rem[(30)/7] * Rem[(30)/7] * Rem[(30)/7] * Rem[(30)/7]


…….. (30 times)
 Rem[(3030)/7] = 2 * 2 * 2 ….. (30 times) = 230
 Rem[(3030)/7] = 230 = (26)5= (64)5
 Rem[(3030)/7] = Rem[64/7])5 => 15
 Rem[(3030)/7] = 1
Rem[(303132)/7]

Solution
 Rem[(303132)/7] = Rem[(23132)/7] (as Rem[30/7] = 2)
Hypothesis

1. We know, 23 will give us remainder 1 when divided by 7 (Rem[8/7] = 1)


2. Thus, for any K > 0, 23K will also give us remainder 1 when divided by 7
Futhemore,

1. 23K+1 will give us remainder 2


1. 23K+1 can be written as (23K)*2 => Rem[23K/7] * 2
2. 1* 2 = 2
Similarly,

1. 23K+2 will give us remainder 4


1. 23K+2 can be written as (23K)*2*2 => Rem[23K/7] * 2 * 2
2. 1* 2 * 2 = 4
Now, we need to write 3132 in 3K, 3K + 1, 3K + 2 format by doing follows –

 Rem[3132/3] = Rem[132/3] = 1
Thus, can be written in format 3k+1

 Rem[(303132)/7] = Rem[(23132)/7] = Rem[(23K+1)/7] = 2


Thus, the remainder will be 2

Common Factor

Rem[X/Y] = Rem[kx/ky] = k *resultOf(Rem[x/y])

Example

 Rem[(415)/28] = Rem[(4*414)/(4*7)] = 4* Rem[(414)/(7)]


 4 * resultOf(Rem[(4*4*412)/(7)])
 4 * resultOf(Rem[(4)/(7)] * Rem[(4)/(7)] * Rem[(412)/(7)])
 4 * resultOf(4 *4 * Rem[(644)/(7)])
 4 * resultOf(4 *4 * Rem[(14)/(7)])
 4 * resultOf(Rem[(4*4*1)/7])
 4 * resultOf(Rem[(16)/7])
 4 * resultOf(2])
 8
Example

 Rem[(516)/35] = Rem[(5*515)/(5*7)] = 5* Rem[(515)/(7)]


5
 5 * resultOf(Rem[(125 )/(7)])
5
 5 * resultOf(Rem[(6 )/(7)])
 5 * resultOf(Rem[(6*36*36)/(7)])
 5 * resultOf(Rem[(6)/(7)] * Rem[(36)/(7)] * Rem[(36)/(7)])
 5 * resultOf(6 *1 * 1)
 30
Co Primes

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)]

HCF(a, b) = 1 (then only these are co-primes)

Let, Rem[M/a] = r1 & Rem[M/b] = r2

Rem[M/N] = axr2 + byr1

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 ?

We can observe a pattern for remainders when divided by 5.

 (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

 axr2 + byr1 = 3*x*3 + 5*y*1


Such that, ax + by = 1 | 3x + 5y = 1

Valid values are x = -3 and y = 2

Thus final answer will be: 3*(-3)*3 + 5*2*1 = – 27 + 10 = 17

Fermat Theorem

If p is a prime, and HCF (a, p) = 1 (a and p are co-primes), then Rem[ap-1/p] = 1

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.

Let us first learn How to find Euler Number ϕ(Q) ?

ϕ(Q) = Q (1 – 1/a) (1 – 1/b) (1 – 1/c)……………. ,

where Q = { al x bm x cn } and a, b & c are prime factors of Q.

Example : Euler’s Number for 36, i.e ϕ(36)

33 can be prime factorised as { 22 x 32 } which means a = 2 and b = 3


 ϕ(36) = 36 (1 – 1/a) (1 – 1/b) (Using Formula)
 ϕ(36) = 36 (1 – 1/2) (1 – 1/3) , since a = 2 and b = 3
 ϕ(36) = 12
Example 1 Using Euler’s Theorem

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

Find the remainder when 40! is divided by 41?

Rem[40!/41]
 Rem[ (41-1)! / 41]
 Here P = 41 is a prime number.
 So Rem[ (41-1)! / 41] = (41 – 1) = 40
Example 2

Find the remainder when 45! is divided by 47?

Rem[45!/47]
 Rem[ (47-2)! / 47]
 Here P = 47 is a prime number.
 So Rem[ (47-2)! / 47] = 1
Example 3

Find the remainder when 21! is divided by 361?

 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

You might also like