Step-by-step explanation:
1. SAS
2. SSS
3. RHS
4. SAS
5. RHS
6. SAS
7. ASA
8. SAS
9. ASA
10. SSS
Answer:
_________________________________
<h2>
Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:

where n is a positive integer.
then we have:

Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.

- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u> 
Let us take n=k+1
Hence, we have:

( Since, the result was true for n=k )
Hence, we have:

Also, we know that:

(
Since, for n=k+1 being a positive integer we have:
)
Hence, we have finally,

Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
where n is a positive integer.
Answer:
33.5
-by-step explanation:
8.5 + (12 + 4) × 2 - 7
Use PEMDAS ( I think this is right hope it helps!)
Answer: Theoretical- In a perfect world everything is a 50/50 chance and experimental is real world and the probability is not 50/50.
Step-by-step explanation: