olymmath

OMCC 2020 Problem 2

  • Day 1

Suppose you have identical coins distributed in several piles with one or more coins in each pile. An action consists of taking two piles, which have an even total of coins among them, and redistribute their coins in two piles so that they end up with the same number of coins.

A distribution is levelable if it is possible, by means of 0 or more operations, to end up with all the piles having the same number of coins.

Determine all positive integers nn such that, for all positive integers kk , any distribution of nknk coins in nn piles is levelable.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator centro/2020/p2 · Tag B8ZF5Z2MWT · Edit this page on GitHub · Keys: j next, k previous