¶ 定理
对于d, j, k ∈ N, d < = N,
¶ 证明
根据取整运算的定义,
由于j ∈ N,所以
综上,
¶ 推论
对于i, k ∈ N, i ≤ k,使得
¶ 例题
bzoj1257 数论分块¶ 参考
https://www.cnblogs.com/BeautifulWater/p/15943427.html
但是里面的数论分块证明只证明了必要性。
对于d, j, k ∈ N, d < = N,
根据取整运算的定义,
由于j ∈ N,所以
综上,
对于i, k ∈ N, i ≤ k,使得
https://www.cnblogs.com/BeautifulWater/p/15943427.html
但是里面的数论分块证明只证明了必要性。
Except as otherwise noted, this blog is licensed under CC BY-SA 4.0 License.
©2021-
searchstar
|
pv
|
uv
Theme Tree
by Wu Jun
Powered by Hexo