Count from 0 to N^M in base N.
Project Euler: Problem 8, Find largest product in a large string of numbers
Split a string into chunks of specified length
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
Decipher the message - same key for all digits
Decipher the message - 3 key
Find the efficiency
Find the treasures in MATLAB Central and discover how the community can help you!
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