JSFiddle - React, Tailwind, and code Playground

by MichelleGlauser

JavaScript

function isEvenlyDivisible(number, i) {
    return number % i === 0;
}

function isPrime(number) {
    if (number === 1) return false;
    for (var i = 2; i <= number / 2; i++) {
        if (isEvenlyDivisible(number, i)) {
            return false;
        } 
    }
    return true;
}

function findPrimeDivisors(number) {
    var results = [];
    for (var i = 2; i <= number; i++) {
        if (isEvenlyDivisible(number, i) && isPrime(i)) {
            results.push(i);
        } 
    }
    return results;
}

console.log(findPrimeDivisors(2100));