A Turing machine Me that prints f > e such that Me = Mf

Question

I\'m trying to prove that the following Turing Machine Me exists: Me (it has codification e) on every input it prints a number f > e, such that Mf