gistfile1.txt

function checkIfPrime(number){
for( something = 2; something <= Math.sqrt(number); something++)
if( number % something == 0) return 0; 
return 1; 
}
 
function findPrimeFactors(number) { 
 
//find prime numbers less than the number 
for( i = Math.floor(number/2); i >=2 ; i--) 
if ( number % i == 0) 
    if (checkIfPrime(i) == 1)return i; 

}