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

1989 AIME Problems/Problem 13

Revision as of 22:20, 24 February 2007 by Minsoens (talk | contribs)

Problem

Let $S^{}_{}$ be a subset of $\{1,2,3^{}_{},\ldots,1989\}$ such that no two members of $S^{}_{}$ differ by $4^{}_{}$ or $7^{}_{}$. What is the largest number of elements $S^{}_{}$ can have?

Solution

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

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1989_AIME_Problems/Problem_13&oldid=13414"