Answer:
c) there is an efficient algorithm to test whether an integer is prime
Step-by-step explanation:
The basis of modern cryptography is the fact that factoring large numbers is computationally difficult. No algorithm is efficient for that purpose.
<h3>Choices</h3><h3>a)</h3>
False - there is no known efficient algorithm for factoring large numbers
<h3>b)</h3>
False - there are 78,498 prime numbers less than 1,000,000. That is about 8% of them--far from being "most of the integers."
<h3>c) </h3>
True - a variety of algorithms exist for testing primality. In 2002, a test was published that runs in time roughly proportional to the 7.5 power of the logarithm of the number being tested.
<h3>d)</h3>
False - there is no known efficient algorithm for factoring large numbers
Answer:
reflect
Step-by-step explanation:
dilate means bigger or smaller than the original.
Answer:
no yes no yes
Step-by-step explanation:
Im pretty sure thats correct
Answer:
the statement is false for any value x = 0 (0 with a line through it
No solution
Step-by-step explanation:
cancel equal statements on both sides of the equation
x-5/3=x-2/5
-5/3 =-2/5
