s-partitions

This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form an mod m. The main contribution of this paper is a correction to the upper bound on number of s-partitions presented by Bhatt [Inform. Process. Lett. 71 (1999) 141

• Type: Journal
• Year: 2002
• Where: IPL
• Authors: William M. Y. Goh, Pawel Hitczenko, Ali Shokoufandeh
• Keywords: IPL 2002, Main Contribution, Natural Number, Such Partitions