Find Prime Factor (ModExp)

HTML

<script src="cj03cobra"></script>
<div id="output"></div>03cobra

JavaScript

var output = document.getElementById('output');
function print(x){
    output.innerHTML += x;
}

var primes = [];
function isPrime(n){
    for (var i = 0; i < primes.length; i++){
        if (n % primes[i] === 0) {
            return false;
        }
    }
    primes.push(n);
    return true;
}


function modularExp(base, exponent, modulus){
    var result = 1;
    for (var i = 0; i < exponent; i++){
        result = (result * base) % modulus;
    }
    return result;
}

function findPrimeFactor(base, exponent, limit) {
    for (var i = 2; i < limit; i++) {
        if (isPrime(i)) {
            if (modularExp(base, exponent, i) === 1){
                print('solution: ' + i + '<br/>');
                break;
            }
        }
    }
}

findPrimeFactor(2, 5903, 1<<15);