Answer:
F
Step-by-step explanation:
Hope this helps
Sam divided a rectangle into 8 congruent rectangles that each have a area of 5 cm2. what is the area of the rectangle before it is divided?
Answer:
Step-by-step explanation:
Given:
Sam divided a rectangle into 8 congruent rectangles that each have an area of 
We need to find the area of the rectangle before Sam divided it.
The area of the rectangle before Sam divided is 8 times of the area of the congruent rectangles.
Area of the rectangle =
Area of the congruent rectangle is 
So the area of the rectangle is
Area of the rectangle =
Area of the rectangle =
Therefore the area of the rectangle before divided is
Using cos addition formula:
use x for theta
cos(x+π/6)=cosx*cos(π/6)-sinx*sin(π/6)
sinx=1/4
cosx=√15/4
cos(π/6)=√3/2
sin(π/6)=1/2
cos(x+π/6)=(√15/4*√3/2)-(1/4*1/2)
cos(x+π/6)=(√45/8)-(1/8 )
cos(x+π/6)=(√45-1)/8)
Answer:

Step-by-step explanation:
![S= \frac{n}{2 [2a + (n - 1)d]}](https://tex.z-dn.net/?f=S%3D%20%5Cfrac%7Bn%7D%7B2%20%5B2a%20%2B%20%28n%20-%201%29d%5D%7D)
Simplifying the fraction by multiplying d into the (n-1) term,
![s=\frac{n}{2 [2a + (n - 1)d] } = \frac{n}{2[2a + dn - d] }](https://tex.z-dn.net/?f=s%3D%5Cfrac%7Bn%7D%7B2%20%5B2a%20%2B%20%28n%20-%201%29d%5D%20%7D%20%3D%20%5Cfrac%7Bn%7D%7B2%5B2a%20%2B%20dn%20-%20d%5D%20%7D)
Simplifying the fraction by multiplying 2 throughout,

Multiply
on both sides

Cancel the
on the right hand side

Multiply s to the terms,

Move
to the right hand side by subtracting
on both sides

On the right hand side of the equation, take out 

Divide Left hand side by
,

Answer:
2^n
Step-by-step explanation:
So whenever you flip a coin, you can see it as 2 nodes branching off of each existing node. so for example when you flip a coin once you're going to have 2 sequences initially H and T, now when you flip a coin again for each of those 2 sequences 2 are going to branch off of that, making the total sequences 4, and the next flip 2 sequences are going to branch off each of the 4 sequences and so on. this can generally be described as: 2^n
I attached an image describing this a bit better but the bottom line is that for each 'end node'/sequence you're going to have 2 branch off of it, thus for each coin flip the number of sequences multiplies by 2