1 / 1

STM Numeracy Problem of the Week November 28 th – December 4 th 2013

STM Numeracy Problem of the Week November 28 th – December 4 th 2013. Change Adds Up

junior
Download Presentation

STM Numeracy Problem of the Week November 28 th – December 4 th 2013

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. STM Numeracy Problem of the WeekNovember 28th – December 4th 2013 Change Adds Up In a jar I have a collection of 30 coins consisting of five pennies (one cent coins), five nickels (five cent coins), five quarters (twenty-five cent coins), five loonies (one dollar coins worth one hundred cents each) and five toonies (two dollar coins worth two hundred cents each). I need exactly five dollars. Without looking, I reach into my coin jar and take out a handful of coins. I take out anywhere from one coin (a very small handful) to all thirty coins (quite a fistful of coins). What is the largest sum of money I can remove from the jar so that I am not able to create exactly five dollars? For example, if I remove all thirty coins I can easily create five dollars using two of the toonies and one of the loonies. But if I remove only three toonies and three quarters, although I have pulled out more than five dollars, no matter how I combine these coins I cannot create exactly five dollars from them. Submit your answers by Wednesday @ 3pm in the Learning Commons or Room 219

More Related