Timeline for Print the prime factorization of the greatest common divisor of two numbers
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| May 9, 2014 at 20:46 | comment | added | kernigh |
This one is short and easy to read. It pipes the range 2..$a into a Foreach-Object loop %{...}. The loop collects the values of if($p){"$_^$p"}.
|
|
| May 8, 2014 at 14:50 | review | Low quality posts | |||
| May 8, 2014 at 14:56 | |||||
| May 8, 2014 at 14:30 | history | answered | Rynant | CC BY-SA 3.0 |