Finds the prime factors of a given number using the trial division algorithm.

const primeFactors = n => {
 let a = [],
 f = 2;
 while (n > 1) {
 if (n % f === 0) {
 a.push(f);
 n /= f;
 } else {
 f++;
 }
 }
 return a;
};

primeFactors(147); // [3, 7, 7]

Finds the prime factors of a given number using the trial division algorithm.
<ul>
<li>Use a <code class="notranslate">while</code> loop to iterate over all possible prime factors, starting with <code class="notranslate">2</code>.</li>
<li>If the current factor, <code class="notranslate">f</code>, exactly divides <code class="notranslate">n</code>, add <code class="notranslate">f</code> to the factors array and divide <code class="notranslate">n</code> by <code class="notranslate">f</code>. Otherwise, increment <code class="notranslate">f</code> by one.</li>
</ul>

Prime factors of number

Recommended snippets

Primes up to given number

Luhn check

Arithmetic progression