GUG8BSMlGfYiGUd7TpCpTpYpBA==

Odd Days

Odd Days

Odd days are part of the reasoning and candidates have to solve it to increase their mental ability. Odd days' reasoning will increase their logical thinking capabilities.


Odd days reasoning can be done based on the clock and calendar problems. In the odd days reasoning based on the calendar, odd days can be calculated if the quantity of days is more than the complete weeks such as Leap year. Not every century is a leap year. This reasoning can be based on the clocks and it needs not only logical ability but also mathematical ability. Candidates should know the structure of the clock and the angle between the divisions. 

Concept of odd days reasoning

In the odd days reasoning, times need to be calculated and candidates have to find the odd days that are not normal counting. For example, not every century is a leap year. If one can divide the year by 4 then it is a leap year and if cannot then it is not a leap year. 

Types of odd days reasoning

Odd days reasoning can be called calendar reasoning. There are different types of odd days reasoning. Such as: 

Counting odd days

In this section, candidates are generally asked to find out weeks, days, or months. Odd days indicate those extra days, which cannot complete a week. Therefore, to find out the odd day in a week, candidates have to divide the particular number by 7 until there is a remainder less than 7. For example, it can be asked “How many odd days in 1000 years?” and the answer will be 200 by subtracting the year with the nearest century year.

Find reference date

Candidates are given a particular day and date based on that they are asked to find the day on the given date. For example, candidates can find out the answer of- “If today is Monday, what day will be 128 days after today?” and the answer will be Wednesday. In the 128 days, there are 18 weeks+2days and these 2 days are odd days and Wednesday comes after Monday. The answer will be Wednesday. 

Without reference date

In this type of reasoning, candidates are asked to find the day based on the date. For example, they can be asked “What was the day on 15th august 1950?”. 

Repetition

In this type, a year or month can be given to the candidate and needs to find the month or year that contains the same calendar. For example, the question can be “find the year that has the same  calendar year as the year 2002?”   

Way to calculate odd days reasoning

Some calculations should be remembered to solve odd days’ reasoning. Such as:

1 year = 365 days (52 weeks+1 day). This 1 day is odd

“1 jump year =366 days (52 weeks+2 days)”. These 2 days are odd.

“100 years =76 normal years +24 jump years. (76*1+24*2) odd days =124 odd days (17 weeks +5 days) = 5 odd days”

Similarly, in the clock reasoning candidates should know the count of the hour, minute, and second. There are different types of clock reasoning such as reflection of the clock, angle-based clock, and defective clock.

Odd days reasoning questions

There are some Odd days reasoning questions to give a clear sight about the odd days reasoning. These are:

“Jan 2, 2007, was Tuesday. What will be the day on January 2, 2008?”. The answer will be Wednesday

“What was the day on 10th August 1947?”. The answer will be Tuesday

Based on the clock reasoning, here are some questions:

“If the hands of the clock are inclined at 15 minutes past 5, then what is the angle of the hands?”

“The reflex angle between the hands of the clock at 10:25 AM ”

Candidates have to remember the count of hours, minutes, and seconds. Besides this, they have to calculate the angle based on the given time and it will be calculated according to the position of the hand.

Conclusion

Odd days’ reasoning is the part of the logical reasoning process that can improve logical thinking and mental ability. Different types of logical reasoning can be helpful to solve different types of problems. Candidates can enhance their knowledge in different areas such as logical reasoning and mathematical ability.

Type above and press Enter to search.