ETD

• diophantine approximation
• powers with few nonzero digits
• subspace theorem

We study the diophantine equation f(a^m,y)=b^n where m,n,y are integers. We want to understand when it has only finitely many solutions. The main technical tool used is the subspace theorem. We also extend the results to the case of number fields and S-units in place of the powers.