Journal of the Ramanujan Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Applications of The Hardy-Ramanujan Partition Theory to Linear Diophantine Problems


Affiliations
1 Department of Computer Sciences, The City College of the City University of New York, New York 10031, United States
2 Department of Mathematics, Columbia University New York, New York 10027, United States
     

   Subscribe/Renew Journal


In 1918 G.H. Hardy and S. Ramanujan [H-R] gave an asymptotic formula for the now classic partition function p(n) which equals the number of unrestricted partitions of n.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 293

PDF Views: 0




  • Applications of The Hardy-Ramanujan Partition Theory to Linear Diophantine Problems

Abstract Views: 293  |  PDF Views: 0

Authors

Michael Anshel
Department of Computer Sciences, The City College of the City University of New York, New York 10031, United States
Dorian Goldfeld
Department of Mathematics, Columbia University New York, New York 10027, United States

Abstract


In 1918 G.H. Hardy and S. Ramanujan [H-R] gave an asymptotic formula for the now classic partition function p(n) which equals the number of unrestricted partitions of n.