CN-SMO 2020 Problem 5
Consider the set . Let , be its two subsets. Further, let . (1) Find the sum of maximal and minimal elements in .(2) An element in is called excellent, if its representation is not unique (for instance, ). Find the number of excellent elements in .
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.
Similar problems
These problems have the most words in common with this statement.