跳转到内容

Hemiperfect數

维基百科,自由的百科全书

Hemiperfect數hemiperfect number)是指一正整數過剩指數為奇數除以2,過剩指數(abundancy index)就是除數函數(包括本身的所有正因數和)除以正整數後的結果。

針對一大於2的奇數 k,一正整數nk-hemiperfect數,若且唯若除數函數σ(n))等於k/2 × n

最小的k-hemiperfect數

[编辑]

下表列出在k ≤ 17範圍內.各k值下k-hemiperfect數的最小值(OEIS數列A088912)。

k 最小的k-hemiperfect數
3 2(也是唯一的3-hemiperfect數)
5 24
7 4320
9 8910720
11 17116004505600
13 170974031122008628879954060917200710847692800
15 12749472205565550032020636281352368036406720997031277595140988449695952806020854579200000[1]
17 27172904004644864174776390325441204588387876949911859015099963347683477337589882757168182488651338324482275518065870009252589097916253652597707421065171952334010184222064839170719744000000000[1]

例如24的除數函數為24的5/2倍.因此24為5-hemiperfect數:

1 + 2 + 3 + 4 + 6 + 8 + 12 + 24 = 60 = 5/2 × 24.

參考資料

[编辑]
  1. ^ 1.0 1.1 Number Theory. Numericana.com. [2012-08-21]. (原始内容存档于2017-05-17). 

外部連結

[编辑]

整數數列線上大全(OEIS)中有包括以下k較小的k-hemiperfect數

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy