2018-2019 Fall OMO Problem 1
Source:
November 7, 2018
troll
Problem Statement
Leonhard has five cards. Each card has a nonnegative integer written on it, and any two cards show relatively prime numbers. Compute the smallest possible value of the sum of the numbers on Leonhard's cards.Note: Two integers are relatively prime if no positive integer other than divides both numbers.Proposed by ABCDE and Tristan Shin