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.
Project Euler #211: Divisor Square Sum
Project Euler #211: Divisor Square Sum
Sort by
recency
|
23 Discussions
|
Please Login in order to post a comment
i didn't get the logic of first test case till now Can u explain it more detailed ?
Some small hints: 1. Distance for all prime numbers will be 1 2. Squares of all prime numbers
n
will have always 3 divisors: 1, n and n^2please help in reducing complexity
or feel free to give any advice
please help(terminated due to timeout) this code only able to pass test case 0
i did not understand: 65 0 :: For the first one, the only integers less than 65 for which sigma2(n) is a square are 1 and 42, hence the answer is 43.
plz. explain.
also give more test case