Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 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;
- }
Add Comment
Please, Sign In to add comment