arXiv · 2503.20458
Amicable Triangle and Rectangles on the Integer Lattice
Abstract
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice triangles and five pairs of amicable lattice rectangles.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Iwan Praton, Weiran Zeng. 2025-03-26. Amicable Triangle and Rectangles on the Integer Lattice. https://arxiv.org/abs/2503.20458
Cite the original work for its findings. Save a collection to share your selection of sources.