Задание 25. Информатика. ЕГЭ. Поляков-5844

Python

from math import gcd, isqrt
from itertools import combinations

def divs(n):
    d = set()
    for x in range(2, isqrt(n) + 1):
        if n % x == 0:
            d.add(x)
            d.add(n // x)
        if len(d) > 11:
            break
    return list(d)


q = 0
ans = []
for n in range(10**9, 10**8, -1):
    d = divs(n)
    if len(d) >= 6:
        d.sort()
        if all(gcd(a, b) == 1 for a, b in combinations(d[:6], 2)) \
                and gcd(*d[:6]) == 1:
            ans.append((n, max(d)))
            q += 1
    if q == 5:
        break

for n, d in ans[::-1]:
    print(n, d)

Ответ:
\(999961963 \,\, 142851709\)
\(999975431 \,\, 142853633\)
\(999978551 \,\, 90907141\)
\(999986457 \,\, 333328819\)
\(999999143 \,\, 90909013\)