日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問(wèn) 生活随笔!

生活随笔

當(dāng)前位置: 首頁(yè) > 编程资源 > 编程问答 >内容正文

编程问答

欧拉函数的性质及其证明

發(fā)布時(shí)間:2023/12/4 编程问答 40 豆豆
生活随笔 收集整理的這篇文章主要介紹了 欧拉函数的性质及其证明 小編覺(jué)得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.

歐拉函數(shù)

  • ppp是素?cái)?shù),則有?(p)=p?1\phi(p) = p - 1?(p)=p?1

    證明:顯然。

  • ppp是素?cái)?shù),n=pkn = p ^ kn=pk,則?(n)=pk?pk?1\phi(n) = p ^ k - p ^ {k - 1}?(n)=pk?pk?1

    證明:

    [1,n][1, n][1,n]內(nèi),ppp的約數(shù)有p,2p,3p,4p……(pk?1?1)pp, 2p, 3p, 4p……(p^{k - 1} - 1)pp,2p,3p,4p(pk?1?1)p個(gè),所以?(n)=pk?1?(pk?1?1)=pk?pk?1\phi(n) = p^k - 1 - (p ^ {k - 1} - 1) = p ^ k - p ^ {k - 1}?(n)=pk?1?(pk?1?1)=pk?pk?1

  • p,qp, qp,q是素?cái)?shù),?(pq)=?(p)??(q)\phi(pq) = \phi(p) * \phi(q)?(pq)=?(p)??(q)

    證明:

    pq?1pq - 1pq?1內(nèi)是ppp的倍數(shù)的有q?1q - 1q?1個(gè),是qqq的倍數(shù)的有p?1p - 1p?1個(gè),?(pq)=pq?1?(q?1)?(p?1)=pq?p?q?1=(p?1)(q?1)=?(p)?(q)\phi(pq) = pq - 1 - (q - 1) - (p - 1) = pq - p - q - 1 = (p - 1)(q - 1) = \phi(p)\phi(q)?(pq)=pq?1?(q?1)?(p?1)=pq?p?q?1=(p?1)(q?1)=?(p)?(q)

    拓展p,qp, qp,q互質(zhì)即可滿足條件。

  • a%p==0,p是質(zhì)數(shù)a \% p == 0, p是質(zhì)數(shù)a%p==0,p質(zhì)數(shù),則?(ap)=?(a)p\phi(ap) = \phi(a)p?(ap)=?(a)p

    證明:

    一定有a=kpna = kp^na=kpnk,pk, pk,p互質(zhì),

    ∴?(a)=?(k)?(pn)\therefore \phi(a) = \phi(k)\phi(p^n)?(a)=?(k)?(pn)

    ∴?(k)=?(a)?(an)\therefore\phi(k) = \frac{\phi(a)}{\phi(a^n)}?(k)=?(an)?(a)?

    ∵ap=kpn+1\because ap = k p ^{n + 1}ap=kpn+1

    ∴?(ap)=?(k)?(pn+1)\therefore\phi(ap) = \phi(k)\phi(p ^{n + 1})?(ap)=?(k)?(pn+1)

    ∴?(ap)=?(a)?(pn+1)?(pn)\therefore\phi(ap) = \phi(a) \frac{\phi(p ^{n + 1})}{\phi(p ^n)}?(ap)=?(a)?(pn)?(pn+1)?

    ∵?(pn+1)=pn+1?pn,?(pn)=pn?pn?1\because \phi(p ^{n + 1}) = p ^{n + 1} - p ^ n, \phi(p ^n) = p ^ n - p ^{n - 1}?(pn+1)=pn+1?pn,?(pn)=pn?pn?1

    ∴?(ap)=?(a)?(pn+1)?(pn)=?(a)pn+1?pnpn?pn?1\therefore\phi(ap) = \phi(a) \frac{\phi(p ^ {n + 1})}{\phi(p ^ n)} = \phi(a) \frac{p ^ {n + 1} - p ^ n}{p ^n - p ^ {n - 1}}?(ap)=?(a)?(pn)?(pn+1)?=?(a)pn?pn?1pn+1?pn?

    ∴?(ap)=?(a)p\therefore \phi(ap) = \phi(a)p?(ap)=?(a)p

  • n=p1a1p2a2……pnann = p_1 ^ {a_1}p_2 ^ {a_2}……p_n ^{a_n}n=p1a1??p2a2??pnan??則,?(n)=n(1?1p1)(1?1p2)……1pn\phi(n) = n(1 - \frac{1}{p_1})(1 - \frac{1}{p_2})……\frac{1}{p_n}?(n)=n(1?p1?1?)(1?p2?1?)pn?1?

    證明:

    ∵?(n)=?(p1a1)?(p2a2)……?(pnan)\because\phi(n) = \phi(p_1^{a_1})\phi(p_2^{a_2})……\phi(p_n^{a_n})?(n)=?(p1a1??)?(p2a2??)?(pnan??)

    ∴?(n)=(p1a1?p1a1?1)(p2a2?p2a2?1)……(pnan?pnan?1)\therefore\phi(n) = (p_1^{a_1} - p_1^{a_1 - 1})(p_2^{a_2} - p_2 ^{a_2 - 1})……(p_n ^{a_n} - p_n^{a_n - 1})?(n)=(p1a1???p1a1??1?)(p2a2???p2a2??1?)(pnan???pnan??1?)

    每個(gè)括號(hào)里提出一個(gè)piaip_i ^{a_i}piai???(n)=p1a1p2a2……pnan(1?1p1)(1?1p2)……1pn\phi(n) = p_1 ^ {a_1}p_2 ^ {a_2}……p_n ^{a_n}(1 - \frac{1}{p_1})(1 - \frac{1}{p_2})……\frac{1}{p_n}?(n)=p1a1??p2a2??pnan??(1?p1?1?)(1?p2?1?)pn?1?

    即證得:?(n)=n(1?1p1)(1?1p2)……1pn\phi(n) = n(1 - \frac{1}{p_1})(1 - \frac{1}{p_2})……\frac{1}{p_n}?(n)=n(1?p1?1?)(1?p2?1?)pn?1?

  • 關(guān)于歐拉函數(shù)得遞推求法

    顯然可以在歐拉素?cái)?shù)篩的同時(shí)得到歐拉函數(shù)值

    prime[j]∣iprime[j] \mid iprime[j]i時(shí),有?(i?prime[j])=?(i)?prime[j]\phi(i * prime[j]) = \phi(i) * prime[j]?(i?prime[j])=?(i)?prime[j]

    其次就是兩個(gè)互質(zhì)的情況了

    ?(i?prime[j])=?(i)?(prime[j]?1)\phi(i * prime[j]) = \phi(i) * (prime[j] - 1)?(i?prime[j])=?(i)?(prime[j]?1)

    再最后就是iii為質(zhì)數(shù)的情況了,?(i)=i?1\phi(i) = i - 1?(i)=i?1

  • nnn的所有約數(shù)的歐拉函數(shù)之和等于nnn

    證明:

  • 對(duì)于給定nnn∑i=1n?1i(gcd(i,n)==1)=n?n2\sum_{i = 1}^{n - 1}i(gcd(i, n) == 1) = \frac{n\phi{n}}{2}i=1n?1?i(gcd(i,n)==1)=2n?n?

    證明:

    顯然gcd(i,n)=1gcd(i, n) = 1gcd(i,n)=1,則有gcd(n?i,n)=1gcd(n - i, n) = 1gcd(n?i,n)=1,所以互質(zhì)數(shù)兩兩存在則有上面式子∑i=1n?1i(gcd(i,n)==1)=n?n2\sum_{i = 1}^{n - 1}i(gcd(i, n) == 1) = \frac{n\phi{n}}{2}i=1n?1?i(gcd(i,n)==1)=2n?n?成立。

  • d=gcd(a,b)d = gcd(a, b)d=gcd(a,b)?(ab)=?(a)?(b)d?(d)\phi(ab) = \frac{\phi(a)\phi(b)d}{\phi(d)}?(ab)=?(d)?(a)?(b)d?

    證明:

總結(jié)

以上是生活随笔為你收集整理的欧拉函数的性质及其证明的全部?jī)?nèi)容,希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò),歡迎將生活随笔推薦給好友。