GCD Sequence
This is an easy problem. It has been solved by 340 people in 4 months. Usually the difficult problems can only be solved by less than 150 people. The problem is easy since it just take a few moment to find out how to solve the problem. Look at the sequence to 1e6 then one can figure out how to solve the problem. The problem is relative easy since the sequence up to 1e6 can be built in less than 1 second with purely brute force code. It takes two seconds to get the correct answer.
Hello Pipilu,
ReplyDeleteCan you give some hint s to what to look for in the sequence to 1e6? I tried this and havent been able to get insights. Could you help me here?
And kudos to your blog. This has been a gem of a source to refer when stuck with project euler problems. I couldnt have solved hyperexponentiation problem without the hint of Euler's theorem there.
Thanks
Anant