Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1998 OIM Problems/Problem 3

Revision as of 15:41, 13 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Find the minimum natural number <math>n</math> with the following property: among any <math>n</math> different numbers belonging to the set <math>{1, 2, \cdots ,...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Find the minimum natural number $n$ with the following property: among any $n$ different numbers belonging to the set ${1, 2, \cdots , 999}$ you can choose four different numbers $a$, $b$, $c$, $d$, such that $a + 2b + 3c = d$.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

https://www.oma.org.ar/enunciados/ibe13.htm

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1998_OIM_Problems/Problem_3&oldid=207101"