Let be the set containing all the positive digit integers. If I find the product of the digits of each member of and then add all these products together, what will be the remainder when I then divide by ?
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.
For each of the 9 "hundreds" digits, there are 9 non-zero "tens" digits, and for each of these there are 9 non-zero "ones" digits. Since ∑ n = 1 9 n = 4 5 , the sum of all the products of the digits will then be 4 5 3 . Calculating the desired remainder, we observe that
4 5 3 ≡ ( − 4 ) 3 ≡ − 6 4 ≡ 6 m o d 7 .
The desired remainder is thus 6 .