MathDB

Let

A

be a set containing

4k

consecutive positive integers, where

k \geq 1

is an integer. Find the smallest

k

for which the set A can be partitioned into two subsets having the same number of elements, the same sum of elements, the same sum of the squares of elements, and the same sum of the cubes of elements.

Problem Statement