English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this article, we consider certain minimization problems. Ifandare the distances of a boundary or inner point to the sides of a given triangle, find the point which minimizesfor positive integer  n . These problems can be afforded easily with GeoGebra. We consider two examples, the first concerns an isosceles triangle and the second a scalene triangle. In both cases, we divide the triangle horizontally into line segments parallel to the base and look at a family of polynomial functions. Using GeoGebra, we observe in the case of isosceles triangle that the minimum point of each member of the family lies on the  y -axis. Tracking these points vertically we discover the critical point which minimizes,In particular, we show that the sequence of these critical points converges to the incenter of the triangle. In the case of a scalene, we observe that the minima points of the polynomials lie on a curve, the minimum of which can be traced with GeoGebra and computed with basic calculus. Finally, we consider a discussion with some references concerning general solutions of ‘minimal sums of distances’ and ‘minimal sums of squared distances’.

Minimizing inside a triangle with GeoGebra