Skip to main content
SpringerLink
Log in

Accurate estimation of the number of binary partitions

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Many authors have worked with the problem of binary partitions, but all estimates for the total number obtained so far are restricted to the exponential part only and hence very crude. The present paper is intended to give a final solution of the whole problem.

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

Similar content being viewed by others

References

  1. G. H. Hardy — E. M. Wright,An introduction to the theory of numbers, Clarendon Press, Oxford, 4th ed. (1959).

    Google Scholar 

  2. K. Mahler,On a Special Functional Equation, J. Lond. Math. Soc. 68 (1940), 115–123.

    Google Scholar 

  3. N. G. de Bruijn,On Mahler's Partition Problem, Proc. Kon. Ned. Akad. v. Wet. Amsterdam, 51 (1948), 659–669.

    Google Scholar 

  4. W. B. Pennington,On Mahler's Partition Problem, Annals of Math. 57 (1953), 531–546.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Sölvegatan 14 A, S-223 62, Lund, Sweden

    Carl-Erik Fröberg

Authors
  1. Carl-Erik Fröberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fröberg, CE. Accurate estimation of the number of binary partitions. BIT 17, 386–391 (1977). https://doi.org/10.1007/BF01933448

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation