Let . Let be the number of element subsets of such that is divisible by . Find the value of (Here denotes the greatest integer less than or equal to .)
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.
We can directly see
Also we note that a b is divisible by 6 if and only if one of the following disjoint cases hold:
Therefore there are in total M = 1 3 6 9 5 + 1 3 8 4 4 4 + 5 5 7 7 8 = 2 0 7 9 1 7 sets { a , b } such that a b is a multiple of 6 , which gives an answer of ⌊ 1 0 0 0 0 M ⌋ = 2 0