Supposing that the no. of dots on each half of a domino can go from 0 to n where n can be any integer, calculate a formula for the number of dots in a complete set of dominoes.
Each domino consists of every possible combination for the tow halves of a domino. From double 0 to double n
x Turn on thread page Beta
Dominoes Dots watch
- Thread Starter
- 28-01-2010 23:23
- Study Helper
- 29-01-2010 10:12
I'd start by considering each half separately, then how they combine to make one dominoe, and what duplication there will be, and how you'd need to reduce the number you've got. Have a go!