About Us Contact Us Help


Archives

Contribute

 

For The Mathematically Inclined

Anil Saigal
11/19/2020

Problem 1:

6 friends Amit, Bob, Chloe, Devi, Eli, and Farah play a game of numbers.   They start counting from 1 with an increment of 1.  A player who counts a multiple of 7 or number ending 7 drops out of the game.  If they start with Amit then who is the last one remaining?

Problem 2:
The children of the tennis school received 64 white and 48 yellow balls from the sponsor. When asked about how many balls they could take, they were answered: "You have so many that none of you will have more than 10 balls and all will have the same number white and yellow balls. How many children were in the tennis school?


------------------------------------------------------------------------------------
Please send your solutions info@lokvani.com. 

Use Problem Solutions M-11/19/20 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 info@lokvani.com. 

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

---

Problems from M-11/05/20

Problem 1:
A constituency has 5 candidates in an election. During early counting we know that each candidate has got at least 5000 votes.  What is the maximum percentage of votes the winning candidate can get if total number of ballots cast is not more than 1 million. 

Problem 2:
Only two candidates are competing in a tightly contested election.  The leading candidate has received 51% of votes when 80% of ballots were counted.  If 2 million ballots remain to be counted, what is the minimum number of ballots that should be in favor of  the trailing candidate to flip the lead?


Congratulations Ramachandran Balakrishna.



Bookmark and Share |

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




Home | About Us | Contact Us | Copyrights Help