Search arXivSearch

arXiv · 1510.08022

Proving the uncountability of the number of irrational powers of irrational numbers evaluated as rationals and solutions approximation for x^x=y and x^{x^x}=y

Abstract

Numbers are often used to define more complicated numbers. For example, two integers are used to define a rational number and two reals are used to define a complex number. It might be expected that an irrational power of an irrational number would be an irrational number. Despite that, it is actually possible for an irrational power of an irrational number to be a rational number. For many generations, this circulated as a non-constructive proof by contradiction in logic for discrete mathematics textbooks and college courses. Since the 80s, a constructive proof circulated orally, such as $\sqrt{2}^{log_\sqrt{2} 3}$ equals to 3. A written proof was published in 2008 by Lord. The first contribution of this paper is to prove that there is an uncountable number of such pairs of irrational numbers such that the power of one to the other is a rational number. Marshall and Tan answered the question of whether there is a single irrational number $a$ such that $a^a$ is rational. They proved that given $I$ = $(\frac{1}{e})^{(\frac{1}{e},\infty)}$, then every rational number in $I$ is either of the form $a^a$ for an irrational $a$ or is in the very thin set $\{1,4,27,256,...,n^n,...\}$. It seems a challenging task to analytically solve the equation $x^x=y$ for any real $y$. To the best of our knowledge, there is no work on finding $x$ from a given $y$. We proved that $ln((ln(y)) e$ and $x e^e$. Hence, the second contribution of this paper is to estimate the real $x$ such that either one of the equations $x^x=y$ or $x^{x^x}=y$ holds, for a given $y$.

Explore related subjects

Keep this discovery

BibTeXRIS

Anca Andrei. 2015-10-17. Proving the uncountability of the number of irrational powers of irrational numbers evaluated as rationals and solutions approximation for x^x=y and x^{x^x}=y. https://arxiv.org/abs/1510.08022

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