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.
Which doors are open?
Project Euler: Problem 1, Multiples of 3 and 5
Remove NaN ?
Who has power to do everything in this world?
Rounding off numbers to n decimals
Display negative numbers
Roots of a quadratic equation.
Sum of cubes
kmph to mph converter
Create a constant offset.
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