Suppose that a set consists of all the possible four digit number combinations of the digits 3, 4, 5, 6, and 7. Given that there are no repetitions of the digits in any given number, what is the sum of all such number combinations.
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.
there are 5x4x3x2 nos. we have to find their sum.
it is for a four digit no.,
1111 . (sum of digits) . (no. of times a digit occurs in one place)
putting values:
1111 x 25 x 24 = 666600.
[the formula above is derived from the carry method in which we find the unit digit and carry the remaining to tens place in which we primarily see sum of digits x no. of times it occurs...] {a direct formula derived :) }