Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

An investigation on partitions with equal products

    https://doi.org/10.1142/S1793042119500969Cited by:0 (Source: Crossref)

    An ordered triple (s,p,n) is called admissible if there exist two different multisets X={x1,x2,,xn} and Y={y1,y2,,yn} such that X and Y share the same sum s, the same product p, and the same size n. We first count the number of n such that (s,p,n) are admissible for a fixed s. We also fully characterize the values p such that (s,p,n) is admissible. Finally, we consider the situation where r different multisets are needed, instead of just two. This project is also related to John Conway’s wizard puzzle from the 1960s.

    AMSC: 11P81, 11C08, 11A99
    Remember to check out the Most Cited Articles!

    Check out new Number Theory books in our Mathematics 2021 catalogue