a/b mod p

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

Comments

Post a Comment

Popular posts from this blog

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

-
          Getting Started With MEAN App Development I Started Learning AngularJs one year Back. It is always a nice experience to start learning something new. I used Some of my AngularJs skills in my Programming Calculator App. ( https://nikhilnihal.github.io/programmingcalculator/index.html ) Few Days Back , I Started my hands on NodeJs and ExpressJs. I watched many Youtube Videos and Tutorials of  NodeJs and ExpreesJs. After that , I thought to do a Small Project Using all my skills of AngularJs , NodeJs ,ExpressJs.  I followed a Youtube Video ( https://www.youtube.com/watch?v=kHV7gOHvNdk ) and Made a Small Project Similiar to this one.After that I also Learnt that how to deploy my MEAN app on heroku website( heroku.com ). My app uses MongoDB for database. So , i also used mLab ( https://mlab.com /),which provided me MongoDB hosting service. There is a very useful blog which helped me to learn how to deploy my app on heroku. ( ht...
Read more

Syscloud PHP developer Interview Questions

-
I got selected for Interview from HackerEarth online Test (It was a hiring challenge). The Questions they asked was basic only. Questions related to Webserver & PHP:- 1) How to configure apache webserver ? 2) Where is the configuration file of PHP ? 3) How server and client communication happens? 4) Explain about different methods(POST ,GET ,PUT ) ? Apart from that they asked basic SQL Questions like :- 1) What is the difference between Truncate and Delete ? 2) How to drop table schema ? they also asked a Programming question 1) Write a Program to reverse a string Viewing this video tutorial will help:-  https://www.youtube.com/watch?v=1ZioHruINOA&list=PLtGnc4I6s8dsNLpl0G30Azcc-Q4eoM4TX
Read more

Divide Intervals Into Minimum Number of Groups

-
  Divide Intervals Into Minimum Number of Groups  Leetcode Problem  Divide Intervals Into Minimum Number of Groups   is very much similar to the number-of-the-smallest-unoccupied-chair  Here we have to divide the given intervals into minimum number of groups such that each interval is in exactly one group, and no two intervals that are in the same group intersect each other. Solution: We will think each interval as combination of two events ,  startTime  and endTime. 1) We create a list of events and then sort that list.  2) After that, we Initialise a min heap. which can be thinked like different baskets or groups.  3) We iterate through the events one by one, and assign each events to groups (picked from minheap).      While iterating starting event we pick a group from min heap and keep track in an array.       While iterating ending event through our tracking array, we release the group again in min...
Read more