Generalization of Catalan's conjecture

I would like to have a simple MATLAB code that can give the solutions for the generalization of the Catalan's conjecture for a given n.

This conjecture and the generalization can be found in the following link

https://en.wikipedia.org/wiki/Catalan%27s_conjecture

The link includes a table with the solutions I would like to get with a code.

Answer 1

[Athul Prakash]

You may explore File Exchange for solutions or related code from which you can build your own solution.

If you are attempting to come up with your own algorithm, have a look at 'factorIntegerPower'

https://in.mathworks.com/help/symbolic/factorintegerpower.html

You can use that to find all the perfect powers in a given sequence of numbers as follows:

a = 1:100;
b = findIntegerPower(a);
result = a(a~=b);   % +result is a row vector containing all the perfect powers in the given range.

This can be a starting point for your solution.

Hope it helps!

[Jesús Zambrano]

Thanks, Athul!

That is a good start but still a long way to go.