1986
DOI: 10.1090/s0025-5718-1986-0829643-9
|View full text |Cite
|
Sign up to set email alerts
|

A computer-assisted investigation of Ramanujan pairs

Abstract: Abstract. Four new Ramanujan pairs {a,}, {6,} are given along with the theorem that no such pairs exist with at = 1 and a2 = s for any í > 5. All finite Ramanujan pairs are determined and their significance in bounding the local branching degree in the search tree for such pairs is discussed. The search techniques and programs that were used are also described. The parity of the coefficients in the power series is determined in two of the new identities. Partition interpretations of the six recent identities a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
7
0

Year Published

1987
1987
2012
2012

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…An Expansion Formula. We now establish a useful expansion formula for the product of two general T-functions defined in (2) Proof. Let…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…An Expansion Formula. We now establish a useful expansion formula for the product of two general T-functions defined in (2) Proof. Let…”
Section: Preliminariesmentioning
confidence: 99%
“…Applying Theorem 2 with ki -2, ¿i = 0, pi = 2 and k2 = l2 = p2 = 1, the separability condition is satisfied with a = 2, 6 = 1, and m = 3. Taking R = {0,1, -1}, we find, after some simplification, that r1(2,0;2)T1(l,l;l) = r1 (6,2)[To(3,l;3)-2;-1ro(3,-l;3)] oo = (o)4 y x3n2+n(z3n -z-3"-1).…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…In [1] two such results were established, namely: (1) T[(l-x"y1=txe(n)(mod2) «SS -or, for S = {« e N: « = +(2,3,4,5,6,7) (mod20)}, e(n) = n(5n + l)/2 and 5 = {« g N: « = +(1,2,5,6,8,9) (mod20)}, e(n) = n(5n + 3)/2 respectively. (See entries 4 and 5 in Table 1 below.)…”
mentioning
confidence: 99%
“…(See entries 4 and 5 in Table 1 below.) In this paper we present a collection of parity results (obtained by using the methods discussed in [1]), which have been discovered over the last two years on an IBM Personal Computer and the Data General Eclipse S/230 at the Mathematics Department of the University of Arizona (see [2]). …”
mentioning
confidence: 99%