🚨Open Theorems Alert #10
0x0010 :: Modulo Properties: Modular Inverse
Prove the existence of a modular multiplicative inverse using Bézout's identity. Specifically, if `m` and `n` are coprime, there exists an integer `x` such that `m * x ≡ 1 (mod n)`.

>> Suggested Difficulty: Intermediate
>> Reward: 61 $CTK
Submit your proof or contribute funding.
Verify truth on-chain:
openmath.shentu.org/OpenMath/T...…
#OpenMath #OpenTheorems #Rcoq
From Twitter
Disclaimer: The content above is only the author's opinion which does not represent any position of Followin, and is not intended as, and shall not be understood or construed as, investment advice from Followin.
Like
Add to Favorites
Comments
Share
Relevant content





