Answer:
Step-by-step explanation:
There are 3 odd primes, namely : 3, 5, 7
The total amount of blocks is 9
The odds of picking and odd prime is
The row reduction algorithm applies only to augmented matrices for a linear system.Is this statement true or false?
1 answer:
You might be interested in
Answer:
The most important quantity to consider in order to answer this question is the arrival time of the zombies from their initial position, which is the quotient between their distance to the visitors, divided the zombie's speed.
See explanation below.
Step-by-step explanation:
Part 1)
What is crucial to know is what is the time at which each zombie would reach Alice and Bob, and that is given by the quotient between the distance away each zombie is, divided by the zombie's speed:
Then, it is this quotient for each zombie, that one has to estimate given the input values distance and speed, and it is the output "time" () for each zombie, what we need to analyze so as to prioritize an order regarding which zombie to kill first.
Part 2)
Shooting the closest zombie first is not a good idea, since the speed of that closest zombie may be much slower than another zombie further away, but with much larger speed. Again, the important value to analyze is the time that it would take each zombie to reach Alice and Bob.
Part 3)
Shooting the fastest zombie first is not a good idea either, because that fastest zombie could be located very far away from the visitors, and other zombies closer by may reach them first.
Part 4)
The order that should be used to kill the zombies is given by the value of the time to reach Bob and Alice based on the quotient distance (di) over speed (si) explained in Part 1). The zombie that shows smallest time should be shot first, and then the others in increasing order of time value.
Part 5)
Notice that the individual zombie information is not presented in the question, but the student should be able to calculate the quotients for each zombie, and considering that there could be at most one shot every second, estimate the number of seconds that the time for each zombie in increasing order would allow until the addition of shooting time per second in the appropriate order cannot match the arrival time of the zombies that are left.
One should count number of seconds from the first shot (to the zombie with shortest arrival time), and then increase in one unit (one shot per second), to the following zombie with slightly larger arrival time), and so on, until the addition of seconds (one second per shot and per increasing arrival time of zombie) exceeds the next zombie arrival time.
We will be using the binomial probability formula to solve the problem
The formula is given by ⁿCₓ (p)ˣ (1-p)ⁿ⁻ˣ
Where:
n = the number of trials = 100
x = the number of samples we are trying on = 3
p = the probability of success = 2% = 0.02
We can either calculate ⁿCₓ by using the scientific calculator using the
button or by doing it manually use 
P(3) = ¹⁰⁰C₃ (0.02)³ (1 - 0.02)¹⁰⁰⁻³
P(3) = ¹⁰⁰C₃ (0.02)³ (0.98)⁹⁸
P(3) = 0.182 (rounded to three decimal places)
Correct answer: option 3
The formula is given by ⁿCₓ (p)ˣ (1-p)ⁿ⁻ˣ
Where:
n = the number of trials = 100
x = the number of samples we are trying on = 3
p = the probability of success = 2% = 0.02
We can either calculate ⁿCₓ by using the scientific calculator using the
P(3) = ¹⁰⁰C₃ (0.02)³ (1 - 0.02)¹⁰⁰⁻³
P(3) = ¹⁰⁰C₃ (0.02)³ (0.98)⁹⁸
P(3) = 0.182 (rounded to three decimal places)
Correct answer: option 3