ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Colossally abundant number - Wikipedia, the free encyclopedia

Colossally abundant number

From Wikipedia, the free encyclopedia

Divisibility-based
sets of integers
Form of factorization:
Prime number
Composite number
Powerful number
Square-free number
Achilles number
Constrained divisor sums:
Perfect number
Almost perfect number
Quasiperfect number
Multiply perfect number
Hyperperfect number
Superperfect number
Unitary perfect number
Semiperfect number
Primitive semiperfect number
Practical number
Numbers with many divisors:
Abundant number
Highly abundant number
Superabundant number
Colossally abundant number
Highly composite number
Superior highly composite number
Other:
Deficient number
Weird number
Amicable number
Friendly number
Sociable number
Solitary number
Sublime number
Harmonic divisor number
Frugal number
Equidigital number
Extravagant number
See also:
Divisor function
Divisor
Prime factor
Factorization
This box: view  talk  edit

In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a certain kind of natural number. Formally, a number n is colossally abundant if and only if there is an ε > 0 such that for all k > 1,

\frac{\sigma(n)}{n^{1+\varepsilon}}\geq\frac{\sigma(k)}{k^{1+\varepsilon}}

where σ denotes the divisor function. The first few colossally abundant numbers are 2, 6, 12, 60, 120, 360, 2520, 5040, ... (sequence A004490 in OEIS); all colossally abundant numbers are also superabundant numbers, but the converse is not true.

Contents

[edit] Properties

All colossally abundant numbers are Harshad numbers.

[edit] Relation to the Riemann hypothesis

If the Riemann hypothesis is false, a colossally abundant number will be a counterexample. In particular, the RH is equivalent to the assertion that the following inequality is true for n > 5040:

\sigma(n)<\exp(\gamma) \cdot n \log\log n

where γ is the Euler–Mascheroni constant.

This result is due to Robin[1].

Lagarias[2] and Smith[3] discuss this and similar formulations of the RH.

[edit] References

  1. ^ G. Robin, "Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann", Journal de Mathématiques Pures et Appliquées 63 (1984), pp. 187-213.
  2. ^ J. C. Lagarias, An elementary problem equivalent to the Riemann hypothesis, American Mathematical Monthly 109 (2002), pp. 534-543.
  3. ^ Warren D. Smith, A "good" problem equivalent to the Riemann hypothesis, 2005

[edit] External links

Languages


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -