<span>LCD(<span>115</span>, <span>95</span>, <span>38</span>) = LCM(15, 5, 8) = 23×3×5 = 120</span>
<span><span>115</span> = <span>8120</span></span><span><span>95</span> = <span>216120</span></span><span><span>38</span> = <span>45120
</span></span>
Answer:
"number line with open circles on negative 9 and 5, shading going in the opposite directions."
Step-by-step explanation:
Your inequality doesn't include an equal sign so there will be no closed holes. It will only be open holes.
|u|>14 means that the number u has to be greater than 14 or less than -14. These numbers I describe just now all have a distance greater than 14 from 0.
So |u|>14 implies u>14 or u<-14.
But we are solving |2x+4|>14 so this implies we have 2x+4>14 or 2x+4<-14.
2x+4>14
Subtract 4 on both sides:
2x >10
Divide both sides by 2:
x >5
2x+4<-14
Subtract 4 on both sides:
2x <-18
Divide both sides by 2:
x <-9
So our solution is x>5 or x<-9.
Graphing!
~~~~~~~O O~~~~~~~~
-----------(-9)---------------------------------(5)---------------
So we shaded to the right of 5 because our inequality says x is bigger than 5.
We shaded to the left of -9 because our inequality says x is less than -9.
Answer:
0.2
Step-by-step explanation:
Answer:
"greatest common factor" (GCF) or "greatest common divisor" (GCD)
Step-by-step explanation:
Apparently, you're looking for the term that has the given definition. It is called the GCF or GCD, the "greatest common factor" or the "greatest common divisor."
_____
The GCF or GCD can be found a couple of ways. One way is to find the prime factors of the numbers involved, then identify the lowest power of each of the unique prime factors that are common to all numbers. The product of those numbers is the GCF.
<u>Example</u>:
GCF(6, 9)
can be found from the prime factors:
The unique factors are 2 and 3. Only the factor 3 is common to both numbers, and its lowest power is 1. Thus ...
GCF(6, 9) = 3¹ = 3
__
Another way to find the GCD is to use Euclid's Algorithm. At each step of the algorithm, the largest number modulo the smallest number is found. If that is not zero, the largest number is replaced by the result, and the process repeated. If the result is zero, the smallest number is the GCD.
GCD(6, 9) = 9 mod 6 = 3 . . . . . (6 mod 3 = 0, so 3 is the GCD)
Answer:
The answer is C
Step-by-step explanation:
Just did it on 2020 edg.
