Timeline for Finding a solution for this system of two diophantine equations (depending on a parameter)
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 17, 2018 at 15:31 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
deleted 12 characters in body
|
| Jan 17, 2018 at 15:04 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 6 characters in body
|
| S Jan 17, 2018 at 12:39 | history | suggested | Safwane | CC BY-SA 3.0 |
modifying the function mod
|
| Jan 17, 2018 at 12:17 | review | Suggested edits | |||
| S Jan 17, 2018 at 12:39 | |||||
| S Jan 17, 2018 at 11:27 | history | suggested | Safwane | CC BY-SA 3.0 |
I add $ to each mathematical symbol.
|
| Jan 17, 2018 at 10:58 | review | Suggested edits | |||
| S Jan 17, 2018 at 11:27 | |||||
| Jan 17, 2018 at 7:15 | comment | added | Gerhard Paseman | It looks like there is no solution for n=49. In particular, if n is 1 mod 12 and n(n+3) is not a multiple of 8,20,32,44,... then there is no solution. I will see if I can turn this into a set of k for which 12k+1 does not admit a solution. Gerhard "Getting, Closer And Closer, Slowly" Paseman, 2018.01.16. | |
| Jan 17, 2018 at 6:54 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 2 characters in body
|
| Jan 17, 2018 at 6:34 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 668 characters in body
|
| Jan 16, 2018 at 19:34 | comment | added | Gerhard Paseman | I think x=8/3 works for the cases where n is 1 mod 3. Gerhard "That Was Not So Hard" Paseman, 2018.01.16. | |
| Jan 16, 2018 at 19:16 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 36 characters in body
|
| Jan 16, 2018 at 19:10 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |