|
| 03 Dec 2012 02:50 PM |
five disks numbered 1 2 4 8 and 16 are placed in a bag three disks are withdrawn
from the bag the sum of their numbers is recorded and the three disks are then
returned to the bag suppose this process is repeated indefinitely what is the largest
number of different sums that can be recorded? |
|
|
| Report Abuse |
|
|
|
| 03 Dec 2012 02:52 PM |
| jeez thanks for the help :-( |
|
|
| Report Abuse |
|
|
|
| 03 Dec 2012 03:01 PM |
So how many different combinations of three disks could be drawn from a pool of 5?
I don't remember how to do this- Just give me a second... |
|
|
| Report Abuse |
|
|
| |
|
|
| 03 Dec 2012 03:09 PM |
Based on a theorem I made just now that may or may not be accurate: 20
|
|
|
| Report Abuse |
|
|
| |
|
|
| 03 Dec 2012 03:11 PM |
@hex Answer*
~HOH SIS, WE GOT THE JOJ |
|
|
| Report Abuse |
|
|
|
| 03 Dec 2012 03:14 PM |
1 2 4 1 2 8 1 2 16 1 4 8 1 4 16 1 8 16 2 4 16 2 4 8 2 8 16 4 8 16
By golly, it does seem to be ten. |
|
|
| Report Abuse |
|
|
|
| 03 Dec 2012 05:27 PM |
| aaaa i need a legit way to solve and an answer |
|
|
| Report Abuse |
|
|
|
| 03 Dec 2012 05:28 PM |
| are you sure thats right because this is the last grade and my final impression for this trimester |
|
|
| Report Abuse |
|
|
| |
|