Core partitions into distinct parts and an analog of Euler's theorem

As a by-product of our results, we obtain a bijection between partitions into distinct parts and partitions into odd parts, which preserves the perimeter (that is, the largest part plus the number of parts minus 1). This simple but curious analog of Euler's theorem appears to be missing from the literature on partitions.