(self)
return b
Computes the conjugate partition of itself.

        Examples
        ========

        >>> from sympy.combinatorics.partitions import IntegerPartition
        >>> a = IntegerPartition([6, 3, 3, 2, 1])
        >>> a.conjugate
        [5, 4, 3, 1, 1, 1]
Computes the conjugate partition of itself.
Computes the conjugate partition of itself .
def conjugate(self):
        """
        Computes the conjugate partition of itself.

        Examples
        ========

        >>> from sympy.combinatorics.partitions import IntegerPartition
        >>> a = IntegerPartition([6, 3, 3, 2, 1])
        >>> a.conjugate
        [5, 4, 3, 1, 1, 1]
        """
        j = 1
        temp_arr = list(self.partition) + [0]
        k = temp_arr[0]
        b = [0]*k
        while k > 0:
            while k > temp_arr[j]:
                b[k - 1] = j
                k -= 1
            j += 1
        return b
def conjugate ( self ) : j = 1 temp_arr = list ( self . partition ) + [ 0 ] k = temp_arr [ 0 ] b = [ 0 ] * k while k > 0 : while k > temp_arr [ j ] : b [ k - 1 ] = j k -= 1 j += 1 return b