• 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*}

  • 相关阅读:
    测试方案
    测试需求
    软件测试知识点总结
    自动化测试
    测试——缺陷报告包括那些内容,由什么组成
    测试——缺陷的类型
    软件测试工具简介
    测试工程师
    剑指offer系列21--二叉搜索树的后续遍历序列
    剑指offer系列20--从上到下打印二叉树
  • 原文地址:https://www.cnblogs.com/TheRoadToAu/p/7299383.html
Copyright © 2020-2023  润新知