Skip to main content
×
Home
    • Aa
    • Aa

Efficient implementation of the Hardy–Ramanujan–Rademacher formula

  • Fredrik Johansson (a1)
Abstract
Abstract

We describe how the Hardy–Ramanujan–Rademacher formula can be implemented to allow the partition function p(n) to be computed with softly optimal complexity O(n1/2+o(1)) and very little overhead. A new implementation based on these techniques achieves speedups in excess of a factor 500 over previously published software and has been used by the author to calculate p(1019), an exponent twice as large as in previously reported computations. We also investigate performance for multi-evaluation of p(n), where our implementation of the Hardy–Ramanujan–Rademacher formula becomes superior to power series methods on far denser sets of indices than previous implementations. As an application, we determine over 22 billion new congruences for the partition function, extending Weaver’s tabulation of 76 065 congruences. Supplementary materials are available with this article.

    • Send article to Kindle

      To send this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Efficient implementation of the Hardy–Ramanujan–Rademacher formula
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Efficient implementation of the Hardy–Ramanujan–Rademacher formula
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Efficient implementation of the Hardy–Ramanujan–Rademacher formula
      Available formats
      ×
Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1]N. Ankeny , ‘The least quadratic non residue’, Ann. of Math. (2) 55 (1952) no. 1, 6572.

[4]J. Borwein and P. Borwein , Experimental and computational mathematics: selected writings (Perfectly Scientific Press, Portland, OR, 2010) 250.

[7]N. Calkin , J. Davis , K. James , E. Perez and C. Swannack , ‘Computing the integer partition function’, Math. Comp. 76 (2007) no. 259, 16191638.

[14]P. Hagis Jr, ‘A root of unity occurring in partition theory’, Proc. Amer. Math. Soc 26 (1970) no. 4, 579582.

[18]N. Higham , Accuracy and stability of numerical algorithms, 2nd edn (SIAM, Philadelphia, 2002).

[22]D. Lehmer , ‘On the series for the partition function’, Trans. Amer. Math. Soc. 43 (1938) no. 2, 271295.

[28]K. Ono , ‘The distribution of the partition function modulo m’, Ann. of Math. (2) 151 (2000) 293307.

[30]P. Pollack , ‘The average least quadratic nonresidue modulo m and other variations on a theme of Erdős’, J. Number Theory 132 (2012) no. 6, 11851202.

[32]H. Rademacher and A. Whiteman , ‘Theorems on Dedekind sums’, Amer. J. Math. 63 (1941) no. 2, 377407.

[37]W. Watkins and J. Zeitlin , ‘The minimal polynomial of cos (2π/n)’, Amer. Math. Monthly 100 (1993) no. 5, 471474.

[38]R. Weaver , ‘New congruences for the partition function’, J. Ramanujan 5 (2001) 5363.

[39]A. Whiteman , ‘A sum connected with the series for the partition function’, Pacific J. Math. 6 (1956) no. 1, 159176.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords: