Finding integer-sided triangles with P^2 = nA - John F. Goehl 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. ✪ ✪ ✪ ✪ ✪ Link tải tài liệu: LINK TẢI TÀI LIỆU Theo LTTK Education