Abstract
The problem of simplification of nested radicals over arbitrary number fields was studied by many authors. The case of real radicals over real number fields is somewhat easier to study (at least, from theoretical point of view). In particular, an efficient (i.e., a polynomial-time) algorithm of simplification of at most doubly nested radicals is known. However, this algorithm does not guarantee complete simplification for the case of radicals with nesting depth more than two. In the paper, we give a detailed presentation of the theory that provides an algorithm which simplifies triply nested reals radicals over \(\mathbb {Q}\). Some examples of triply nested real radicals that cannot be simplified are also given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
