|
|||
Archives Contribute
|
Anil Saigal 09/28/2007 FOR CHILDREN PROBLEM # 1 FOR GROWNUPS PROBLEM # 2 ---------------------------------------------------------------------------------------------------------- Please send your solutions to anil@lokvani.com.
------------------------------------------------------------------------------------------------------------- PROBLEM # 1 Solution: Let n denote the smallest positive integer that is divisible by both 4 and 9, and whose base 10 representation consists of only 4's and 9's, with at least one of each. What are the last four digits of n? Solution:
![]() You may also access this article through our web-site http://www.lokvani.com/ |
![]() | ||
Home | About Us | Contact Us | Copyrights Help |