Dynamic Construction Related to Fermat's Problem Maximum Task

Dynamic Construction Related to Fermat's Problem Maximum Task
Loading the math board and drawing, please wait…
2019-02-28 23:15
This example demonstrates a dynamic construction related to Fermat's problem of maximum, showcasing geometric transformations and optimizations through interactive geometry. Key math concepts include area, calculus, centroid, circumcircle, geometric constructions, isosceles triangles, special points, triangles, polynomial functions, translation, functions, multiplication, and logarithmic functions. The construction leverages GeoGebra commands such as Zip, Sequence, UnicodeToLetter, Polygon, Sum, If, Ray, Rotate, Point, Intersect, and Segment, with objects like P_{3}, P_{2}, P_{1}, lAngle, lP', P_{1}', lP, lr, lP_p, lM, M_{3}, bue, M_{2}, M_{1}, button1, u34, t1, lLog, br, lPoly, lCircle, Oi, F, P_{2}', P_{3}', Cm, M1, M2, M3, polyMax, m_{3}, m_{1}, m_{2}, lh, h_1, h_2, h_3, lAngle3, r_1, r_2. Suitable for high school and above students to explore geometric optimization and dynamic geometry software applications.

GeoGebra Commands & Parameters

  1. Zip(Rotate[a1, If[b < 180°, (-(60°)), 60°], a2], a1, {P_{2}, P_{1}, P_{1}}, a2, {P_{3}, P_{3}, P_{2}}, b, {lAngle(3), lAngle(1), lAngle(2)}) → lP'
  2. Sequence(Segment[Element[lP', i], Element[lP, i]], i, 1, 3) → lr
  3. Zip(OrthogonalLine[P, r], P, lP, r, lr) → lP_p
  4. Zip(Intersect[a, b], a, {lP_p(1), lP_p(1), lP_p(2)}, b, {lP_p(2), lP_p(3), lP_p(3)}) → lM
  5. UnicodeToLetter(34) → u34
  6. Polygon(lP) → t1
  7. Zip(120° ≤ t ≤ 240°, t, lAngle) → lLog
  8. Sum(lLog) → br
  9. Zip(Center[c], c, lCircle) → Oi
  10. If(lLog(2), P_{2}, lLog(3), P_{3}, lLog(1), P_{1}, Intersect[lr(2), lr(1)]) → F
  11. Polygon(M_{1}, M_{2}, M_{3}) → polyMax, m_{3}, m_{1}, m_{2}
  12. Zip(Segment[F, a], a, lP) → lh
  13. Zip(Angle[a, b, c], a, lP', b, lP, c, If[bue, {M_{3}, M_{1}, M_{2}}, {M_{2}, M_{3}, M_{1}}]) → lAngle3
  14. Ray(M1', P_{2}) → e2
  15. Rotate(P_{2}, (-(60°)), M1') → M11'
  16. Ray(M1', M11') → e1
  17. Point(e2) → M3'
  18. Rotate(P_{2}, 60°, M3') → M22'
  19. Ray(M3', M22') → e3
  20. Intersect(e1, e3) → M2'
  21. Polygon(M1', M2', M3') → poly, m_3', m_1', m_2'
  22. Intersect(OrthogonalLine[M_{1}, lP_p(1)], lP_p(1)) → H
  23. Segment(M_{1}, H) → hh