Difference between revisions of "AoPS Wiki:Problem of the Day/June 25, 2011"

Latest revision as of 17:40, 24 June 2011

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$ ?

Page

Toolbox

Search

Difference between revisions of "AoPS Wiki:Problem of the Day/June 25, 2011"

Latest revision as of 17:40, 24 June 2011

Revision as of 17:40, 24 June 2011 (view source) Btilm305 (talk \| contribs) (new problem)	Latest revision as of 17:40, 24 June 2011 (view source) Btilm305 (talk \| contribs) m (Protected "AoPSWiki:Problem of the Day/June 25, 2011": Problem of the Day ([edit=sysop] (indefinite) [move=sysop] (indefinite)))
(No difference)