The sides of the triangle are 3x, 4x and 5x
3x + 4x + 5x = 90
12x = 90
x = 90/12
x = 7.5
first side = 3x = 3 * 7.5 = 22.5 cm
second side = 4x = 4 * 7.5 = 30 cm
third side = 5x = 5*7.5 = 37.5 cm
Answer:
38 5/28
Step-by-step explanation:
Well start with the whole numbers 24 and 13 This is adding so that means everything has to be added together. 13+24=37 Now, lets go the fractions.
Find the LCD (Least Common Denominator) of 3/4 and 3/7 and rewrite to solve with the equivalent fractions. (remember the Denominator is the BOTTOM PART of the Fraction. Such as the 4 in 3/4.)
LCD = 28
21/28 + 12/28 = 33/28 which can be simplified to 1 5/28. Combining the whole and fraction parts 37 + 1 + 5/28 = 38 5/28 And that will be your answer. Another way you can do this is
converting mixed numbers to fractions Meaning put them in improper form where the numerator (the top number of a fraction is bigger than the denominator such as 4/3) , our initial equation becomes, 99/4 + 94/7
Applying the fractions formula for addition,
(99×7) + (94×4) / 4×7
= 693+376 / 28 =
= 1069/ 28
Simplifying 1069/28, the answer is
= 38 5/28
And one more thing. An easier way to make a mixed number a improper fraction is the multiply the denominator by the whole number then add the numerator and whatever the denominator is it stays for example
38 5/28.
28 times 38 = 1064 then add the 5 and you get 1069! But we aren't done yet, the denominator was 28 so that means the full answer is 1069/28 and that is the Improper fraction form!
Hope this helps! (sorry I took so long)
~R.C aka dj
Answer:
<h2>36b + 60c</h2>
Step-by-step explanation:
Put a = 6 to the expression 2a(3b + 5c):
(2)(6)(3b + 5c) = 12(3b + 5c) <em>use the distributive property</em>
= (12)(3b) + (12)(5c) = 36b + 60c
You're looking for the largest number <em>x</em> such that
<em>x</em> ≡ 1 (mod 451)
<em>x</em> ≡ 4 (mod 328)
<em>x</em> ≡ 1 (mod 673)
Recall that
<em>x</em> ≡ <em>a</em> (mod <em>m</em>)
<em>x</em> ≡ <em>b</em> (mod <em>n</em>)
is solvable only when <em>a</em> ≡ <em>b</em> (mod gcd(<em>m</em>, <em>n</em>)). But this is not the case here; with <em>m</em> = 451 and <em>n</em> = 328, we have gcd(<em>m</em>, <em>n</em>) = 41, and clearly
1 ≡ 4 (mod 41)
is not true.
So there is no such number.
