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
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
1470 Solvers
-
Numbers with prime factors 2, 3 and 5.
681 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
582 Solvers
-
It's going down. We're finding simbers!
86 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!
