2007 OIM Problems/Problem 5
Problem
A natural number 
is "daring" if the set of its divisors, from 1 to inclusive, can be divided into three subsets such that the sum of the elements of each subset is the same in all three. What is the smallest number of divisors a daring number can have?
~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.
