Abstract
We show that every minimum area isosceles triangle containing a given triangle shares a side and an angle with . This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every triangle , (1) there are at most minimum area isosceles triangles that contain , and (2) there exists an isosceles triangle containing whose area is smaller than times the area of . Both bounds are best possible.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.