Welcome, Guest!
Sign Up
Login
RSS
Clever Space
Friday, 11.22.2024
Main
»
2013
»
November
»
25
【数论】SPOJ—LCMSUM
又是一道恶心的数论题
定理:对于n(n>2),满足≤n 且与n互质的数的和 s=n*phi(n)/2。
简单证明:考虑与n不互质的数a,那么容易证明n-a也与n不互质。
也就是说,不互质的数能够组成和为n的一组。
...
Read more »
Views:
385
|
Added by:
dhy0077
|
Date:
11.25.2013
Site menu
Home page
Site info
Blog
Forum
Photo Albums
Chat Room
Voice Board
Our Stats
FAQ
Login form
Entries archive
2013 August
2013 September
2013 October
2013 November
2013 December
2014 January
2014 March
2014 April
2014 May
2014 June
2014 July
2014 August
2014 September
2014 November
Visitors
メタトレーダー
Calendar
«
November 2013
»
Su
Mo
Tu
We
Th
Fr
Sa
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30