The area of a circle with a radius of 15 is about 707 or exactly 706.86
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
- - - - - - - - - - - - - - - - - - - - - - - - - - -

How do you solve this? [question in attachment]

In order to find the perimeter of a shape, we should add all of its sides.
Since a triangle has only 3 sides, we add 3 sides together, like so:-
⇒ 9x-7+12x-13+3x+8
Combine like terms:-
➪ 9x+12x+3x-7-13-8
Which simplifies to
➪9x+15x-7-21
On further simplification,
➪24x-28
So we conclude that the perimeter of the triangle is 24x-28 units.
<h3 /><h3>Good luck.</h3>
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
The probabilities can be calculated using an online calculator or tables, depending on which is more readily available.
QUESTION A

Using calculators, the probability will be:

QUESTION B

Using calculators, the probability will be:

QUESTION C
Answer: I'm confused. What are you asking here?
Step-by-step explanation: