“…In this way, we obtain that L B / ∈ REG, since it is not possible that L B ∈ NSPACE(o(log log n)) under the result of L V B / ∈ NSPACE(S(n)) for all S(n) = o(log n) as a consequence of Theorem 15 when L = N L. Consequently, we obtain a contradiction just assuming that the Beal's conjecture is false and L B ∈ REG when L = N L. In contraposition, we have the Beal's conjecture is true or this has an infinite number of counterexamples both for a specific choice of exponents (x, y, z), since L B uses a specific choice of exponents (x, y, z) when L = N L. The Darmon-Granville theorem uses Faltings's theorem to show that for every specific choice of exponents (x, y, z), there are at most finitely many co-prime solutions for (A, B, C) [9], [11]. In conclusion, we obtain that necessarily the Beal's conjecture is true for this specific choice of exponents (x, y, z) as the remaining only option when L = N L. Since we took arbitrarily the exponents (x, y, z), then the Beal's conjecture will be true for every specific choice of exponents (x, y, z) when L = N L. On November 2019, Frank Vega proves that L = N P which also implies that L = N L [28], [29]. In this way, the Beal's conjecture is true.…”