S-partitions
| dc.creator | Goh, William M. Y. | |
| dc.creator | Hitczenko, Pawel | |
| dc.creator | Shokoufandeh, Ali | |
| dc.date | 2001-10-17 | |
| dc.date.accessioned | 2026-07-07T04:43:53Z | |
| dc.date.available | 2026-07-07T04:43:53Z | |
| dc.description | 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. | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/math/0110185 | |
| dc.identifier | http://arxiv.org/abs/math/0110185 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62420 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A17 | |
| dc.title | S-partitions | |
| dc.type | text |