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 Solvers154
Suggested Problems
-
Project Euler: Problem 3, Largest prime factor
1639 Solvers
-
1510 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
365 Solvers
-
163 Solvers
-
String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values
1845 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!