first get all variables on the same side, then use elimination to solve.
x = -3
y = -11
A. 15
b. 26
d. 41
e. 82
f. 98
h. 49
If there are n people, each person could shake hands with 0 people, 1 person, 2 people,... on up to shaking hands with n − 1
people. Count how many different answers there are to asking the person the question "How many hands did you shake?" How many people are there? If the people are the pigeons, and the possible answers to the question "how many hands did you shake" are the holes, can we conclude anything yet? No? How about now noticing that at least one of the holes "I shook hands with noone" or "I shook hands with everyone" has to be empty... now what?
"Since there are more pigeons than holes there must be a hole with at least two pigeons in the same hole" Now, replace the word "pigeons" and "holes" with the appropriate terms for the context of your specific question, remember we are talking about people and number of handshakes they participated in.
Answer:
ckfgfuf go he z v g b I g to
Step-by-step explanation:
c I'm x go bc to ggzh it ti
Answer:
The two triangles are related by Side-Side-Side (SSS), so the triangles can be proven congruent.
Step-by-step explanation:
There are no angles that can be shown to be congruent to one another, so this eliminates all answer choices with angles (SSA, SAS, ASA, AAA, AAS).
This leaves you with either the HL (Hypotenuse-Leg) Theorem or SSS (Side-Side-Side) Theorem. We could claim that the triangles can be proven congruent by HL, however, we aren't exactly sure as to whether or not the triangles have a right angle. There is no indicator, and in this case, we cannot assume so.
This leaves you with the SSS Theorem.
