![]() |
Problem
of the Week |
Voilà!
Find a way to divide the integers from 1 to 32 into two disjoint sets of sixteen integers each so that the sum of the k'th powers of the elements in each set are equal, for k = 1, 2, 3, 4, or explain why no such partitioning of these numbers is possible.
Can you state (and solve?) a general conjecture about this situation?
You are visitor number 5565
to this page.
ã2001 Alberto L. Delgado