|
![]() |
|
Into Two Thousand! The number 2000 has 20 divisors, as shown in "Dan's Divisor Chart" at the right. a) What are all (natural) numbers less than 2000 that have at least that many (20) divisors? b) How many divisors does each of those have? c) Which of them has (have) the most divisors? Find as many as you can; partial answers get partial credit. Explain your thinking or give a procedure. |
![]() |
||
| Number |
|
Number |
|
Number |
|
Number |
|
Number |
|
|
|
|
|
|
|
|
|
|
|
| At a carnival game, you see nine paint cans stacked and numbered as shown. You get three throws, and you must knock down one (and only one) can per throw. Your first throw scores the number on that can, the second one counts twice the number on the can, and the third shot counts triple its number. To win a prize you must score exactly 50 points; no more, no less. Describe precisely how you can win the prize. | ![]() |
|
Solution: You can't knock down a trapped can and expect the can(s) above to drop down magically. Since the total is 50, which is even, you need either all even cans, or odd cans on 1st and 3rd because 1*odd and 3*odd are odd, and you need zero or two odds to make 50. But knocking down all evens means 10, 8, 10 (10 + 16 + 30 = 56) or 8, 10, 10 (8 + 20 + 30 = 58), which don't work. So try odd, odd, odd: (you can't); maybe odd, even, odd: only 7, 10, 7 (7 + 20 + 14 = 41) or 7, 10, 9 (7 + 20 + 18 = 45). None of these work, but finally there's 7, 8, 9 (7 + 16 + 27 = 50) -- That's it! %;-} |
|
|






