Difference between revisions of "G285 2021 Fall Problem Set"
Geometry285 (talk | contribs) (Created page with "Welcome to the Fall Problem Set! There are <math>15</math> problems, <math>10</math> multiple-choice, and <math>5</math> free-response. ==Problem 1== Larry is playing a logi...") |
Geometry285 (talk | contribs) m (→Problem 1) |
||
| Line 2: | Line 2: | ||
==Problem 1== | ==Problem 1== | ||
| − | Larry is playing a logic game. In this game, Larry counts <math>1,2,3,6, \cdots </math>, and removes the number <math>r+p</math> for every <math>r</math>th move, skipping <math>r+jp</math> for <math>j \neq 0 \mod 3 | + | Larry is playing a logic game. In this game, Larry counts <math>1,2,3,6, \cdots </math>, and removes the number <math>r+p</math> for every <math>r</math>th move, skipping <math>r+jp</math> for <math>j \neq 0 \mod 3</math>, and then increments <math>p</math> by one. If <math>(r,p)</math> starts at <math>(1,3)</math>, what is <math>r+p</math> when Larry counts his <math>100</math>th integer? Assume <math>\{r,p,j \} \in \mathbb{N}</math> |
Revision as of 13:56, 8 July 2021
Welcome to the Fall Problem Set! There are 
problems, 
multiple-choice, and 
free-response.
Problem 1
Larry is playing a logic game. In this game, Larry counts 
, and removes the number 
for every 
th move, skipping 
for 
, and then increments 
by one. If 
starts at 
, what is when Larry counts his 
th integer? Assume 
