<jupyter_start><jupyter_text>Euler Problem 179=================Find the number of integers $1 < n < 10^7$, for which $n$ and $n + 1$ have the samenumber of positive divisors. For example, 14 has the positive divisors1, 2, 7, 14 while 15 has 1, 3, 5, 15.<jupyter_code>N = 10 ** 7
div = [1]*(N+1)
for p in range(2,N+1):
    if div[p] == 1:
        div[p] = p
        for k in range(p*p, N+1, p):
            div[k] = p
count = 0
for n in range(2, N+1):
    p = div[n]
    m = n//p
    div[n] = div[m]
    while m % p == 0:
        m //= p
    div[n] += div[m]
    count += (div[n] == div[n-1])
print(count)<jupyter_output>986262
{'fraction_non_alphanumeric': 0.19329073482428116, 'fraction_numerical': 0.0670926517571885, 'mean_word_length': 2.5828571428571427, 'pattern_counts': {'":': 0, '<': 6, '<?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': '664900', 'license': 'MIT', 'n_tokens_mistral': 291, 'n_tokens_neox': 259, 'n_words': 85, 'path': 'Euler 179 - Consecutive positive divisors.ipynb', 'repo_name': 'Radcliffe/project-euler', 'size': '626'}