Given a real number x and a positive integer k, determine the number of multiplications used to find x2k starting with x and suc
cessively squaring (to find x2, x4, and so on). Is this a more efficient way to find x2k than by multiplying x by itself the appropriate number of times?
