A double-6 set of dominoes consists of 28 dominoes with 168 dots in total, as shown.
Now, if this pattern is continued all the way to double-250 dominoes, how many dots are there in total?
image: Wikipedia
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Every for any set of double-n dominoes each number appears n + 2 times, once paired with each number 0 through n plus one more for the double.
So the total is 0 ( n + 2 ) + 1 ( n + 2 ) + 2 ( n + 2 ) + 3 ( n + 2 ) + . . . + n ( n + 2 )
Refactor as ( 0 + 1 + 2 + 3 + . . . + n ) ( n + 2 ) = 2 n ( n + 1 ) × ( n + 2 )
So the formula for the number of dots is n ( n + 1 ) ( n + 2 ) / 2
As so the number of dots on a double-250 set is 2 5 0 × 2 5 1 × 2 5 2 / 2 = 7 9 0 6 5 0 0
The number of dominoes is equal to adding up the integers from 1 to 250.
1 + 2 + 3 + 4 . . . + 2 5 0
a simple way to do this is using the formula:
S = 2 n ( n + 1 ) where S is the total and n is the number of terms.
with n= 250 we get:
S = 2 2 5 0 ∗ 2 5 1
S = 2 6 2 7 5 0
S = 3 1 3 7 5
To find the number of dots we use the equation:
Total number of dots = number of dominoes * the amount of each number
Total number of dots = 31375 * 252 = 7 9 0 6 5 0 0
Problem Loading...
Note Loading...
Set Loading...
Let the total number of dots of double-n dominoes be N ( n ) , then from the arrangement shown for double-6 dominoes, we have:
N ( n ) = j = 0 ∑ n k = 0 ∑ j ( j + k ) = j = 0 ∑ n ( j ( j + 1 ) + 2 j ( j + 1 ) ) = 2 3 j = 0 ∑ n ( j 2 + j ) = 2 3 ( 6 n ( n + 1 ) ( 2 n + 1 ) + 2 n ( n + 1 ) ) = 1 2 3 n ( n + 1 ) ( 2 n + 1 + 3 ) = 2 n ( n + 1 ) ( n + 2 ) Note that N ( 6 ) = 1 6 8
Therefore, N ( 2 5 0 ) = 2 2 5 0 ( 2 5 1 ) ( 2 5 2 ) = 7 9 0 6 5 0 0 .