JSFiddle - React, Tailwind, and code Playground

by MichelleGlauser

JavaScript

var numBer = 18;

function findDivisors(numBer) {
    var results = [];
    for (var i = 1; i <= numBer; i++) {
        if (numBer % i === 0 && isPrime(i)) {
            results.push(i);
        }
    }
    return results;
}

findDivisors(numBer);

function isPrime(i) {
    if (
    return true;
}