A polygon is equable if its area is equal to its perimeter. A pair of polygons is an amicable pair if the area of the first is equal to the perimeter of the second, and vice versa. A polygon is a lattice polygon if its vertices lie on the integer lattice. We show that amicable lattice rhombuses are actually equable.
No takes yet. Share an insight, caveat, or question.
Biekietov et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: