Timeline for Pythagorean coins
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 8, 2016 at 23:21 | comment | added | Peter Taylor | In fact, since m > n for a primitive triple, it turns out that each candidate value of m only has 1 candidate value of n. | |
| Mar 8, 2016 at 13:25 | comment | added | Peter Taylor | The closed form of the paper gives that m divides 999, so there are only 8 candidate values of m to consider, each with at most 2 candidate values of n. | |
| Feb 23, 2015 at 9:53 | history | edited | Gamow | CC BY-SA 3.0 |
added 365 characters in body
|
| Feb 22, 2015 at 17:56 | history | edited | Gamow | CC BY-SA 3.0 |
added 94 characters in body
|
| Feb 22, 2015 at 16:12 | history | answered | Gamow | CC BY-SA 3.0 |