A Computer-Assisted Investigation of Ramanujan Pairs (Q3712372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3939418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Computer-Assisted Investigation of Ramanujan Pairs |
scientific article; zbMATH DE number 3939418 |
Statements
1986
0 references
computer search tree
0 references
Ramanujan pair
0 references
A Computer-Assisted Investigation of Ramanujan Pairs (English)
0 references
0 references
0.8768792
0 references
0.86985004
0 references
0 references
0 references
A Ramanujan pair is a pair of infinite, increasing sequences of positive integers \(\{a_i\}\), \(\{b_j\}\) for which \[ \prod (1-x^{a_i})^{-1}=1+\sum x^{b_j}/(1-x)(1-x^2)\dots(1-x^j). \] This concept was introduced by \textit{G. E. Andrews} [Aust. Math. Soc. Gaz. 6, 80--89 (1979; Zbl 0426.10016)]. The authors demonstrate four new pairs and prove that all such pairs are now known if \(a_1=1\), \(a_2\geq 5\).
0 references