'Return permutation whose rank is ``other`` greater than current rank,
(mod the maximum rank for the set).
Examples
>>> from sympy.combinatorics.partitions import Partition
>>> a = Partition([1, 2], [3])
>>> a.rank
1
>>> (a + 1).rank
2
>>> (a + 100).rank
1'

def __add__(self, other):

    other = as_int(other)
    offset = (self.rank + other)
    result = RGS_unrank((offset % RGS_enum(self.size)), self.size)
    return Partition.from_rgs(result, self.members)
