{"title":"平面、空间和n空间中欧拉不等式的改进","authors":"D. Veljan","doi":"10.5592/co/ccd.2020.08","DOIUrl":null,"url":null,"abstract":"We improve Euler’s inequality R ≥ 2r, where R and r are triangle’s circumradius and inradius, respectively, and prove some consequences of it. We also show non-Euclidean version of this result. Next, we improve 3D analogue of Euler’s inequality for tetrahedra R ≥ 3r and discuss recursive way to improve analogues of Euler’s inequality for simplices. We end with some open problems, including possible CEEG (classical Euclidean elementary geometry) proof of Grace-Danielsson’s inequality d2 ≤ (R − 3r)(R + r), where d is the distance between the centers of the insphere and the circumsphere of a tetrahedron.","PeriodicalId":253304,"journal":{"name":"Proceedings of the 3rd Croatian Combinatorial Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Refinements of Euler's inequalities in plane, space and n-space\",\"authors\":\"D. Veljan\",\"doi\":\"10.5592/co/ccd.2020.08\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We improve Euler’s inequality R ≥ 2r, where R and r are triangle’s circumradius and inradius, respectively, and prove some consequences of it. We also show non-Euclidean version of this result. Next, we improve 3D analogue of Euler’s inequality for tetrahedra R ≥ 3r and discuss recursive way to improve analogues of Euler’s inequality for simplices. We end with some open problems, including possible CEEG (classical Euclidean elementary geometry) proof of Grace-Danielsson’s inequality d2 ≤ (R − 3r)(R + r), where d is the distance between the centers of the insphere and the circumsphere of a tetrahedron.\",\"PeriodicalId\":253304,\"journal\":{\"name\":\"Proceedings of the 3rd Croatian Combinatorial Days\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd Croatian Combinatorial Days\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5592/co/ccd.2020.08\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd Croatian Combinatorial Days","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5592/co/ccd.2020.08","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Refinements of Euler's inequalities in plane, space and n-space
We improve Euler’s inequality R ≥ 2r, where R and r are triangle’s circumradius and inradius, respectively, and prove some consequences of it. We also show non-Euclidean version of this result. Next, we improve 3D analogue of Euler’s inequality for tetrahedra R ≥ 3r and discuss recursive way to improve analogues of Euler’s inequality for simplices. We end with some open problems, including possible CEEG (classical Euclidean elementary geometry) proof of Grace-Danielsson’s inequality d2 ≤ (R − 3r)(R + r), where d is the distance between the centers of the insphere and the circumsphere of a tetrahedron.