Answer:
scalene
hope this helps
have a good day :)
Step-by-step explanation:
Answer:
Infinite
Step-by-step explanation:
I think there is something missing in the problem.
Answer:
It isn't possible.
Step-by-step explanation:
Let G be a graph with n vertices. There are n possible degrees: 0,1,...,n-1.
Observe that a graph can not contain a vertice with degree n-1 and a vertice with degree 0 because if one of the vertices has degree n-1 means that this vertice is adjacent to all others vertices, then the other vertices has at least degree 1.
Then there are n vertices and n-1 possible degrees. By the pigeon principle there are two vertices that have the same degree.
The exterior angle of a triangle is equal to the sum of the other 2 oposite interior angles
therfor
95=4x-8+3x-18
95=7x-24
add 24 both sides
119=7x
divide both sides by 7
17=x
sub back
4x-8
4(17)-8
68-8
60=∠F
3x-16
3(17)-16
51-16
35=∠G
