prime factors js
const primeFactors = n => {
if (n < 2) return `(${n})`;
let factors = '';
for ( let i = 2; i <= n; i++) {
let count = 0;
while ( n%i === 0 ) {
count++;
n /= i;
}
if (count) {
factors += `(${i}`;
if (count > 1) factors += `**${count}`;
factors += `)`;
}
}
return factors;
}prime factors of an integer js
function primeFactors(n) {
const factors = [];
let divisor = 2;
while (n >= 2) {
if (n % divisor == 0) {
factors.push(divisor);
n = n / divisor;
} else {
divisor++;
}
}
return factors;
}
const randomNumber = Math.floor(Math.random() * 10000);
console.log('Prime factors of', randomNumber + ':', primeFactors(randomNumber).join(' '))
Run code snippetCopyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
