why moduler multiplicative inverse is not working under modulo 1000000007 by fermats littile theorem ?↵
let n=11 & k=3 ; n/k should be equal to 3. but its giving me 666666675. same thing goes for n=10 & k=4;↵
↵
↵
↵
problem:↵
↵
https://paste.ubuntu.com/p/vgTZcHQ8Rv/↵
↵
my code:↵
↵
https://paste.ubuntu.com/p/s2m5q4JtMs/
let n=11 & k=3 ; n/k should be equal to 3. but its giving me 666666675. same thing goes for n=10 & k=4;↵
↵
↵
↵
problem:↵
↵
https://paste.ubuntu.com/p/vgTZcHQ8Rv/↵
↵
my code:↵
↵
https://paste.ubuntu.com/p/s2m5q4JtMs/
