OME 2019 Problem 1
An integer set T is orensan if there exist integersa<b<c, where aand c are part of T, but b is not part of T. Count the number of subsets T of {1,2,...,2019} which are orensan.
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.