IR-MO 2011 Problem 8
We call the sequence of natural numbers, not necessarily distinct, covering if there exists arithmetic progressions like ,...., such that every natural number has come in at least one of them. We call this sequence short if we can not delete any of the such that the resulting sequence be still covering.a) Suppose that is a short covering sequence and suppose that we've covered all the natural numbers with arithmetic progressions , and suppose that is a prime number that divides but it does not divide . Prove that the remainders of modulo contains all the numbers .b) Write anything you can about covering sequences and short covering sequences in the case that each of has only one prime divisor.
proposed by Ali Khezeli
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.