We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

I made a list of list factors(1 and the number itself excluded) for each number from 2-N. Then I traversed each number,for all a's where a=2-N, wherein in I excluded all b's(b=2-N) which had atleast 1 factor less than log(N) to the base a.The count of the rest was what I came up with as the final answer.Can anyone suggest where this method goes wrong, with a test case? Thank you

## Project Euler #29: Distinct powers

You are viewing a single comment's thread. Return to all comments →

I made a list of list factors(1 and the number itself excluded) for each number from 2-N. Then I traversed each number,for all a's where a=2-N, wherein in I excluded all b's(b=2-N) which had atleast 1 factor less than log(N) to the base a.The count of the rest was what I came up with as the final answer.Can anyone suggest where this method goes wrong, with a test case? Thank you