We can plug those values into the equation, and if the answer is incorrect, we'll know if either one is extraneous.
√11 - 2(-7) = √(-7)^2 + 4(-7) + 4
√25 = √25
5 = 5
The first solution, -7, makes the equation true, and so it is not extraneous.
√11 - 2(1) = √(1)^2 + 4(1) + 4
√9 = √9
3 = 3
The second solution, 1, makes the equation true, and so it is also not extraneous.
<h3>The correct option is D, neither solution is extraneous. </h3>
Answer:
9:5
ratios are just putting the numbers next to each other with ':' in the middle
Step-by-step explanation:
Answer:
ΔGFE≈ΔJKL
Step-by-step explanation:
Answer:
333.3 meters per minute
Step-by-step explanation:
<u>The best way to solve this problem is using </u><u>dimensional anaysis</u><u>. First, we write out our starting units, that being 20km/1hr. We have to keep in mind that we want to change the kilometers to meters and the hours to minutes.</u>

<u>We know that there are 1000 meters in 1 kilometer. We add this to the dimensional analysis as 1000m/1km. We write it as this because we want the kilometers to cancel each other out. We only want the meters.</u>

<u>We also know that 1 hour is 60 minutes. We add this to the analysis as well so that the hours cancel each other.</u>

<u>We now solve this expression. Since both the kilometers and the hours cancel out, we have meters per minute as our unit. All that's left are the numbers.</u>
= (20*1000*1)/(1*1*60) m/min
= 333.3 meters per minute
Since in a pass code, the placement of the digits is
important, therefore this means that to solve for the total number of
possibilities we have to make use of the principle of Permutation. The formula
for calculating the total number of possibilities using Permutation is given
as:
P = n! / (n – r)!
where,
n = is the total amount of numbers to choose from = 20
r = is the total number of digits needed in the passcode =
4
Therefore solving for the total possibilities P:
P = 20! / (20 – 4)!
P = 20! / 16!
P = 116,280
<span>Hence there are a total of 116,280 possibilities of pass
codes.</span>