A350379 Consider integer-sided triangles having integer area and let d be the distance between the center of the inscribed circle and the center of the circumscribed circle. The sequence lists the set of distances d which are prime numbers.
5, 13, 17, 53, 193, 241
Offset: 1
References
- Mohammad K. Azarian, Circumradius and Inradius, Problem S125, Math Horizons, Vol. 15, Issue 4, April 2008, p. 32.
- R. A. Johnson, Modern Geometry: An Elementary Treatise on the Geometry of the Triangle and the Circle. Boston, MA: Houghton Mifflin, 1929.
Links
- Mohammad K. Azarian, Solution of problem 125: Circumradius and Inradius, Math Horizons, Vol. 16, No. 2 (Nov. 2008), p. 32.
- Eric Weisstein's World of Mathematics, Exradius
- Eric Weisstein's World of Mathematics, Inradius
Programs
-
Mathematica
nn=520;lst={};Do[s=(a+b+c)/2;If[IntegerQ[s],area2=s (s-a)(s-b)(s-c);If[area2>0&&IntegerQ[Sqrt[area2]]&&PrimeQ[Sqrt[a*b*c/(4*Sqrt[area2])*(a*b*c/(4*Sqrt[area2])-2*Sqrt[area2]/s)]],Print[Sqrt[area2]," ",c," ",b," ",a," ",Sqrt[area2]/s," ",a*b*c/(4*Sqrt[area2])," ",Sqrt[a*b*c/(4*Sqrt[area2])*(a*b*c/(4*Sqrt[area2])-2*Sqrt[area2]/s)]]]],{a,nn},{b,a},{c,b}]
Comments