List the prime factors for the input number, in decreasing order. List each factor only once, even if the factorization includes it multiple times.
Examples:
in = 137 ---> out = 137
in = 876 ---> out = [73 3 2]
Solution Stats
Problem Comments
Solution Comments
-
1 Comment
Brian
on 16 Jul 2015
love the "unique" command!
-
2 Comments
li haitao
on 30 Nov 2012
Do not cheat yourself,OK?
the cyclist
on 1 Dec 2012
I added additional cases to the test suite, so this attempted solution is incorrect now.
Recent Solvers749
Suggested Problems
-
513 Solvers
-
Count from 0 to N^M in base N.
199 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
735 Solvers
-
170 Solvers
-
162 Solvers
More from this Author23
Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)