The shortest line connecting the vertices of a square

Dag Hrubý; Martina Kašparová

Učitel matematiky (2013)

  • Volume: 021, Issue: 4, page 193-201
  • ISSN: 1210-9037

Abstract

top
The article concerns the following problem: Given square A B C D with the side of 1. Find points E , F so that the sum l = | A E | + | D E | + | E F | + | B F | + | C F | is the smallest possible. Four solutions are given which are examples of the connection between several mathematical disciplines (geometry, algebra and calculus). The article concludes with a note on the history of the presented problem (leading to P. Fermat and others).

How to cite

top

Hrubý, Dag, and Kašparová, Martina. "Nejkratší spojnice vrcholů čtverce." Učitel matematiky 021.4 (2013): 193-201. <http://eudml.org/doc/297635>.

@article{Hrubý2013,
author = {Hrubý, Dag, Kašparová, Martina},
journal = {Učitel matematiky},
language = {cze},
number = {4},
pages = {193-201},
publisher = {Jednota českých matematiků a fyziků},
title = {Nejkratší spojnice vrcholů čtverce},
url = {http://eudml.org/doc/297635},
volume = {021},
year = {2013},
}

TY - JOUR
AU - Hrubý, Dag
AU - Kašparová, Martina
TI - Nejkratší spojnice vrcholů čtverce
JO - Učitel matematiky
PY - 2013
PB - Jednota českých matematiků a fyziků
VL - 021
IS - 4
SP - 193
EP - 201
LA - cze
UR - http://eudml.org/doc/297635
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.