Browse Teasers
Search Teasers

## The Romankachi Clock Problem !!!

Math brain teasers require computations to solve.

 Puzzle ID: #18944 Fun: (2.22) Difficulty: (2.88) Category: Math Submitted By: lesternoronha1

I always remember the days when I was at high school, whiling away my time with my friends. Those were the days when I'd spent the maximum time with my grandfather Rudolf the world-famous Romankachi. He'd come over to our house at one of the weekends leaving behind his Romankachi estate in the village in capable hands. One day when I returned home from school, he put this clock problem in front of me which I was required to solve in the alloted time frame.

Considering time represented in twelve hour format H:M1M2 where H is a single-digit or a two-digit number indicating the hours and M1 and M2 the digits indicating the minutes (M1 representing the tens digit of the minutes and M2 the units digit of the minutes), he wanted me to find out that in a day how such instances would occur so that H is exactly divisible by M1 and gives M2 as quotient?

He further added that if H:M1M2 was the time represented in 24-hour format instead of a 12-hour format, then how many instances were there in a day such that H is exactly divisible by M1 giving M2 as the quotient? In the 24 hour format, 12 o' clock midnight is represented as 00:00.

## What Next?

See another brain teaser just like this one...

Or, just get a random brain teaser

If you become a registered user you can vote on this brain teaser, keep track of
which ones you have seen, and even make your own.