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?
What you need to do is find the smallest multiple that they both have (i forgot what that is called) list them like this: 12: 24 36 48 60 72 15: 30 45 60 75 60 is the lowest number that they both can multiply to 60 cups/lids is the answer
