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 Solvers248
Suggested Problems
-
Find relatively common elements in matrix rows
2160 Solvers
-
Back to basics 6 - Column Vector
1114 Solvers
-
914 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
429 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
172 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!