Inspired by Problem 1025 and Project Euler 12.
Given n, return the number y of integers that divide N.
For example, with n = 10, the divisors are [1 2 5 10], so y = 4.
It's easy with normal integer but how to proceed with big number?
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers250
Suggested Problems
-
9193 Solvers
-
20031 Solvers
-
Sum of first n terms of a harmonic progression
526 Solvers
-
196 Solvers
-
Large Sum (inspired by Project Euler 13)
124 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!