Original Post
write a recursive O(nlogn) algorithm whose parameters are 3 integers x, n, and p and which computes the remainder when x^n is divided by p. For simplicity you may assume n is a power of 2. that is n=2^k for some positive int k