Two fractions equivalent to each: Just divide or multiply both top AND bottom by the same number.<span>
5/6: 10/12 OR 15/18
15/30: 5/10 OR 1/2
45/60: 8/12 OR 4/6
Rewrite each pair or fractions with common denominator: Find the difference between the two bottom numbers, and multiply top and bottom number.
5/8 and 3/4: 4X2=8, 3X2=6. So, 5/8 and 6/8.
2/5 and 1/2: 2/5 and 2.5/5
9/9 and 5/7: 9/9 and ~5.7/9
Rewrite each in simple form: Find greatest common factor and divide.
9/54: 1/6
20/40: 1/2
100/110: 10/11
Are these fractions equivalent?
No. 5/1 and 5/5 are, because they are both 5 wholes. 1/5 is not because it is a fifth of a whole.
In what situation can you use multiplication to find equivalent fractions?
I'm sorry but I do not understand this question.
</span>Source(s):<span>I hope I helped, seeing as I have graduated with a math degree.</span>
Answer:
The answer to your question is: 9.01 x 10⁸ ice cream cones
Step-by-step explanation:
Data
# of ice cream cones = 1700
5.3 x 10 ⁵ minutes ---------- 1 year
# of ice cream cones purchased in one year = ?
1700 cones --------------------- 1 min
x ---------------------- 5.3 x 10 ⁵ minutes
x = (5.3 x 10 ⁵)(1700)/1 = 901 000 000 ice cream cones
In scientific notation
9.01 x 10⁸ ice cream cones
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)
16.2-15.8/0.6=0.6667. Use normalcdf() to find the percentage from -999 to 0.6777 which is 0.7476*625=467
You can factor out a 2 from all. Idk if that helps but here ya go. 10x+3x-4
