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.

 

On a certain (mod $2$) identity and a method of proof by expansion
HTML articles powered by AMS MathViewer

by Richard Blecksmith, John Brillhart and Irving Gerst PDF
Math. Comp. 56 (1991), 775-794 Request permission

Abstract:

We prove the congruence \[ \prod \limits _{\begin {array}{*{20}{c}} {n = 1} \\ {n \nequiv 7\;\pmod {14}} \\ \end {array} }^\infty {(1 - {x^n}) \equiv \sum \limits _{ - \infty }^\infty {({x^{n(3n + 2)}} + {x^{7n(3n + 2) + 2}})\;\pmod 2} } \] by first establishing a related equation, which reduces to the congruence modulo 2. The method of proof (called "expanding zero") is based on a formula of the authors for expanding the product of two triple products. A second proof of the result more fully explicates the various aspects of the method. A parity result for an associated partition function is also included.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11P83
  • Retrieve articles in all journals with MSC: 11P83
Additional Information
  • © Copyright 1991 American Mathematical Society
  • Journal: Math. Comp. 56 (1991), 775-794
  • MSC: Primary 11P83
  • DOI: https://doi.org/10.1090/S0025-5718-1991-1068825-2
  • MathSciNet review: 1068825