Marcythm-Archive / gitalk

1 stars 0 forks source link

「Project Euler 530」GCD of Divisors | Trisolaris's Blog #27

Open Marcythm opened 5 years ago

Marcythm commented 5 years ago

https://blog.trisolaris.top/%E3%80%8CProject-Euler-530%E3%80%8DGCD-of-Divisors/

Problem Description 定义 f\left(n\right) : f\left(n\right)=\sum_{d\mid n}\left(d,\frac{n}{d}\right) 定义 F\left(n\right)