Project Euler: Problem 7, Nth prime
Divisible by 2
Basic commands - amount of inputs
Basics: counting digits of a number irrespective of the sign
Nth root of a number
Product of all elements in an array
count upper and lower case characters
function to compute root mean square of first nn positive odd integers
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