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 16, Sums of Digits of Powers of Two
Back to basics 22 - Rotate a matrix
Wind Chill Computation
Evaluating a polynomial
Return a list sorted by number of consecutive occurrences
Decrypt the cypher using XOR encryption (for beginners)
Two functions (to be sure)
Negation and new variables
Pandigital number n°1 (Inspired by Project Euler 32)
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