Write a function to take a positive integer and a prime number as an input and return true if the prime factors of the given positive integer are less than the given prime number
Example :
hasLessPrimeFactor(20,5) should return true because Prime Factors of a Number: 20 = 2 X 2 X 5
**I have implemented following JS code for above question. But it has some error. **
Appropriate if anyone can help me.
function checkPrime (i){
let isPrime = true;
for (let j = 2; j <= i / 2; j++) {
if (i % j == 0) {
isPrime = false;
}else{
isPrime = true;
}
}
return isPrime;
}
function hasLessPrimeFactor(value, primenum) {
let returnValue = false,
number = value,
primeArray = [1];
for (let i = 2; i <= number/2; i++) {
if (number % i == 0) {
let isPrime = checkPrime(i);
if (isPrime){
number /= i;
primeArray.push(i);
}
}
}
if(checkPrime(value)){
primeArray.push(number);
}
if (primeArray[primeArray.length-1] >= primenum){
returnValue = true;
}
return returnValue;
}