Raising both sides of the equation to the 8th power yields
e7 = f8
Since both e and f are integers, they can be factored as powers of the primes. Since we are interested in a minimum type solution, there is motivation to look at the lowest prime i.e. 2 . So let
e = 2n and f = 2m
The equation then reads 27n = 28m
This implies that 7n = 8 m. The solution to this equation with the smallest values for n and m is
m = 7 and n = 8 So e = 28 = 256 and f = 27 = 128
Finally 256 + 128 = 384.
This analysis does not prove that this is the lowest possible value for e+f, but some trial and error with primes other than 2 always leads to greater values of e + f. I am not sure why this problem was in the log section.