Answer: 1300 cm^3, 850 cm^2
Step-by-step explanation:
With a triangular prism, you need to calculate the surface area of the triangle first and then the length. Here's how to solve for the volume (A):
Triangles is b*h/2, plug in the equation
10*13/2
130/2
65
Now use the length of the rest of the shape, which is 20 cm.
65*20=1300
the volume is 1300 cm^3.
for B, finding the surface area requires you to analyze each individual part of the shape.
Each part colored in represents a different shape:
Red:
10*20=200
Blue:
13*10/2=65
65*2=130 (Two triangles)
Green:
13*20=260
260*2=520 (Two rectangles)
Add them all up together.
200+130+520= 850 cm^2
B. -9 is the most negative one, -2 is the least.
Hope this helps you.
Answer:
- 5x²-2x+7+2x²+6x-9
- 5x²+2x²-2x+6x+7-9
- 7x²+4x-2
so, 7x²+4x-2 is yr answer.
hope it helps.
<h3>stay safe healthy and happy.</h3>
<span>Divide 52.4 by 65.5 and multiply by 100. That is the percent of the 52.4 compared to 65.5.
</span>
Answer:
f(n)=f(n-1)+f(n-2)
f(1)=1x
f(2)=1x
Step-by-step explanation:
This is the fibonacci sequence with each term times x.
Notice, you are adding the previous two terms to get the third term per consecutive triples of the sequence.
That is:
1x+1x=2x
1x+2x=3x
2x+3x=5x
3x+5x=8x
So since we need the two terms before the third per each consecutive triple in the sequence, our recursive definition must include two terms of the sequence. People normally go with the first two.
f(1)=1x since first term of f is 1x
f(2)=1x since second term of f is 1x
Yes, I'm naming the sequence f.
So I said a third term in a consecutive triple of the sequence is equal to the sum of it's two prior terms. Example, f(3)=f(2)+f(1) and f(4)=f(3)+f(2) and so on...
Note, the term before the nth term is the (n-1)th term and the term before the (n-1)th term is the (n-2)th term. Just like before the 15th term you have the (15-1)th term and before that one you have the (15-2)th term. That example simplified means before the 15th term you have the 14th and then the 13th.
So in general f(n)=f(n-1)+f(n-2).
So the full recursive definition is:
f(n)=f(n-1)+f(n-2)
f(1)=1x
f(2)=1x
