Length of blue cloth is 60 inches , length of gold cloth is 48 inches and length of white cloth is 72 inches.
<u>a.</u>
As, the length of all pieces are equal, so for getting the greatest possible length of the pieces, we need to find <u>GCF(greatest common factor) of 60, 48 and 72. </u>
First we will factor out all three numbers completely......
The common factors are: 2, 2 and 3
Thus the GCF 
So, the greatest possible length of the pieces without having any cloth left over will be 12 inches.
<u>b. </u>
For finding the number of pieces for each color cloth, we will just <u>divide the length of each cloth by 12</u>. So...
Number of pieces for blue cloth 
Number of pieces for gold cloth 
and
Number of pieces for white cloth 
Answer:
a)
a1 = log(1) = 0 (2⁰ = 1)
a2 = log(2) = 1 (2¹ = 2)
a3 = log(3) = ln(3)/ln(2) = 1.098/0.693 = 1.5849
a4 = log(4) = 2 (2² = 4)
a5 = log(5) = ln(5)/ln(2) = 1.610/0.693 = 2.322
a6 = log(6) = log(3*2) = log(3)+log(2) = 1.5849+1 = 2.5849 (here I use the property log(a*b) = log(a)+log(b)
a7 = log(7) = ln(7)/ln(2) = 1.9459/0.6932 = 2.807
a8 = log(8) = 3 (2³ = 8)
a9 = log(9) = log(3²) = 2*log(3) = 2*1.5849 = 3.1699 (I use the property log(a^k) = k*log(a) )
a10 = log(10) = log(2*5) = log(2)+log(5) = 1+ 2.322= 3.322
b) I can take the results of log n we previously computed above to calculate 2^log(n), however the idea of this exercise is to learn about the definition of log_2:
log(x) is the number L such that 2^L = x. Therefore 2^log(n) = n if we take the log in base 2. This means that
a1 = 1
a2 = 2
a3 = 3
a4 = 4
a5 = 5
a6 = 6
a7 = 7
a8 = 8
a9 = 9
a10 = 10
I hope this works for you!!
Answer:
just take speed =distance ÷time
dustance is speedxtime
14x1.61=22.54÷60 to change to min =0.37km per minute
0.40x0.37= 0.148 km
perhaps I may get wrong
Answer:
The extent or measurement of a surface or piece of land is called area.
To find the area of a rectangle, we multiply the length of the rectangle by the width of the rectangle.
Step-by-step explanation:
Hope this will help you
please make me as a brainliest
