Timeline for Can we color Z^+ with n colors such that a, 2a, ..., na all have different colors for all a?
Current License: CC BY-SA 2.5
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 1, 2010 at 22:00 | history | edited | Lucas K. | CC BY-SA 2.5 |
Further improvements and corrections.
|
May 31, 2010 at 22:33 | history | edited | Lucas K. | CC BY-SA 2.5 |
Futher information
|
May 31, 2010 at 22:13 | history | edited | Lucas K. | CC BY-SA 2.5 |
More solution.
|
May 30, 2010 at 14:29 | history | edited | Lucas K. | CC BY-SA 2.5 |
Correction.
|
May 30, 2010 at 12:28 | comment | added | domotorp | This is a nice approach, I wonder if it can be finished this way. | |
May 30, 2010 at 12:25 | comment | added | Lucas K. | Note, that the argument of François does follow the principle of the same coloring for each a, except for permutation. So, above answer is more to reduce the problem from constructing an infinite sequence, to a finite matrix. | |
May 30, 2010 at 11:46 | history | edited | Lucas K. | CC BY-SA 2.5 |
Simplified
|
May 30, 2010 at 11:39 | history | edited | Lucas K. | CC BY-SA 2.5 |
Correcting error.
|
May 30, 2010 at 10:43 | history | answered | Lucas K. | CC BY-SA 2.5 |