Project Euler Forum

I have a code that works, but gets slow at big numbers becouse of GCD.
I don't see how to apply memoization or some handy break...

Any ideas how to get rid of GCD, please?

I don't want to give too much of a hint, but google might find one or two sources which explain how to calculate [phi](n) efficiently.