2016 MPFG Problem 18
Problem
Let  . Say that a subset
. Say that a subset  of
 of  is handy if the sum of all the elements of
 is handy if the sum of all the elements of  is a multiple of
 is a multiple of  . For example, the empty set is handy (because its sum is
. For example, the empty set is handy (because its sum is  ) and
) and  itself is handy (because its sum is
 itself is handy (because its sum is  ). Compute the number of handy subsets of
). Compute the number of handy subsets of  .
.
Solution 1
We can use roots of unity to solve this problem.
 
 
  
 
 
 
~cassphe
