There are certain cases that need to be taken into consideration: 1. If the lines intersect at one point the solution that fits all equations is exactly that point. 2. If the lines do not intersect at only one point the system has no solution because the lines 3. If the system of equations intersects completely overlaps the other line we say that we have an infinite number of solutions that fits the equations.
Better picture please and thanks
By the recursive definition,




Answer:

Step-by-step explanation:
Given:
m<FGK = (7w + 3)°
m<FGH = 104°
angle bisector of <FGH = GK
Required:
Value of w
SOLUTION:
Since GK bisects angle FGH, it divides the angle into two equal parts. Therefore, the following equation can be generated to find the value of w:
m<FGH = 2*m<FGK
(substitution)
Divide both sides by 2


Subtract 3 from each side


Divide both sides by 7



Answer:
unreadable score = 35
Step-by-step explanation:
We are trying to find the score of one exam that is no longer readable, let's give that score the name "x". we can also give the addition of the rest of 9 readable s scores the letter "R".
There are two things we know, and for which we are going to create equations containing the unknowns "x", and "R":
1) The mean score of ALL exams (including the unreadable one) is 80
so the equation to represent this statement is:
mean of ALL exams = 80
By writing the mean of ALL scores (as the total of all scores added including "x") we can re-write the equation as:

since the mean is the addition of all values divided the total number of exams.
in a similar way we can write what the mean of just the readable exams is:
(notice that this time we don't include the grade x in the addition, and we divide by 9 instead of 10 because only 9 exams are being considered for this mean.
Based on the equation above, we can find what "R" is by multiplying both sides by 9:

Therefore we can now use this value of R in the very first equation we created, and solve for "x":
