**
John Goehl, Finding integer-sided triangles with P^2 = nA,
Forum Geometricorum, 12 (2012) 211--213.
**

Abstract. A surprising property of certain parameters leads to algorithms for finding integer-sided triangles with P^2 = nA, where P is the perimeter, A is the area, and n is an integer. Examples of triangles found for each of two values of n are given.

[ps file] [pdf]