Count the number of primes less than 'n'.
Nice test cases!
With a more robust Test Suite many/most of the submissions would fail for ignoring the Problem Statement instruction that primes must be less than n. Please add test cases in which the input x (or "n") is itself a prime.
How many trades represent all the profit?
Generate a string like abbcccddddeeeee
Sum the Digits of a Number
Create an index-powered vector
Is this triangle right-angled?
Sum of cubes
Linear system of equations
Roots of a quadratic equation.
Create a constant offset.
Determine the roots of a cubic equation
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