SearcharxivSearch

arXiv · 2001.07873

Solving parametric radical equations with depth 2 rigorously using the restriction set method

Abstract

We review the history and previous literature on radical equations and present the rigorous solution theory for radical equations of depth 2, continuing a previous study of radical equations of depth 1. Radical equations of depth 2 are equations where the unknown variable appears under at least one square root and where two steps are needed to eliminate all radicals appearing in the equation. We state and prove theorems for all three equation forms with depth 2 that give the solution set of all real-valued solutions. The theorems are shown via the restriction set method that uses inequality restrictions to decide whether to accept or reject candidate solutions. We distinguish between formal solutions that satisfy the original equation in a formal sense, where we allow some radicals to evaluate to imaginary numbers during verification, and strong solutions, where all radicals evaluate to real numbers during verification. Our theorems explicitly identify the set of all formal solutions and the set of all strong solutions for each equation form. The theory underlying radical equations with depth 2 is richer and more interesting than the theory governing radical equations with depth 1, and some aspects of the theory are not intuitively obvious. It is illustrated with examples of parametric radical equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Eleftherios Gkioulekas. 2020-01-22. Solving parametric radical equations with depth 2 rigorously using the restriction set method. https://arxiv.org/abs/2001.07873

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO