Problem 2664. Divisors for big integer
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 commentsProblem Recent Solvers142
Suggested Problems
-
1196 Solvers
-
1089 Solvers
-
Make a vector of prime numbers
643 Solvers
-
7061 Solvers
-
Sum of big primes without primes
135 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!