5 kyu
Primes in numbers
3,947 of 30,365g964
Description:
Given a positive number n > 1 find the prime factor decomposition of n. The result will be a string with the following form :
"(p1**n1)(p2**n2)...(pk**nk)"
with the p(i) in increasing order and n(i) empty if n(i) is 1.
Example: n = 86240 should return "(2**5)(5)(7**2)(11)"
Fundamentals
Mathematics
Similar Kata:
Stats:
| Created | Feb 6, 2015 |
| Published | Feb 6, 2015 |
| Warriors Trained | 109237 |
| Total Skips | 38233 |
| Total Code Submissions | 145541 |
| Total Times Completed | 30365 |
| Java Completions | 3947 |
| Ruby Completions | 844 |
| Python Completions | 10355 |
| C# Completions | 1809 |
| Clojure Completions | 120 |
| JavaScript Completions | 6105 |
| Haskell Completions | 265 |
| CoffeeScript Completions | 21 |
| C++ Completions | 2466 |
| PHP Completions | 748 |
| Crystal Completions | 7 |
| Swift Completions | 299 |
| C Completions | 768 |
| TypeScript Completions | 745 |
| Rust Completions | 742 |
| R Completions | 77 |
| Shell Completions | 47 |
| F# Completions | 51 |
| OCaml Completions | 28 |
| Elixir Completions | 85 |
| Groovy Completions | 17 |
| Julia Completions | 62 |
| Scala Completions | 171 |
| PowerShell Completions | 30 |
| Go Completions | 673 |
| Nim Completions | 19 |
| Racket Completions | 24 |
| Reason Completions | 3 |
| Kotlin Completions | 327 |
| Prolog Completions | 12 |
| Haxe Completions | 4 |
| Dart Completions | 199 |
| Pascal Completions | 9 |
| Lua Completions | 60 |
| Perl Completions | 9 |
| Elm Completions | 4 |
| D Completions | 8 |
| COBOL Completions | 4 |
| Erlang Completions | 5 |
| Total Stars | 2052 |
| % of votes with a positive feedback rating | 90% of 3138 |
| Total "Very Satisfied" Votes | 2610 |
| Total "Somewhat Satisfied" Votes | 451 |
| Total "Not Satisfied" Votes | 77 |
