As with the other problem of this kind, the problem description should be "Calculate the number of n-digit numbers that do not contain successive d-number of zeros at least."
Alphabetize by last name
Project Euler: Problem 5, Smallest multiple
Sort numbers by outside digits
Create an index-powered vector
Seperate array to small section according to its index position
Determine if input is a Narcissistic number
Determine if input is a perfect number
Make an anonymous function that has variable output
Put m balls into n boxes (again)
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