Skip to main content
Log in

Sharp bounds for the partition function of integer sequences

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

By means of a new criterion for higher multiplicities of additive representations of integers as sums of distinct terms of a fixed integer sequence sharp bounds are determined for the partition function of many sequences with the aid of a computer.

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

Access this article

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

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. P. L. Chebyshev,Mémoire sur les nombres premiers, J. Math. Pures Appl. (1) 17 (1852), 366–390.

    Google Scholar 

  2. R. Breusch,Zur Verallgemeinerung des Bertrandschen Postulates, daß zwischen x und 2x stets Primzahlen liegen, Math. Z. 34 (1932), 505–526.

    Article  Google Scholar 

  3. K. Molsen,Zur Verallgemeinerung des Bertrandschen Postulates, Deutsche Math. 6 (1941), 248–256.

    Google Scholar 

  4. R. Sprague,Über Zerlegungen in ungleiche Quadratzahlen, Math. Z. 51 (1948), 289–290.

    Article  Google Scholar 

  5. R. Sprague,Über Zerlegungen in n-te Potenzen mit lauter verschiedenen Grundzahlen, Math. Z. 51 (1948), 466–468.

    Article  Google Scholar 

  6. H.-E. Richert,Über Zerfällungen in ungleiche Primzahlen, Math. Z. 52 (1949), 342–343.

    Google Scholar 

  7. H.-E. Richert,Über Zerlegungen in paarweise verschiedene Zahlen, Norsk Mat. Tidsskr. 31 (1949), 120–122.

    Google Scholar 

  8. K. F. Roth and G. Szekeres,Some asymptotic formulae in the theory of partitions, Quart. J. Math. Oxford Ser. (2) 5 (1954), 241–259.

    Google Scholar 

  9. W. Sierpinski,Sur une propriété des nombres naturels, Ann. Mat. Pura Appl. 39 (1955), 69–74.

    Google Scholar 

  10. B. J. Birch,Note on a problem of Erdös, Proc. Cambridge Phil. Soc. 55 (1959), 370–373.

    Google Scholar 

  11. J. W. S. Cassels,On the representation of integers as the sums of distinct summands taken from a fixed set, Acta Sci. Math. (Szeged) 21 (1960), 111–124.

    Google Scholar 

  12. A. Makowski,Partitions into unequal primes, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 8 (1960), no. 3, 125–126.

    Google Scholar 

  13. J. B. Rosser and L. Schoenfeld,Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94.

    Google Scholar 

  14. P. Erdös,On the representation of large integers as sums of distinct summands taken from a fixed set, Acta Arith. 7 (1962), 345–354.

    Google Scholar 

  15. W. Sierpiński,Elementary Theory of Numbers, Polska Akademia Nauk, Monografie Matematyczne, Tom 42, Warszawa, 1964.

    Google Scholar 

  16. J. Folkman,On the representation of integers as sums of distinct terms from a fixed sequence, Canad. J. Math. 18 (1966), 643–655.

    Google Scholar 

  17. R. E. Dressler,A stronger Bertrand's postulate with an application to partitions, Proc. Amer. Math. Soc. 33 (1972), no. 2, 226–228.

    Google Scholar 

  18. R. E. Dressler,Addendum to ‘A stronger Bertrand's postulate with an application to partitions’, Proc. Amer. Math. Soc. 38 (1973), no. 3, 667.

    Google Scholar 

  19. R. E. Dressler,Sums of distinct primes, Nordisk Mat. Tidsskr. 21 (1973), 31–32.

    Google Scholar 

  20. R. E. Dressler and T. Parker,12758, Math. Comp. 28 (1974), no. 125, 313–314.

    Google Scholar 

  21. R. E. Dressler, A. Makowski and T. Parker,Sums of distinct primes from congruence classes modulo 12, Math. Comp. 28 (1974), no. 126, 651–652.

    Google Scholar 

  22. R. E. Dressler and T. Parker,Primes with a prime subscript, J. Assoc. Comput. Mach. 22 (1975), no. 3, 380–381.

    Google Scholar 

  23. R. E. Dressler, L. Pigno and R. Young,Sums of squares of primes, Nordisk Mat. Tidsskr. 24 (1976), 39–40.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mayer, D.C. Sharp bounds for the partition function of integer sequences. BIT 27, 98–110 (1987). https://doi.org/10.1007/BF01937358

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

1980 Mathematics Subject Classification

Navigation