Timeline for Covering systems
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2016 at 20:37 | history | edited | Stefan Kohl♦ | CC BY-SA 3.0 |
Properly typeset variables, and fixed some typo's.
|
| Oct 30, 2016 at 0:58 | vote | accept | John Neumann | ||
| Oct 29, 2016 at 23:32 | answer | added | Gerry Myerson | timeline score: 6 | |
| Oct 29, 2016 at 21:54 | history | reopened |
Gerry Myerson Lucia David Roberts♦ Bjørn Kjos-Hanssen Yemon Choi |
||
| Oct 28, 2016 at 5:31 | comment | added | Gerry Myerson | I retract my claim – the cover I had in mind still works after the congruence modulo 4 is discarded. | |
| Oct 27, 2016 at 22:49 | comment | added | YCor | en.wikipedia.org/wiki/Covering_system | |
| Oct 27, 2016 at 22:32 | comment | added | Gerry Myerson | I believe I can construct an irredundant cover with moduli 2, 3, 4, 5, 6, 9, 10, 15, 18, 30, and 45, only one of which is divisible by 4. | |
| Oct 27, 2016 at 22:30 | review | Reopen votes | |||
| Oct 28, 2016 at 6:48 | |||||
| Oct 27, 2016 at 22:12 | comment | added | Gerry Myerson | Why is this closed? Covering systems are a recognized area of research in Number Theory. It's known that in an irredundant cover with a modulus divisible by a prime $p$ there are at least $p$ moduli divisible by $p$. This asks whether, if there is a modulus divisible by a power of a prime $p$, there are at least $p$ moduli divisible by that power of $p$. Seems like a reasonable research question to me. | |
| Oct 27, 2016 at 21:02 | history | closed |
Daniel Loughran Wolfgang Stefan Kohl♦ Franz Lemmermeyer Myshkin |
Not suitable for this site | |
| Oct 27, 2016 at 20:04 | review | Close votes | |||
| Oct 27, 2016 at 21:02 | |||||
| Oct 27, 2016 at 19:11 | review | First posts | |||
| Oct 27, 2016 at 19:45 | |||||
| Oct 27, 2016 at 19:08 | history | asked | John Neumann | CC BY-SA 3.0 |