Topic: Mathematics
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Modular Multiplicative Inverse</td><td>Easy</td></tr></tbody></table>

<details><summary>Question</summary><div data-type="detailsContent">Input: a = 3 m = 11 Output: 4 Explanation: Since (43) mod 11 = 1, 4 is modulo inverse of 3. One might think, 15 also as a valid output as "(153) mod 11" is also 1, but 15 is not in ring {0, 1, 2, ... 10}, so not valid.</div></details>

<pre><code class="lang-java">class Solution
{

 public int modInverse(int a, int m)
 {
 for(int i=1;i&lt;m;i++){
 if((i*a)%m==1)
 return i;
 }
 return -1; 
 }
}
</code></pre>
Thank you for reading :)

Topic: **Mathematics**

Questions Successfully Completed: 1

<table><tbody><tr><td colspan="1" rowspan="1">1) Modular Multiplicative Inverse</td><td colspan="1" rowspan="1">Easy</td></tr></tbody></table>

<details data-node-type="hn-details-summary"><summary>Question</summary><div data-type="detailsContent">Input: a = 3 m = 11 Output: 4 Explanation: Since (4*3) mod 11 = 1, 4 is modulo inverse of 3. One might think, 15 also as a valid output as "(15*3) mod 11" is also 1, but 15 is not in ring {0, 1, 2, ... 10}, so not valid.</div></details>

```java
class Solution
{
 
 public int modInverse(int a, int m)
 {
 for(int i=1;i<m;i++){
 if((i*a)%m==1)
 return i;
 }
 return -1; 
 }
}
```

Thank you for reading :)

DSA Day 75/100