Okay I am going to explain to you and show you how to get the correct answer.
Fist you need to find the Greatest common factor which is 45 because 5×9=45
8/9=40/45
+3/5=27/45
__________
67/45 is reduced to 1 22/45
5 goes into 45 9 times so 3 times 7 equals 27 and 9 goes into 45 5 times so 8 times 5 equals 40 you add both numbers up and get 67. 67 can't go into 45 so you subtract 67 from 45. 45 goes into 67 1 time so that is your whole the number. 22 is left over so that is your numerator. The denominator remains the same.
By geometric and algebraic properties the angles BTC, TBC and TBC from the triangle BTC are 128°, 26° and 26°, respectively.
<h3>How to determine the angles of a triangle inscribed in a circle</h3>
According to the figure, the triangle BTC is inscribed in the circle by two points (B, C). In this question we must make use of concepts of diameter and triangles to determine all missing angles.
Since AT and BT represent the radii of the circle, then the triangle ABT is an <em>isosceles</em> triangle. By geometry we know that the sum of <em>internal</em> angles of a triangle equals 180°. Hence, the measure of the angles A and B is 64°.
The angles ATB and BTC are <em>supplmentary</em> and therefore the measure of the latter is 128°. The triangle BTC is also an <em>isosceles</em> triangle and the measure of angles TBC and TCB is 26°.
By geometric and algebraic properties the angles BTC, TBC and TBC from the triangle BTC are 128°, 26° and 26°, respectively.
To learn more on triangles, we kindly invite to check this verified question: brainly.com/question/2773823
111 would be the y-intercept. This is because 111 is on the y-axis.
Answer:
B
Step-by-step explanation:
Answer:
There are 35990 ways in which 2 or 3 nodes fail
Step-by-step explanation:
Given : A computer network has 60 switching nodes.
To Find : In how many ways can 2 or 3 nodes fail?
Solution:
We are supposed to find no. of ways can 2 or 3 nodes fail.
So, we will use combination here .
No. of ways can 2 or 3 nodes fail=
Formula : 
No. of ways can 2 or 3 nodes fail=
=
Hence there are 35990 ways in which 2 or 3 nodes fail
