搜索结果: 1-2 共查到“理学 square-free numbers”相关记录2条 . 查询时间(0.049 秒)
Abstract: The main topic of this contribution is the problem of counting square-free numbers not exceeding $n$. Before this work we were able to do it in time (Comparing to the Big-O notation, Soft-O ...
An Algorithm to Generate Square-Free Numbers and to Compute the Moebius Function
Mobius function square-free numbers zeta function Riemann hypothesis
2011/9/19
Abstract: We introduce an algorithm that iteratively produces a sequence of natural numbers k_i and functions b_i. The number k_(i+1) arises as the first point of discontinuity of b_i above k_i. We de...