Use a loop invariant to prove that when the pseudocode
i = 1
pow = 1
while (i ≤ n) {
pow = pow * a
}
terminates, pow is equal to an.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.