Abstract
In this paper we prove the inversion theorem,
for any ordered sequence pair <f(n,k),g(n,k)>, where Pr(n,k) is the number of partitions of n into k relatively prime parts and Qr(n, k) is its inverse.
Key words:
Quaestiones Mathematicae
Volume 24, 2001 - Issue 4
![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.