In the context of public-key cryptography, find the unique modular multiplicative inverse $x \in [1, 10]$ such that: $$3x \equiv 1 \pmod{11}$$
You need an active account to evaluate expressions, submit proofs, and claim XP.
Describe the logical inconsistency, typo, or calculation error: