Abstract
The following question has been considered by several mathematicians over the last half century: How many incongruent triangles with integer sides have perimeter n? We present a new solution based on group actions and orbit enumeration.
| Original language | English |
|---|---|
| Pages (from-to) | 735-739 |
| Number of pages | 5 |
| Journal | American Mathematical Monthly |
| Volume | 126 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2019 |
Keywords
- group theory
- incongruity
- integer programming
- triangle