Project Euler 124 - Ordered Radicals

Official link: https://projecteuler.net/problem=124

Thought Process

Very simple problem!

Have a function rad(n) which takes the unique prime factors of n and multiplies them

Loop from 1 to 100000:
append([rad(prime_factor(n)), n]) to a list

Then we can sort the list and output lisst[9999]

Generate unique prime factors using Prime Factors Function

Interactive Code

Enter a number (yourinput)

Code will output E(yourinput)