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 Solvers240
Suggested Problems
-
Project Euler: Problem 2, Sum of even Fibonacci
2837 Solvers
-
Given a window, how many subsets of a vector sum positive
871 Solvers
-
1601 Solvers
-
429 Solvers
-
Convert from Fahrenheit to Celsius
27958 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!