Welcome to the ninth codegolf challenge! Factorize a number into its distinct prime factors. You must output the correct output for all integers greater than 1. 1 may not be included in the prime factorization. Shortest code wins!
Inspired by @CasTur's second NP-complete problem, I decided to make this. @TenderGalaxy, 15 blocks, winning: https://scratch.mit.edu/projects/825313990 @Raihan142857, 18 blocks (now deleted): https://scratch.mit.edu/projects/406935597/ @kc021, 23 blocks: https://scratch.mit.edu/projects/406922033/ @ethmah01, 19 blocks: https://scratch.mit.edu/projects/406747583/ @Raihan142857, 40 blocks: https://scratch.mit.edu/projects/406925075 @Null-None, 24 blocks: https://scratch.mit.edu/projects/409489137/ @mananamanma, nonworking, 16 blocks: https://scratch.mit.edu/projects/1080260809/
