A note on the generation of rosary permutations

By Ronald C. Read

Communications of the ACM, Vol. 15 No. 8, Page 775
10.1145/361532.361560

Harada [1] has given a method of generating rosary permutations, and of associating an integer with each such permutation in a one-to-one manner. In this note we show that both these ends can be achieved more easily than by Harada's method.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

A note on the generation of rosary permutations

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine