Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
ǐ Just the built-in. But that's boring, so
K~æ~Ǒ$ẋf K~æ~Ǒ$ẋfʀ~æ~Ǒ$ẋf K~æʀ~æ # From the divisorsall ofnumbers in the inputrange [0, input], keep only those that are prime ~Ǒ # Without popping anything, get the multiplicity of each prime divisor - this leaves the stack as [divisors, multiplicities] $ẋ # Swap the two items and repeat each divisor multiplicity times f # Flatten and output that ǐ Just the built-in. But that's boring, so
K~æ~Ǒ$ẋf K~æ~Ǒ$ẋf K~æ # From the divisors of the input, keep only those that are prime ~Ǒ # Without popping anything, get the multiplicity of each prime divisor - this leaves the stack as [divisors, multiplicities] $ẋ # Swap the two items and repeat each divisor multiplicity times f # Flatten and output that ǐ Just the built-in. But that's boring, so
K~æ~Ǒ$ẋf ʀ~æ~Ǒ$ẋf ʀ~æ # From the all numbers in the range [0, input], keep only those that are prime ~Ǒ # Without popping anything, get the multiplicity of each prime divisor - this leaves the stack as [divisors, multiplicities] $ẋ # Swap the two items and repeat each divisor multiplicity times f # Flatten and output that ǐ Just the built-in. But that's boring, so
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;fK~æ~Ǒ$ẋf Try it Online at your own risk!
It is horrendously slow for large numbers, but it worksTry it Online!
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;fK~æ~Ǒ$ẋf ʀǎ K~æ # nth prime for each item inFrom the rangedivisors [0of ...the input - 1] :£ , keep #only putthose that into the register while leaving it on theare stackprime $vǑ ~Ǒ # Without popping #anything, get the divisbiltymultiplicity of each prime into the input ¥Z # anddivisor zip- thatthis withleaves the register ƛ ; # for each item in that zipped list: (each item is: [divisbilty, prime factor]) ÷w # stack pushas divisbilty[divisors, [prime_factor]multiplicities] $ẋ # Swap the two items and repeat [prime_factor]each divisibilitydivisor multiplicity times f # flatten theFlatten unholyand messoutput that results from doing the above ǐ Just the built-in. But that's boring, so
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f Try it Online at your own risk!
It is horrendously slow for large numbers, but it works
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f ʀǎ # nth prime for each item in the range [0 ... input - 1] :£ # put that into the register while leaving it on the stack $vǑ # get the divisbilty of each prime into the input ¥Z # and zip that with the register ƛ ; # for each item in that zipped list: (each item is: [divisbilty, prime factor]) ÷w # push divisbilty, [prime_factor] $ẋ # and repeat [prime_factor] divisibility times f # flatten the unholy mess that results from doing the above ǐ Just the built-in. But that's boring, so
K~æ~Ǒ$ẋf K~æ~Ǒ$ẋf K~æ # From the divisors of the input, keep only those that are prime ~Ǒ # Without popping anything, get the multiplicity of each prime divisor - this leaves the stack as [divisors, multiplicities] $ẋ # Swap the two items and repeat each divisor multiplicity times f # Flatten and output that 
ǐ Just the built-in. But that's boring, so
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f Try it Online at your own risk!
It is horrendously slow for large numbers, but it works
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f ʀǎ # nth prime for each item in the range [0 ... input - 1] :£ # put that into the register while leaving it on the stack $vǑ # get the divisbilty of each prime into the input ¥Z # and zip that with the register ƛ ƛ ; # for each item in that zipped list: (each item is: [divisbilty, prime factor]) ÷w ÷w # push divisbilty, [prime_factor] $ẋ $ẋ # and repeat [prime_factor] divisibility times f # flatten the unholy mess that results from doing the above ǐ Just the built-in. But that's boring, so
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f Try it Online at your own risk!
It is horrendously slow for large numbers, but it works
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f ʀǎ # nth prime for each item in the range [0 ... input - 1] :£ # put that into the register while leaving it on the stack $vǑ # get the divisbilty of each prime into the input ¥Z # and zip that with the register ƛ ; # for each item in that zipped list: (each item is: [divisbilty, prime factor]) ÷w # push divisbilty, [prime_factor] $ẋ # and repeat [prime_factor] divisibility times f # flatten the unholy mess that results from doing the above ǐ Just the built-in. But that's boring, so
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f Try it Online at your own risk!
It is horrendously slow for large numbers, but it works
ʀǎ:£$vǑ¥Zƛ÷w$ẋ;f ʀǎ # nth prime for each item in the range [0 ... input - 1] :£ # put that into the register while leaving it on the stack $vǑ # get the divisbilty of each prime into the input ¥Z # and zip that with the register ƛ ; # for each item in that zipped list: (each item is: [divisbilty, prime factor]) ÷w # push divisbilty, [prime_factor] $ẋ # and repeat [prime_factor] divisibility times f # flatten the unholy mess that results from doing the above