Abstract:
Euler’s integer partition theorem stating that the number of partitions
of an integer into odd integers is equal to the number of partitions into
distinct integers ranks 16 in Wells’ list of the most beautiful theorems [17]. In
this paper we use the algorithmic method to evaluate the complexity of mathematical
statements developed in [3, 4, 5] to show that Euler’s theorem is in class
CU,7, the most complex mathematical statement studied to date.