Prime factors

JavaScript Intermediate alien ages teen+ From CS Unplugged

The problem

Write a function primeFactors(n) that gives back the different prime numbers that divide n, smallest first. Example: 150 = 2 x 3 x 5 x 5, so it gives [2, 3, 5]. For n = 1 give back an empty list.

You will practice: helper functions, primes, loops, lists

Solve it myself Guide me step by step

Your code

Press Tab to indent. Press Esc and then Tab to move on to the next button.

Your code runs in your browser. We do not receive it or save it.

Test results

What your code printed

CC BY-SA 4.0

Adapted from a CS Unplugged programming challenge by the University of Canterbury Computer Science Education Research Group, licensed CC BY-SA 4.0.

Original challenge · License: CC BY-SA 4.0

Changes: Rewritten in our own words as a function with tests, hints and steps, in Python and JavaScript, by Open Cosmos. This version is also CC BY-SA 4.0.