Problem

Source: Tournament of Towns,Spring 2002, Senior A Level, P7

Tags: floor function, number theory proposed, number theory



Do there exist irrational numbers $a,b$ both greater than $1$, such that $\lfloor{a^m}\rfloor\neq \lfloor{b^n}\rfloor$ for all $m,n\in\mathbb{N}$ ?