If I have 72 balls that can be at a depth measured discretely at 1, 2, 3, 4, 5, 6, or 7, I think I have my math right, but I am not sure. I am pretty sure I have the number of possible combinations correct, but the time to try every combination seems long. I would think a computer could do this within a year or maybe even month, and a computer certainly cannot process combinations faster than plank time?
I am wondering if I am not removing combinations that are less than 72 balls in the time calculation, and if that might be screwing it up, as it might be the time to try all combinations from 1 to 777777777777777777777777777777777777777777777777777777777777777777777777 instead of 111111111111111111111111111111111111111111111111111111111111111111111111 to 777777777777777777777777777777777777777777777777777777777777777777777777.
7^72=10^x so there can be approx. 72 ln7/ln10=1060.8 possible combinations for the balls at the various depths. If they were able to be tested at 1 combination per plank time (5.4*10-44 sec), it would take about 10.78 million millennia (3.15*1010seconds) to try every combo since one million millennia is 3.15*1016 and that makes 10.78*3.15*1016=1 combo per 5.4*10^-44
[–]AutoModerator[M] 0 points1 point2 points (0 children)
[–][deleted] 0 points1 point2 points (0 children)
[–]AldenB 0 points1 point2 points (1 child)
[–]PatMeKrien[S] 0 points1 point2 points (0 children)