Difference between revisions of "2002 OIM Problems/Problem 1"
(Created page with "== Problem == a) There are two sequences, each of 2003 consecutive integers, and a board with 2 rows and 2003 columns Decide if it is always possible to distribute the numbe...") |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | + | The integers from 1 to 2002, both inclusive, are written on a blackboard in increasing order <math>1, 2, \cdots , 2001, 2002</math>. Then, those in first, fourth place, seventh place, etc. are deleted, that is, those who occupy the places of the form <math>3k + 1</math>. In the new list the numbers that are in the places of the form <math>3k + 1</math> are deleted. This process is repeated until all numbers are deleted from the list. What was the last number that was deleted? | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com | ~translated into English by Tomas Diaz. ~orders@tomasdiaz.com | ||
| Line 14: | Line 8: | ||
== See also == | == See also == | ||
| − | |||
Revision as of 04:37, 14 December 2023
Problem
The integers from 1 to 2002, both inclusive, are written on a blackboard in increasing order 
. Then, those in first, fourth place, seventh place, etc. are deleted, that is, those who occupy the places of the form 
. In the new list the numbers that are in the places of the form are deleted. This process is repeated until all numbers are deleted from the list. What was the last number that was deleted?
~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.
