On \(n\)-sectors of the angles of an arbitrary triangle
DOI10.1007/s11786-020-00492-yzbMath1488.51010OpenAlexW3037701337MaRDI QIDQ1995812
Dongming Wang, Bo Huang, Xiao-yu Chen
Publication date: 25 February 2021
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-020-00492-y
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Mechanization of proofs and logical operations (03B35) Elementary problems in Euclidean geometries (51M04) Euclidean analytic geometry (51N20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational methods for problems pertaining to geometry (51-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Morley's theorem revisited: origami construction and automated proof
- Basic principles of mechanical theorem proving in elementary geometries
- Elimination methods
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- Vectorial equations solving for mechanical geometry theorem proving
- Elimination procedures for mechanical theorem proving in geometry
- Automated Inequality Proving and Discovering
- Morley's Theorem and a Converse
- The Morley Trisector Theorem
- A Strong Converse of Morley's Trisector Theorem
- Machine Proofs in Geometry