Answer:
The Probability that Event A and Event D occur is equal to the probability Event A occurs times the probability that Event D occurs, given that A has occurred.
We can find the values of 
and 
using the above form formula.
;
From the given table, we have the values of P(A), P(D), 
and 
.
Since, Probability=
∴
, 
, 
and 
Now, putting these values in above formula we get,
.
As, you can see above that the values of P(A|D) and P(D|A) are not equal.
Group 'em together
a
b
−
a
+
1
−
b
a
b
−
a
=
a
(
b
−
1
)
Notice that there will be a 1 as without it it'll simply be ab
1
−
b
=
1
(
1
−
b
)
Notice that it doesn't match with the upper one... so we'll change the signs
1
(
1
−
b
)
=
−
1
(
b−
1
)
(try to multiply them now!!
Jot them down in one expression
a
(
b
−
1
)
−
1
(
b
−
1
)
You get!!!!!!
(
a
−
1
)
(
b
−
1
)
needless to say that the conversion from miles to kilometers uses a constant value, and therefore, they're directly proportional.
now, I could write the direct proportional relation blah blah but there's no need, we can simply squeeze it out of the table by simply checking how many kilometers there are in 1 mile.
well, we know that 11.0 miles give us 17.699 km, ok hmmm if we divide 17.699 ÷ 11 = 1.609.
if we do the same on table for 26 and 41.834, so 41.834 ÷ 26 = 1.609, and the next pair 54.706 ÷ 34 = 1.609, the value of 1.609 is consistent or constant, or namely that there are 1.609 kilometers in 1 mile.
_________________________________
_________________________________
And we're done.....♥️♥️♥️♥️♥️
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
