Carry out the fast exponentiation algorithm to evaluate 32n mod 13 for n = 0,1 and 2. These three values suce to derive a formula for 32n mod 13 for all non-negative integers n. State this formula and explain.

Step-by-step explanation:

refers to the quotient that is obtained on dividing by .

To find:

Solution:

For n = 0:

For n = 1:

For n = 2:

Therefore,

To find: general formula for

So, as per the pattern,

its not b

step-by-step explanation:

1696 hundred thousand

step-by-step explanation: