KöMaL 2020 K669
Let us consider the set of 3-digit positive integers containing all the digits 1, 2, 3 exactly once. Find the smallest positive integer that contains each number from the previous set as consecutive digits.
Official text KöMaL. 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.
Similar problems
These problems have the most words in common with this statement.