Vrijeme: 02:04

Euklidov lanac | Chain of Euclid #1

Odredi: GCD(1+2+3+\dots+(10^{99}+7), 1^2+2^2+\dots+(10^{99}+7)^2). Budući da rezultat može biti velik, ispišite ga mod 13089.

Find: GCD(1+2+3+\dots+(10^{99}+7), 1^2+2^2+\dots+(10^{99}+7)^2). Since the result might be large, write the solution mod 13089.