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 Solvers245
Suggested Problems
-
47373 Solvers
-
6717 Solvers
-
1499 Solvers
-
1741 Solvers
-
Return fibonacci sequence do not use loop and condition
870 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!