## DEV Community is a community of 871,688 amazing developers

We're a place where coders share, stay up-to-date and grow their careers.

Posted on

# What’s your alternative solution? Challenge #21

This is series of daily JavaScript coding challenges... for both beginners and advanced users.

Each day I’m gone present you a very simple coding challenge, together with the solution. The solution is intentionally written in a didactic way using classic JavaScript syntax in order to be accessible to coders of all levels.

Solutions are designed with increase level of complexity.

## Today’s coding challenge

``````Create a function that will return in an array the first "nPrimes" prime numbers greater than a particular number "startAt"

``````

(scroll down for solution)

## Code newbies

If you are a code newbie, try to work on the solution on your own. After you finish it, or if you need help, please consult the provided solution.

You can solve it using functional concepts or solve it using a different algorithm... or just solve it using the latest ES innovations.

By providing a new solution you can show code newbies different ways to solve the same problem.

## Solution

``````// Solution for challenge19

println(getPrimes(10, 100));

function getPrimes(nPrimes, startAt)
{
var ar = [];

var i = startAt;

while(ar.length < nPrimes)
{
if (isPrime(i))
{
ar.push(i);
}

i++;
}

return ar;
}

// Returns true if a number is prime
function isPrime(n)
{
if (n < 2)
return false;

if (n == 2)
return true;

var maxDiv = Math.sqrt(n);

for(var i = 2; i <= maxDiv; i++)
{
if (n % i == 0)
{
return false;
}
}

return true;
}

``````

To quickly verify this solution, copy the code above in this coding editor and press "Run".

Note: The solution was originally designed for codeguppy.com environment, and therefore is making use of `println`. This is the almost equivalent of `console.log` in other environments. Please feel free to use your preferred coding playground / environment when implementing your solution.