About Us Contact Us Help


Archives

Contribute

 

For The Mathematically Inclined

Anil Saigal
05/27/2006

FOR CHILDREN

PROBLEM # 1
Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is 1/29 of the the original integer.

FOR GROWNUPS

PROBLEM # 2
Let N be the number of consecutive 0's at the right end of the decimal representation of the product 1!2!3!4!....99!100!. Find the remainder when N is divided by 1000.

-------------------------------------------------------------------------------------------------------------

Please send your solutions to anil@lokvani.com.

Use Problem Solutions M-060106 as the subject line. Please include your full name in the text of the main message. Everyone with the right answer will be acknowledged in the next issue of Lokvani.

Please do not post your solution in Post Comments. No credit will be given for solutions not sent to anil@lokvani.com.

If you need clarification on any problem, please contact anil@lokvani.com.

-------------------------------------------------------------------------------------------------------------

SOLUTIONS TO PROBLEMS ON 05/18/06

FOR CHILDREN

PROBLEM # 1
A planet has two moons. One moon rotates about the planet in 32 days while the other moon rotates in 44 days. If  both moons are full tonight, how long will it be before they are both full moons again?

SOLUTION
352/3 days.

FOR GROWNUPS

PROBLEM # 2
My grandson is about as many days as my son is weeks, and my grandson is as many months as I am in years. My grandson, my son and I together are 140  years. Can you tell me my age in years?"

SOLUTION
84 years.

Congratulations to Virinchi Balabhadrapatruni, Sandeep Bansal, Sitaram Chandawarkar, Chitra Dalal, Nariman Deboo, Ruby Dhillon, Manan Domadia, Neha Iyer, Mukkai Krishnamoorthy, Sarthak Pani, Sreenivasa Rao, Harsh Sanchorawala and Sai Tenneti, who were winners of the last set of puzzles.



Bookmark and Share |

You may also access this article through our web-site http://www.lokvani.com/




Home | About Us | Contact Us | Copyrights Help