z-logo
open-access-imgOpen Access
On the greatest prime factor of sides of a Heron triangle
Author(s) -
Florian Luca
Publication year - 2009
Publication title -
elemente der mathematik
Language(s) - English
Resource type - Journals
eISSN - 1420-8962
pISSN - 0013-6018
DOI - 10.4171/em/110
Subject(s) - heron , mathematics , combinatorics , integer (computer science) , prime (order theory) , infinity , mathematical analysis , computer science , programming language , biology , paleontology
A Heron triangle is a triangle whose sides a, b, c and area A = s(s − a)(s − b)(s − c) are integers. Here, s = (a + b + c)/2 is the semiperimeter of . The triangle is called reduced if gcd(a, b, c) = 1. For a positive integer n let P(n) be the largest prime factor of n with the convention that P(1) = 1. In [5], it was shown that P(A) → ∞ as max{a, b, c} → ∞ through triples which are sides of reduced Heron triangles. In [4], it was shown that also P(abc) → ∞ again as max{a, b, c} → ∞ through triples which are sides of reduced Heron triangles. Here, we improve this to: Theorem 1. P(bc) goes to infinity as max{a, b, c} goes to infinity through triples which are sides of reduced Heron triangles .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom