Generating Functions for X(n) and Y(n)
Abstract
This paper shows how to prove the Theorem X (n) = Y(n), the number of partitions of n with no part repeated more than twice is equal to the number of partitions of n with no part is divisible by 3.
Full Text: PDF
Abstract
This paper shows how to prove the Theorem X (n) = Y(n), the number of partitions of n with no part repeated more than twice is equal to the number of partitions of n with no part is divisible by 3.
Full Text: PDF
Browse Journals
Journal Policies
Information
Useful Links
- Call for Papers
- Submit Your Paper
- Publish in Your Native Language
- Subscribe the Journal
- Frequently Asked Questions
- Contact the Executive Editor
- Recommend this Journal to Librarian
- View the Current Issue
- View the Previous Issues
- Recommend this Journal to Friends
- Recommend a Special Issue
- Comment on the Journal
- Publish the Conference Proceedings
Latest Activities
Resources
Visiting Status
Today | 248 |
Yesterday | 146 |
This Month | 534 |
Last Month | 5705 |
All Days | 1008364 |
Online | 26 |