I need some help with figuring out an equation or process? Not sure what the correct term is?
Full disclosure: Unfortunately I’m not even remotely a mathematician so I’m grateful for your patience. If I misuse any vocabulary or am unclear please let me know and I’ll try tor clarify what I’m trying to convey.
The Question.
The question is simple. I want to figure out the exponent of a value. But there is caveat:
- Only the total is known.
- And out of all the possible exponents that could be used: I want to find the smallest possible base with the smallest possible power.
That is to say: If I was to take the digit of the base number $x$ and the digit of the exponent power $y$, that both these numbers would be as small as possible without making the other larger.
Essentially the resulting pair of numbers would essentially be the smallest difference of values and/ or the smallest sum total.
Moreover I need to “prove” that it is the smallest combination of numbers possible. Unfortunately it can’t be “close enough.” It needs to be certain that this pair of numbers are the smallest pair possible values that can form the exponent total.
Here is an example that I hope illustrates what I am trying to achieve:
(But remember, I’m not just trying to find the answer. Rather I want to know if there is a mathematical process to finding the smallest possible pair in the first place?)
Let’s say that the equation is $x^{y} = 64$.
The most simple exponent is $64^{1}$. But it is also the largest number I could use as a base and so would not be considered a “successful” answer, (even if the exponent is only $1$).
$2^{6}$ would be considered more “successful” exponent. As the numbers are $2$ and $6$. It doesn’t matter if the base is smaller than the exponent. The only criteria is that they are made of the smallest numbers as viewed as a decimal value.
$4^{3}$ I believe to be the most successful. The base may have significantly increased but we have reduced the exponent by half its value.
$8^{2}$ would be less of a successas it has still gained a higher number. Whilst it is the smallest exponent possible aside from $1$, the base has risen to $8$.
Now, the first question would be how do I find $4^{3}$ out of all the exponents I could possibly use? Then secondly how can I be certain that there is no smaller combination of numbers that could be used to create an exponent that results in $64$?.
Or put another way: Is there a method of mathematically finding the smallest pair of numbers without simply wading through every possible exponent that makes the original sum and comparing the total sum and/or difference of every pair?
Thank you in advance! I know I’m probably over complicating this but unfortunately I don’t know what I don’t know.
edit: Here is the link @SohamSaha post using positive integers in case anyone should need it: Minimising $x+y$ in $x^y=a$

You are asking to minimize $x + y$ given some fixed constant $a > 0$ such that $x^y = a$. Since we are optimizing in two variables, we solve this using Lagrange multipliers. We let $f(x, y) = x + y$ and $g(x, y) = x^y - a$. Then, we need to find a constant $\lambda$ such that $$\begin{align*}\frac{\partial f(x, y)}{\partial x} &= \lambda \frac{\partial g(x, y)}{\partial x} \\ \frac{\partial f(x, y)}{\partial y} &= \lambda \frac{\partial g(x, y)}{\partial y} \\ g(x,y) &= 0.\end{align*}$$
The operation $\dfrac{\partial f}{\partial x}$ means to take the derivative (or if you want, the rate of change) of $f$ with respect to $x$ while treating all other variables (in this case, $y$) as a constant.
The first two equations become $$\begin{align*}1 &= yx^{y - 1} \\ 1 &= x^y \ln x\end{align*}$$ which, by transitivity, is just $yx^{y - 1} = x^y \ln x$. Dividing both sides by $x^{y - 1}$, we get $y = x \ln x$. Note that we didn't even need to get $\lambda$ here.
Hence, we just need to solve $x^{x \ln x} = a$. Then, $x$ will be the base, and $x \ln x$ will be your exponent.
I don't have any idea how to solve $x^{x\ln x} = a$ as I believe it will need to use some techniques involving the Lambert W function.