For non-negative integers a , b , c with their sum of 10, let the triplets ( a 1 , b 1 , c 1 ) , ( a 2 , b 2 , c 2 ) , … , ( a n , b n , c n ) denote the ordered triplets of ( a , b , c ) such that a ! b ! c ! 1 0 ! is an integer.
Find the value of j = 1 ∑ n ( a j ) ! ( b j ) ! ( c j ) ! 1 0 ! .
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.
I believe you mean ( 1 + 1 + 1 ) 1 0 , right?
Log in to reply
Unless I'm mistaken, surely the sum should be a multiple of 10? a,b,c are defined to have a sum of 10, so all possible sets have an individual sum of 10, therefore the value of the expression given is 10*number of ordered triples, which I got to be 36 (without 0s) or 66 (allowing 0s), making the answer 360 or 660 depending on whether 0 is counted as a non-negative integer or not. Please correct me if i'm wrong.
Log in to reply
The content of the problem has changed.
It was the sum of a ! b ! c ! 1 0 ! for a + b + c = 1 0
The solution for the new version is 660.
Problem Loading...
Note Loading...
Set Loading...
From the Mutlinomial formula
for n = 1 and x 1 = x 2 = x 3 = 1
The result is equal to ( 1 + 1 + 1 ) 1 0 = 5 9 0 4 9 .
QED