Let denote the number of ways to select 3 distinct integers from the first 300 positive integers such that the sum of these 3 numbers is divisible by 3 and the order of these integers does not matter.
Find the last 3 digits of .
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.
No explanations have been posted yet. Check back later!