Abstract
Because they exhibit so many beautiful and intriguing relations, numbers are an inexhaustible source of fascination. This paper will show how to answer a variety of questions about partitions of a positive integer n using three easily constructed tables, and give a particularly simple and efficient way to calculate the number of partitions of large n. Accompanying computer programs are given in the appendix.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
