Timeline for A question about integer representation as a sum of two coprime integers
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2017 at 10:11 | history | edited | user6671 | CC BY-SA 3.0 |
fixed typo
|
| Feb 14, 2017 at 9:01 | history | edited | user6671 | CC BY-SA 3.0 |
deleted 9 characters in body
|
| Feb 14, 2017 at 7:45 | comment | added | user6671 | Dear @GerryMyerson: Thank you for your comment. Working modulo 12 is really helpfull. I proved the equality when n is odd! I think that when n is even a case by case inspection will work.Thanks. | |
| Feb 13, 2017 at 21:56 | comment | added | Gerry Myerson | If you know what $n$ is modulo 12, then you know what $a$ and $b$ are modulo 3, so you can work out $p_a(x)$ and $p_b(x)$ and see whether (1) holds, right? | |
| Feb 13, 2017 at 20:33 | history | edited | user6671 | CC BY-SA 3.0 |
added tag : generating-functions
|
| Feb 13, 2017 at 16:57 | history | edited | user6671 | CC BY-SA 3.0 |
added 485 characters in body
|
| Feb 13, 2017 at 13:54 | history | edited | user6671 | CC BY-SA 3.0 |
added 81 characters in body
|
| Feb 13, 2017 at 13:09 | history | edited | user6671 | CC BY-SA 3.0 |
added 172 characters in body
|
| Feb 13, 2017 at 10:59 | history | asked | user6671 | CC BY-SA 3.0 |