Answer: TnT down
Step-by-step explanation:
What's given?
EG ≅ FG
∟EFG ≅ ∟FGH
What's something else we can figure out?
∠FGE ≅ ∠GFH - alternate interior angles
Can we prove these congruent?
We can prove this congruent by using AAS
Geez I think I'm losing my touch but I hope this is correct and it helped!
Answer:
Clearly from 1 to 15 we can only have the sum 6,9,12 and 15 to be divisible by 3.
Now meaning we have 4! ( 4 factorial) which implies 4x3x2x1= 24 .
We have 24 ways to pick distinct integers that are divisible by 3.
Step-by-step explanation:
The first thing you need to do is to look for numbers that are divisible by 3. Then you take its factorial
Answer:
66
Step-by-step explanation:
If there are <em>n</em> students, then the number of pairs is 
.
With 12 students, 
pairs can be formed.
The reason the formula works is this: Each of the 12 students can be paired with 11 other students (no student is paired with him/her self). But counting 12 x 11 = 132 counts each pair <u>twice</u>. Example: student A can be paired with student B,..., student B can be paired with student A. The pair was counted two times.
See the attached image that shows pairings of 5 students. There are
5(5 - 1)/2 = 5(4)/2 = 10 pairs.
It is the multiplying factor for the whole equation if that makes sense.
