|Technology PoW: Counterfeit Coins|
|Go to:||http://mathforum.org/pows/submission-flow.do?publicationId=3723 (opens a new window)|
|Description:||Find the fewest number of weighings that will identify which of the nine coins is counterfeit. A link to a Java applet from The National Library of Virtual Manipulatives (NLVM) is provided to help students think about the problem.
NOTE: A free login is required. Sign up using the link on the login page, or use your existing KenKen or Problems of the Week login--see this page for details.
|Technology Type:||Java Applet|
|Cost:||Does not require payment for use|
|Average Rating:||||Login to rate this resource|
|My MathTools:||Login to Subscribe / Save This|
|Reviews:||be the first to review this resource|
|Discussions:||start a discussion of this resource|
|Technology PoW:||Monedas Falsas|
|Tool:||Coin Problem (tPoW version)|
|Courses:||Math 5||Logic and set theory|
|Math 6||Logic and set theory|
|Math 7||Logic and set theory|
|Discrete Math||Logical Form & Equivalence|