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:
Answer:
35
Step-by-step explanation:
Since we know that 7 b is the equation and 5 is the value of b we can substitute b in 7 b.
b = 5
7 b = 7 × 5 = 35
Answer:
y = x - 1 (third answer choice)
Step-by-step explanation:
From the given we see immediately that the slope of this line is -1. The slope of a line perpendicular to this one is +1, which is the negative reciprocal of -1. The slope-intercept form is y = mx + b. To find b, the y-intercept, we make the following substitutions: m = -1, y = -2, x = -2:
-2 = +1(-2) + b, or +1 = 2 + b, or b = -1
and so the desired equation is y = x - 1 (third answer choice)
Answer:
The smaller Number = 15
The larger number = 67
Step-by-step explanation:
Let
The smaller number = x
The larger number = 5x - 8
The sum = 82
(5x - 8) + x = 82
5x - 8 + x = 82
6x - 8 = 82
Add eight to both sides
6x - 8 + 8 = 82 + 8
6x = 90
Divide both sides by 6
x = 90/6
= 15
Therefore,
The smaller number = x = 15
The larger number = 5x - 8
= 5(15) - 8
= 75 - 8
= 67
