1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
ryzh [129]
3 years ago
9

complete the proof. give: EH and GI bisect each other. prove: triangle EFI is congruent to triangle HFG

Mathematics
2 answers:
qaws [65]3 years ago
5 0
<span>A. 4. EFI = HFG 4. Vertical angles
5. EFI = HFG 5. SAS
is this it?</span>
Vanyuwa [196]3 years ago
5 0

Given: Line Segment EH and GI bisect each other at F.

To Prove : Δ EFI ≅ ΔHFG

Proof:

In Δ E F I and ΔH F G

E F = F H→→[Given]

G F = F I →→[Given]

∠ E F I ≅ ∠ G F H→→[Vertically opposite angles]

Δ EFI ≅ ΔHFG→→→[Side Angle Side Congruency criterion]

You might be interested in
Can someone answer this question please
Naddik [55]

Answer:

118

Step-by-step explanation:

3 0
3 years ago
Read 2 more answers
EMERGENCY please help thank you !!!!
MArishka [77]

Answer:

last one

Step-by-step explanation:

8 0
3 years ago
Read 2 more answers
Please help what is the area?
ratelena [41]

Answer: 70 square units

6 0
3 years ago
Say a hacker has a list of n distinct password candidates, only one of which will successfully log her into a secure system. a.
alexdok [17]

Answer:

The probability is \frac{1}{n}

Step-by-step explanation:

If she has n distinct password candidates and only one of which will successfully log her into a secure system, the probability that her first first successful login will be on her k-th try is:

If k=1

P = \frac{1}{n}

Because, in her first try she has n possibles options and just one give her a successful login.

If k=2

P=\frac{n-1}{n} *\frac{1}{n-1} =\frac{1}{n}

Because, in her first try she has n possibles options and n-1 that are not correct, then, she has n-1 possibles options and 1 of that give her a successful login.

If k=3

P=\frac{n-1}{n} *\frac{n-2}{n-1} *\frac{1}{n-2} = \frac{1}{n}

Because, in her first try she has n possibles options and n-1 that are not correct, then, she has n-1 possibles options and n-2 that are not correct and after that, she has n-2 possibles options and 1 give her a successful login.

Finally, no matter what is the value of k, the probability that her first successful login will be (exactly) on her k-th try is 1/n

7 0
3 years ago
BRAINLIEST FOR AN ACTUAL ANSWER
Andreyy89

Answer:

The correct pair of functions is the third one:  h(x)=(x−24)^2 and g(x)=x2

Step-by-step explanation:

Example:  If we have q(x) = x^2 and its graph, moving the vertex of this graph 24 units to the right results in r(x) = (x - 24)^2.

The correct pair of functions is the third one:  h(x)=(x−24)^2 and g(x)=x2

Note:  the fourth pair is incorrect, because the " + " sign moves the graph of x^2 24 units to the left.

3 0
3 years ago
Other questions:
  • It takes Bill 3 minutes to eat one apple and it takes Frank 5 minutes to eat 2 apples. How long would it take for frank and bill
    6·1 answer
  • The fee a bank pays you to keep
    8·1 answer
  • The average marks obtain by three students is 15.if 2 students obtain 12 and 18 Marks respectively find the marks obtained by th
    9·1 answer
  • Write and equation for a line perpendicular to 3y+15x=-12 and passing through the point (5,6)
    5·1 answer
  • 20 different comic books will be distributed to five kids. (a) How many ways are there to distribute the comic books if there ar
    7·1 answer
  • Helppp please!!!!!!!!!!!
    14·1 answer
  • 5/6 + 1/3 + 1/2 + 3/4 = ?
    9·2 answers
  • 2. Solve the quadratic by taking square roots. Write your answer with no spaces as x=a,-a where a and -a are the values you foun
    13·1 answer
  • PLEASE ANSWER ASAP !!!!!!!!!!!!!!!!!!! WILL GET BRAINLEST IF CORRECT!!!!!!!!!!!!!!!!!!!!!!
    6·1 answer
  • 1. Check whether the following numbers are in proportion or not:
    13·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!