a/b mod p

ab^{-1} \pmod{p} = ab^{p-2}\pmod{p} (making use of Fermat's little theorem).

Comments

Popular posts from this blog

Getting Started With MEAN App Development with AngularJs , ExpressJs , NodeJs and MongoDB.

B. Dreamoon and WiFi :calculate no. of ways : recursive solution (branch and bound )

A. Dreamoon and Stairs : minimum steps to reach : recursion solution.