The lowest common denominator for the fractions 8/64 and 8/32 is ?

2 answers:

8 0

The lowest common denominator (LCM) is the lowest whole number divisible by both denominators without a remainder.

EASY LCM:
multiply the two denominators, then divide the total by the greatest common factor (GCF) between the two denominators.

=(64*32)/32
=2,048/32
=64

-OR-

DETAILED METHOD
STEP 1:
Find prime factors of denominators.
8/64
64: 2 x 2 x 2 x 2 x 2 x 2

8/32
32: 2 x 2 x 2 x 2 x 2

STEP 2:
If factors occur more than once, multiply them the greater number of times they occur.

2 x 2 x 2 x 2 x 2 x 2= 64

ANSWER: The LCM of 8/64 and 8/32 is 64.

Hope this helps! :)

Marina CMI [18]3 years ago

5 0

Answer:

Step-by-step explanation:

6/8,4/32

i think is not the same question but i have for this question 6/8,5/32

You might be interested in

Fine the exact distance between the line 6x-y=-3 and the point (6,2). Show your work. Explain your answer.

AVprozaik [17]

Answer:

$\sqrt{37}$ units

Step-by-step explanation:

If we draw a perpendicular from point (6,2) on the line 6x - y = - 3, then we have to find the length of the perpendicular.

We know the formula of length of perpendicular from a point $(x_{1}, y_{1} )$ to the straight line ax + by + c = 0 is given by

$\frac{|ax_{1} + by_{1} +c |}{\sqrt{a^{2}+b^{2}}}$

Therefore, in our case the perpendicular distance is

$\frac{|6(6)-2+3|}{\sqrt{6^{2} +(-1)^{2} } } = \frac{37}{\sqrt{37} } = \sqrt{37}$ units. (Answer)

6 0

3 years ago

dente has been putting one penny in his bank everyday. now je has 161 pennies. for how many weeks has dente been adding pennies

SIZIF [17.4K]

1 day is equal to 0.14285714 weeks, so multiply that by the number of days.

7 0

3 years ago

Read 2 more answers

Find the negation of the proposition

murzikaleks [220]

In accordance with propositional logic, quantifier theory and definitions of simple and composite propositions, the negation of a implication has the following equivalence:

$\neg (\exists \,x\, (P(x) \implies Q(x))) \iff \forall \,x (\neg \,Q(x) \,\land \,P(x))$ (Correct choice: iii)

<h3>How to find the equivalent form of a proposition</h3>

Herein we have a composite proposition, that is, the union of monary and binary operators and simple propositions. According to propositional logic and quantifier theory, the negation of an implication is equivalent to:

$\neg (\exists \,x\, (P(x) \implies Q(x))) \iff \forall \,x (\neg \,Q(x) \,\land \,P(x))$

To learn more on propositions: brainly.com/question/14789062

#SPJ1

8 0

2 years ago

HELP say im getting it wrong the perimeter of the polygons is ?

lara [203]

So the answer would be16*4=64

8 0

2 years ago

What is the value of the expression 9 × 2 + 2 × 5²

NARA [144]