| Technology PoW: Counterfeit Coins | |||
| Go to: | http://mathforum.org/tpow/index2.ehtml?puzzle=206 (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.
Students are invited to use the link "Submit your answer" to share their solutions, and then "self-mentor" using specially designed hints, checks, and suggestions for extensions. Spanish version also available |
||
| Technology Type: | Java Applet | ||
| Author: | Claire Mead | ||
| Language: | English | ||
| Cost: | Does not require payment for use | ||
| Average Rating: |
 [0]
|
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 | ||
|
| |||