Answer:
U = -6
Step-by-step explanation:
-16 = 8 + 4u
-24 = 4u
-24/4 = 4u/4
-6 = u
Answer:
Answer for the question:
To compute a19 mod N, the modular exponential algorithms that we studied would do 8 modular multiplications (5 squarings and 3 multiplications by a). What is the minimum number of modular multiplications needed to compute a19 mod N if you are free to use any sequence of modular multiplications.)
is given in the attachment.
Step-by-step explanation:
It is D:1/6 because 3 of them do the home side and he cleans the other side.
