Answer:
101
Step-by-step explanation:
3^4 = 81
4 x 5 20
81 +20 = 101
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:
4,000/month because you would be getting $750 more than the other salary(that's what i think the answer is)
Answer:
d
Step-by-step explanation:
Good question let me see if I can figure it out