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:
You can use the equation
to find the lenth of the legs
x = leg 1
x + 14 = leg 2
Answer:
50cm
Step-by-step explanation:
If the sides are consecutive odd integers,
Let the smallest side=y
The other sides are y+2 and y+4
The perimeter=144cm
y+y+2+y+4=144
3y+6=144
3y=144-6
3y=138
y=138/3=46cm
Therefore, the largest side of the triangle:
y+4=46+4=50cm
Therefore, the largest side of the triangle is 50cm
