Abstract
This paper studies equable parallelograms whose vertices lie on the integer lattice. Using Rosenberger’s Theorem on generalised Markov equations, we show that the g.c.d. of the side lengths of such parallelograms can only be 3, 4 or 5, and in each of these cases the set of parallelograms naturally forms an infinite tree all of whose vertices have degree 4, bar the root. The paper then focuses on what we call Pythagorean equable parallelograms. These are lattice equable parallelograms whose complement in a circumscribing rectangle consists of two Pythagorean triangles. We prove that for these parallelograms the shortest side can only be 3, 4, 5, 6 or 10, and there are five infinite families of such parallelograms, given by solutions to corresponding Pell-like equations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
