2012 OIM Problems/Problem 3
Problem
Let be a positive integer. Given a set of integers between 0 and inclusive, to each of its subsets we assign the sum of their elements; in particular, the empty subset has sum 0. If these sums leave different remainders when divided by , the subset is said to be -complete. Find, for each , the number of -complete sets.
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.