A divisor of a number that is less than the number is called a "proper divisor".
For a given positive integer n, we are asked to evaluate the following summation:
This is equivalent to finding the product of the products of proper divisors of all integers from 2 to n.
For example for 
, we have:
, we have:
Please present your output modulo 
.
.Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
22524 Solvers
-
Extract leading non-zero digit
2246 Solvers
-
Project Euler: Problem 3, Largest prime factor
1790 Solvers
-
1615 Solvers
-
Pseudo Square Root (Inspired by Project Euler 266)
60 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Really pretty simple, once you figure out which way to run the problem.
It's been two days, but my solution isn't showing up. It is size 37, but it is a real solution, no cheats apart from using an implicit ans to save four points, and an exploit of conversion from logical to numeric yielding 0 or 1. Any clues as to why it isn't showing up?
@GeeTwo I've had this happen once as well, a week or two ago. Some problem with the Cody servers, perhaps; I ended up resubmitting my solution, and the second one showed up.