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 Solvers246
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1328 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
184 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
963 Solvers
-
1686 Solvers
-
There are 10 types of people in the world
1386 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!