# Compute inverse using Fermat's theorem or Euler's Theorem [duplicate]

Compute the inverse $$a^{-1} \mod n$$ with Fermat's theorem (if applicable) or Euler's Theorem : $$a = 4$$, $$n = 7$$.