Mathematics – Combinatorics
Scientific paper
2001-10-17
Mathematics
Combinatorics
5 pages
Scientific paper
This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form $a^n$ mod m. The main contribution of this paper is a correction to the upper bound on the number of s-partitions presented by Bhatt. We will give a precise asymptotics for the number of such partitions for a given integer n.
Goh William M. Y.
Hitczenko Pawel
Shokoufandeh Ali
No associations
LandOfFree
S-partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with S-partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and S-partitions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-347891