MathDB
Largest Subset

Source: Mexican Mathematical Olympiad 2013 Problem 3

December 1, 2013
combinatorics proposedcombinatorics

Problem Statement

What is the largest amount of elements that can be taken from the set {1,2,...,2012,2013}\{1, 2, ... , 2012, 2013\}, such that within them there are no distinct three, say aa, bb,and cc, such that aa is a divisor or multiple of bāˆ’cb-c?
Back to ProblemsView on AoPS