Timeline for Partitioning the positive integers into finitely many arithmetic progressions
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2019 at 21:43 | comment | added | Judah Greenblatt | Counter example where there are an infinite number of infinite arithmetic progressions and NO progression has the difference equal to the initial term. for k from 1 to inf { S(k) = 2^k * n + 2 ^ (k-1) for n from 0 to inf } S(1) is odd integers; S(2) is 2, 6, 10 - twice an odd integer; and continues for powers of 2. In all cases the initial term is the difference / 2. | |
| S Feb 25, 2019 at 21:02 | history | suggested | Rodrigo de Azevedo | CC BY-SA 4.0 |
Minor improvements. Added source of problem.
|
| Feb 25, 2019 at 19:55 | review | Close votes | |||
| Mar 2, 2019 at 20:22 | |||||
| Feb 25, 2019 at 19:33 | review | Suggested edits | |||
| S Feb 25, 2019 at 21:02 | |||||
| Feb 25, 2019 at 15:54 | vote | accept | VRS | ||
| Feb 25, 2019 at 15:43 | answer | added | Fedor Petrov | timeline score: 7 | |
| Feb 25, 2019 at 15:27 | comment | added | VRS | Sorry I should’ve asked for counter example also. I have edited the question now. The source is the variant mentioned below the main question which is an exercise from “A Walk Through Combinatorics”. | |
| Feb 25, 2019 at 15:25 | history | edited | VRS | CC BY-SA 4.0 |
added 12 characters in body
|
| Feb 25, 2019 at 14:30 | comment | added | Fedor Petrov | What is the origin of this question? Usually if you ask to "prove" something you should have some strong evidence that the proof exists. | |
| Feb 25, 2019 at 13:30 | review | First posts | |||
| Feb 25, 2019 at 14:26 | |||||
| Feb 25, 2019 at 13:28 | history | asked | VRS | CC BY-SA 4.0 |