THE DETERMINATION OF RAMANUJAN PAIRS.
| dc.contributor.author | BLECKSMITH, RICHARD FRED. | |
| dc.creator | BLECKSMITH, RICHARD FRED. | en_US |
| dc.date.accessioned | 2011-10-31T18:23:12Z | en |
| dc.date.available | 2011-10-31T18:23:12Z | en |
| dc.date.issued | 1983 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/186902 | en |
| dc.description.abstract | We call two increasing sequences of positive integers {aᵢ}, {b(j)} a "Ramanujan Pair" if the following identity holds: (DIAGRAM, TABLE OR GRAPHIC OMITTED...PLEASE SEE DAI). The goal of this investigation is to determine all Ramanujan Pairs. Although this goal was not completely reached, we have determined all pairs for which the first term a₁ ≥ 5 and have proved that any Ramanujan Pair which begins with a₁ = m, where 1 ≤ m ≤ 4, aside from the known pairs, would have to branch off the first Euler identity with {aᵢ} = {i + m - 1}, {b(j)} = {j m}. A great deal of computing was done to discover the proofs given here. The search methods used and their programs are discussed in detail. Beyond these results, we have found all finite Ramanujan Pairs. Finally, modular Ramanujan Pairs (where the coefficients in the identity are reduced modulo n) are also examined. | |
| dc.language.iso | en | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Mathematics -- Data processing. | en_US |
| dc.subject | Functions -- Data processing. | en_US |
| dc.subject | Number theory. | en_US |
| dc.subject | Computer simulation. | en_US |
| dc.title | THE DETERMINATION OF RAMANUJAN PAIRS. | en_US |
| dc.type | text | en_US |
| dc.type | Dissertation-Reproduction (electronic) | en_US |
| dc.identifier.oclc | 690027919 | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | doctoral | en_US |
| dc.identifier.proquest | 8323736 | en_US |
| thesis.degree.discipline | Mathematics | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.name | Ph.D. | en_US |
| refterms.dateFOA | 2018-06-23T01:01:47Z | |
| html.description.abstract | We call two increasing sequences of positive integers {aᵢ}, {b(j)} a "Ramanujan Pair" if the following identity holds: (DIAGRAM, TABLE OR GRAPHIC OMITTED...PLEASE SEE DAI). The goal of this investigation is to determine all Ramanujan Pairs. Although this goal was not completely reached, we have determined all pairs for which the first term a₁ ≥ 5 and have proved that any Ramanujan Pair which begins with a₁ = m, where 1 ≤ m ≤ 4, aside from the known pairs, would have to branch off the first Euler identity with {aᵢ} = {i + m - 1}, {b(j)} = {j m}. A great deal of computing was done to discover the proofs given here. The search methods used and their programs are discussed in detail. Beyond these results, we have found all finite Ramanujan Pairs. Finally, modular Ramanujan Pairs (where the coefficients in the identity are reduced modulo n) are also examined. |
