Suppose the primes p and q used in the rsa algorithm are consecutive primes. how would you factor n
1 answer:
You might be interested in
Answer:
Option A
Step-by-step explanation:
This is a great question!
The first thing we want to do here is to graph the system of " inequalities " -
As x is ≥ 0, respectively y ≥ 0, it makes things a lot simpler, as it kind of restricts us to quadrant 1, but not entirely.
First change each inequality to " slope - intercept " form, as such -
The graphed solutions would be in the attachment. I have colored the region with which the two intersect, and the fact that we are limited to quadrant 1. In this colored region there are 3 major points, ( 5, 9 ), ( 0, 10 ), and ( 6, 0 ). We have to determine which of these are are maximum points, as the minimum are the same. Substitute these values ( ( 5, 9 ), ( 0, 10 ), and ( 6, 0 ) ) into the equation f( x, y ) = 10x + 4y,
( 5, 9 ) resulted in the greatest amount, 86. That would make it our maximum point -
<u><em>Solution = Option A</em></u>
