Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

得到F(n)的积性剩下的就很简单了

Posted by Ruby931031 at 2012-09-21 23:21:35 on Problem 2480
关键是积性函数怎么证明。其实应该是两个积性函数的Dirichlet卷积仍是积性函数,
我看到的大多数人的“证明”都是说:gcd(i,n)是积性函数,积性函数的和函数也是积性函数,
所以Sigma(gcd(i,N)| 1<=i<=n)也是积性的。
麻烦这些人先弄明白和函数是什么好伐?不如直接说根据直觉F(n)是积性函数好了。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator