ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Scratchpad and the Rogers-Ramanujan identities
Full text PdfPdf (161 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents
Bonn, West Germany
Pages: 189 - 190  
Year of Publication: 1991
ISBN:0-89791-437-6
Author
William H. Burge  IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Sponsors
GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120722
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
G. E. Andrews, On the proofs fo the Rogers- Ramanuian identities. Report no. PM 18, Department of Mathematics Penn State (1988)
 
2
l. I. Rogers, Second memoir on the expansion of certain infinite products, Proe. London Math. Soc. 25 (1894) 318-343.
 
3
t. Schur, Ein Beitrag zur additiven Zahlentheorie und zur Theorie der Kettenbriiche, S.-B Preuss. Akad. Wiss. Phys.-Math. KI., (1917),302-321.

CITED BY
Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Number-theoretic computations (e.g., factoring, primality testing)

Additional Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.3 Languages and Systems

          Nouns: SCRATCHPAD


General Terms:
Algorithms

Collaborative Colleagues:
William H. Burge: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player