<jupyter_start><jupyter_text>Euler Problem 124=================The radical of n, rad(n), is the product of distinct prime factors of n. Forexample, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.If we calculate rad(n) for 1 ≤ n ≤ 10, then sort them on rad(n), and sortingon n if the radical values are equal, we get:Let E(k) be the kth element in the sorted n column; for example, E(4) = 8 andE(6) = 9.If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000).<jupyter_code>N = 100000
K = 10000
rad = [1]*(N+1)
for p in range(2, N+1):
    if rad[p] == 1:
        for k in range(p, N+1, p):
            rad[k] *= p

print(sorted([[rad[n],n] for n in range(1,N+1)])[K-1][1])<jupyter_output>21417
{'fraction_non_alphanumeric': 0.17391304347826086, 'fraction_numerical': 0.0927536231884058, 'mean_word_length': 3.6375838926174495, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '361137', 'license': 'MIT', 'n_tokens_mistral': 323, 'n_tokens_neox': 267, 'n_words': 109, 'path': 'Euler 124 - Ordered radicals.ipynb', 'repo_name': 'Radcliffe/project-euler', 'size': '690'}