Skip to main content
SpringerLink
Log in

Multiply perfect numbers, mersenne primes, and effective computability

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Anderson, C. W.: Problem 5949. American Math. Monthly81, 90 (1974)

    Google Scholar 

  2. Anderson, C. W.: The solutions of Σ(n) = σ(n)/n =a/b, Φ(n) = ϕ(n)/n =a/b, and related considerations. Unpublished manuscript

  3. Artuhov, M. M.: On the problem ofh-fold perfect numbers. Acta. Arith.23, 249–255 (1973)

    Google Scholar 

  4. Artuhov, M. M.: On some problems in the theory of amicable numbers (Russian). Acta Arith.27, 281–291 (1975)

    Google Scholar 

  5. Baker, A.: Linear forms in the logarithms of algebraic numbers (IV). Mathematika15, 204–216 (1968)

    Google Scholar 

  6. Bang, A. S.: Taltheoretiske Undersøgelser. Tidsskrift Math.5, 70–80, 130–137 (1886)

    Google Scholar 

  7. Borho, W.: Befreundete Zahlen mit gegebener Primteileranzahl. Math. Ann.209, 183–193 (1974)

    Google Scholar 

  8. Borho, W.: Eine Schranke für befreundete Zahlen mit gegebener Teileranzahl. Math. Nach.63, 297–301 (1974)

    Google Scholar 

  9. Dickson, L. E.: Finiteness of the odd perfect and primitive abundant numbers withn distinct prime factors. Am. J. Math.35, 413–422 (1913)

    Google Scholar 

  10. Gradstein, I. S.: On odd perfect numbers (Russian). Mat. Sb.32, 476–510 (1925)

    Google Scholar 

  11. Hornfeck, B., Wirsing, E.: Über die Häufigkeit vollkommener Zahlen. Math. Ann.133, 431–438 (1957) (also see [17])

    Google Scholar 

  12. Kanold, H.-J.: Über einen Satz von L. E. Dickson II. Math. Ann.132, 246–255 (1956)

    Google Scholar 

  13. Nagell, T.: Introduction to Number Theory. New York 1964

  14. Shapiro, H. N.: Note on a theorem of Dickson. Bull. Amer. Math. Soc.55, 450–452 (1949)

    Google Scholar 

  15. Shapiro, H. N.: On primitive abundant numbers. Comm. Pure Appl. Math.21, 111–118 (1968)

    Google Scholar 

  16. Steuerwald, R.: Ein Satz über natürliche Zahlen mit σ(N) = 3N. Arch. Math.5, 449–451 (1954)

    Google Scholar 

  17. Wirsing, E.: Bemerkung zu der Arbeit über vollkommene Zahlen. Math. Ann.137, 316–318 (1959)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Georgia, 30602, Athens, GA, USA

    Carl Pomerance

Authors
  1. Carl Pomerance
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

In memory of C. W. Anderson (1945–1974)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pomerance, C. Multiply perfect numbers, mersenne primes, and effective computability. Math. Ann. 226, 195–206 (1977). https://doi.org/10.1007/BF01362422

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01362422

Keywords

Search

Navigation