Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Finite differences of the partition function
HTML articles powered by AMS MathViewer

by Hansraj Gupta PDF
Math. Comp. 32 (1978), 1241-1243 Request permission

Abstract:

From the Hardy-Ramanujan-Rademacher formula for $p(n)$—the number of unrestricted partitions of n, it is not difficult to deduce that there exists a least positive integer ${n_0}(r)$ such that ${V^r}p(n) \geqslant 0$ for each $n \geqslant {n_0}(r)$, where $Vp(n) = p(n) - p(n - 1)$ and ${V^r}p(n) = V\{ {V^{r - 1}}p(n)\}$. In this note, we give values of ${n_0}(r)$ for each $r \leqslant 10$ and conjecture that ${n_0}(r)/{r^3}\sim 1$.
References
  • Hansraj Gupta, Two theorems in partitions, Indian J. Math. 14 (1972), 7–8. MR 327653
  • H. GUPTA, C. E. GWYTHER & J. C. P. MILLER, Tables of Partitions, University Press, Cambridge, 1958.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10A45
  • Retrieve articles in all journals with MSC: 10A45
Additional Information
  • © Copyright 1978 American Mathematical Society
  • Journal: Math. Comp. 32 (1978), 1241-1243
  • MSC: Primary 10A45
  • DOI: https://doi.org/10.1090/S0025-5718-1978-0480319-5
  • MathSciNet review: 0480319