Finding integer-sided triangles with \(P^2 = nA\) (Q2904608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding integer-sided triangles with \(P^2 = nA\) |
scientific article; zbMATH DE number 6066131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding integer-sided triangles with \(P^2 = nA\) |
scientific article; zbMATH DE number 6066131 |
Statements
15 August 2012
0 references
Heronian triangle
0 references
Finding integer-sided triangles with \(P^2 = nA\) (English)
0 references
Regarding the problem of finding integer-sided triangles with a prescribed integral ratio \(n=P^2/A\) between their perimeter and area, the paper presents an algorithm to construct these kind of triangles.NEWLINENEWLINEThe prime and composite cases are separately considered, but in both cases the algorithm implies the solution in integers of a cubic equation. Examples are given for the cases \(n=31\) and \(n=41\).
0 references
