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
If x=3 then 5x3=15-2=13+6=19x1/4=4 3/4 so that means that 2 1/4+2 1/2 could be equivalent
P.S.I just chose 3 because it was the first number to pop into my head
~Mathlete12321~
$54.29
This is because 5% of $51.70 is $2.59. The sum of the tax and bill would become $54.29.
<span>2x+7y=-1 (1)
4x-3y=-19 (2)
multiply equation (1) by 2
4x + 14y = -2 (1')
</span>4x - 3y = -19 (2)
---------------------subtract
17y = 17
y = 1
<span>2x+7y=-1
</span><span>2x+7(1)=-1
</span>2x + 7 = -1
2x = -8
x = -4
answer
(-4, 1)
Hello :
4 - 2/5 = 20/5 -2/5 =18/5 =(<span>√(18/5))²</span>
