# Decrypting RSA which has no inverse? [duplicate]

Is there any way to decrypt RSA ciphertext $$c = m^e \bmod n$$ when $$\gcd(p-1,e) > 1$$?