Prime Divisors

Published by Werdna in
algorithmsmathnumbers

Given a number, return all its prime divisors in an array. Create a function that takes a number as an argument and returns all its prime divisors.

To illustrate:

  • If n = 27
  • All divisors are: [3, 9, 27]
  • Finally, from that array of divisors, return the prime ones: [3]

Examples

primeDivisors(27) ➞ [3]

primeDivisors(99) ➞ [3, 11]

primeDivisors(3457) ➞ [3457]

Notes

N/A

Watch a quick demo on how Edabit works.