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?
Project Euler: Problem 7, Nth prime
Swap the input arguments
Back to basics 21 - Matrix replicating
Return elements unique to either input
Numbers spiral diagonals (Part 2)
Replicate elements in vectors
Sum of big primes without primes
Expression or variable?
Without the French accent please!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office