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
-
Find the longest sequence of 1's in a binary sequence.
6693 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2835 Solvers
-
Decimation - Optimized for speed
221 Solvers
-
166 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
413 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!