About Us Contact Us Help


Archives

Contribute

 

For The Mathematically Inclined

Anil Saigal
02/19/2006

FOR CHILDREN

PROBLEM # 1
How many sets of two or more consecutive positive integers have a sum of 15?

FOR GROWNUPS

PROBLEM # 2
A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once?

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

Please send your solutions to anil@lokvani.com.

Use Problem Solutions M-022306 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 02/09/06

FOR CHILDREN

PROBLEM # 1
Ram is 20% older than Shyam, and Shyam is 40% younger than Bhim. The sum of their ages is 23.2 years. How old will Ram be on his next birthday? 

SOLUTION
8 years.

FOR GROWNUPS

PROBLEM # 2
The expression
(x+y+z)^2006 + (x-y-z)^2006
is simplified by expanding it and combining like terms. How many terms are in the simplified expression? 

SOLUTION
1,008,016.

Congratulations to Sandeep Bansal, Aseem Chandawarkar, Manan Domadia, Pankaj Jain, Madhavi Muralidharan, Sarthak Pani, Ameek Ponda, Sanjeev Sharma, Gaurang Vaishnav and Niharika Yerneni 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