zoukankan      html  css  js  c++  java
  • tesuto-Mobius

    求 egin{equation*}sum_{i=1}^nsum_{j=1}^m[gcd(i,j)=k]end{equation*} 的值.

    莫比乌斯反演吧.

    egin{align*}
    &=sum_{i=1}^{leftlfloorfrac n k ight floor}sum_{j=1}^{leftlfloorfrac m k ight floor}sum_{d|gcd(i,j)=1}mu(d)\
    &=sum_{i=1}^{leftlfloorfrac n k ight floor}sum_{j=1}^{leftlfloorfrac m k ight floor}sum_{d|gcd(i,j)=1}mu(d)\
    &=sum_{i=1}^{leftlfloorfrac n k ight floor}sum_{j=1}^{leftlfloorfrac m k ight floor}sum_{d|i}sum_{d|j}mu(d)\
    &=sum_{i=1}^{leftlfloorfrac n k ight floor}sum_{d|i}sum_{j=1}^{leftlfloorfrac m k ight floor}sum_{d|j}mu(d)\
    &=sum_{d=1}^{minleft(leftlfloorfrac n k ight floor,leftlfloorfrac m k ight floor ight)}mu(d)sum_{i=1}^{leftlfloorfrac n k ight floor}sum_{d|i}sum_{j=1}^{leftlfloorfrac m k ight floor}sum_{d|j}1\
    &=sum_{d=1}^{minleft(leftlfloorfrac n k ight floor,leftlfloorfrac m k ight floor ight)}mu(d)sum_{i=1}^{leftlfloorfrac n k ight floor}sum_{d|i}1sum_{j=1}^{leftlfloorfrac m k ight floor}sum_{d|j}1\
    &=sum_{d=1}^{minleft(leftlfloorfrac n k ight floor,leftlfloorfrac m k ight floor ight)}mu(d)leftlfloorfrac{leftlfloorfrac n k ight floor}d ight floorleftlfloorfrac{leftlfloorfrac m k ight floor}d ight floor\
    &=sum_{d=1}^{minleft(leftlfloorfrac n k ight floor,leftlfloorfrac m k ight floor ight)}mu(d)leftlfloorfrac n{kd} ight floorleftlfloorfrac m{kd} ight floor\
    end{align*}

  • 相关阅读:
    打印机无法打印文件
    .Net com组件操作excel(不建议采用Com组件操作excel)
    Zebra
    Map遍历方式
    PageHelper原理
    MySQL8.0新特性
    算法_插入排序
    贝叶斯定理
    二叉树学习笔记
    Java校验时间段重叠
  • 原文地址:https://www.cnblogs.com/TheRoadToAu/p/7299383.html
Copyright © 2011-2022 走看看