MathDB
3-good Subsets

Source: Indian RMO 2013 Mumbai Region Problem 3

February 1, 2014
trigonometrycombinatorics unsolvedcombinatorics

Problem Statement

A finite non-empty set of integers is called 33-good if the sum of its elements is divisible by 33. Find the number of 33-good subsets of {0,1,2,…,9}\{0,1,2,\ldots,9\}.
Back to ProblemsView on AoPS