Proving the uncountability of the number of irrational powers of irrational numbers evaluated as rationals and solutions approximation for xx=y and xxx=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 2log2 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 aa is rational. They proved that given I = (1e)(1e,∞), then every rational number in I is either of the form aa for an irrational a or is in the very thin set \1,4,27,256,...,nn,...\. It seems a challenging task to analytically solve the equation xx=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))<x for y>e and x<ln(y), for y> ee. Hence, the second contribution of this paper is to estimate the real x such that either one of the equations xx=y or xxx=y holds, for a given y.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…