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

AoPS Wiki:Problem of the Day/June 25, 2011

< AoPS Wiki:Problem of the Day
Revision as of 16:40, 24 June 2011 by Btilm305 (talk | contribs) (Protected "AoPSWiki:Problem of the Day/June 25, 2011": Problem of the Day ([edit=sysop] (indefinite) [move=sysop] (indefinite)))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Let $1,4 \ldots$ and $9,16 \ldots$ be two arithmetic progressions. The set $S$ is the union of the first $2004$ terms of each sequence. How many distinct numbers are in $S$?

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=AoPS_Wiki:Problem_of_the_Day/June_25,_2011&oldid=39913"