Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-19T21:26:43.608Z Has data issue: false hasContentIssue false
  • English
  • Français

AN UPPER BOUND FOR THE NUMBER OF ODD MULTIPERFECT NUMBERS

Published online by Cambridge University Press:  28 January 2013

PINGZHI YUAN
PINGZHI YUAN*
Affiliation:
School of Mathematics, South China Normal University, Guangzhou 510631, PR China
*
yuanpz@scnu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A natural number $n$ is called $k$-perfect if $\sigma (n)= kn$. In this paper, we show that for any integers $r\geq 2$ and $k\geq 2$, the number of odd $k$-perfect numbers $n$ with $\omega (n)\leq r$ is bounded by $\left({\lfloor {4}^{r} { \mathop{ \log } \nolimits }_{3} 2\rfloor + r\atop r} \right){ \mathop{ \sum } \nolimits }_{i= 1}^{r} \left({\lfloor kr/ 2\rfloor \atop i} \right)$, which is less than ${4}^{{r}^{2} } $ when $r$ is large enough.

Keywords

odd perfect numbersk-perfect numbers
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 89 , Issue 1 , February 2014 , pp. 1 - 4
Copyright
©2013 Australian Mathematical Publishing Association Inc. 

References

Chen, S. C. and Luo, H., ‘Bounds for odd $k$-perfect numbers’, Bull. Aust. Math. Soc. 84 (3) (2011), 475–480.CrossRefGoogle Scholar
Cook, R. J., ‘Bounds for odd perfect numbers’, in: Number Theory (Ottawa, ON, 1996), CRM Proceedings & Lecture Notes, 19 (American Mathematical Society, Providence, RI, 1999), pp. 67–71.Google Scholar
Dai, L. X., Pan, H. and Tang, C., ‘Note on odd multiperfect numbers’, Bull. Aust. Math. Soc., to appear.Google Scholar
Dickson, L. E., ‘Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors’, Amer. J. Math. 35 (1913), 413–422.CrossRefGoogle Scholar
Heath-Brown, D. R., ‘Odd perfect numbers’, Math. Proc. Cambridge Philos. Soc. 115 (1994), 191–196.CrossRefGoogle Scholar
Nielsen, P., ‘An upper bound for odd perfect numbers’, Integers: Electronic J. Comb. Number Theory 3 (2003), A14, 9 pp. (electronic).Google Scholar
Pollack, P., ‘On Dickson’s theorem concerning odd perfect numbers’, Amer. Math. Monthly 118 (2011), 161–164.CrossRefGoogle Scholar
Pomerance, C., ‘Multiply perfect numbers, Mersenne primes and effective computability’, Math. Ann. 226 (1977), 195–206.CrossRefGoogle Scholar
Wirsing, E., ‘Bemerkung zu der Arbeit über vollkommene Zahlen’, Math. Ann. 137 (1959), 316–318.CrossRefGoogle Scholar