<h2><u>
PLEASE MARK BRAINLIEST!</u></h2>
Answer:
The two congruent segments are EF and GF, and EH and GH.
Step-by-step explanation:
That being said, your answer is A because EF and GF are in fact congruent segments.
I hope this helps!
- sincerelynini
Answer:
Step-by-step explanation:
(-1 - 5)/(0 + 3)= -6/3 = -2
y - 5 = -2(x + 3)
y - 5 = -2x - 6
y = -2x - 1
The greatest common factor would be 1 because it is the only one they have in common
Answer:
26,000,000 codes
Step-by-step explanation:
To find how many unique codes can be created, we just need to check how many possibilities there are for each letter or digit in the code.
Each letter has 26 possible values, and each digit has 10 possible values, so as we have 1 letter and 6 digits, the total number of unique codes are:
26 * 10 * 10 * 10 * 10 * 10 * 10 = 26,000,000 codes.
Answer:
mmm
Step-by-step explanation:
