Answer:
(3,-7)
Step-by-step explanation:
Using the algebraic rule for Rx-axis
(x,y)---->(x,-y)
(3,7)--->(3,-7)
Answer:
y=-x-5
Step-by-step explanation:
m=(y2-y1)/(x2-x1)
m=(-8-(-1))/(3-(-4))
m=(-8+1)/(3+4)
m=-7/7
m=-1
y-y1=m(x-x1)
y-(-1)=-1(x-(-4))
y+1=-1(x+4)
y+1=-x-4
y=-x-4-1
y=-x-5
Please mark me as Brainliest if you're satisfied with the answer.
Answer:
I can't answer this unless you give more information to the question.
It's b 240000
I'm sorry if wrong I'm not too good at these things
Consider a homogeneous machine of four linear equations in five unknowns are all multiples of 1 non-0 solution. Objective is to give an explanation for the gadget have an answer for each viable preference of constants on the proper facets of the equations.
Yes, it's miles true.
Consider the machine as Ax = 0. in which A is 4x5 matrix.
From given dim Nul A=1. Since, the rank theorem states that
The dimensions of the column space and the row space of a mxn matrix A are equal. This not unusual size, the rank of matrix A, additionally equals the number of pivot positions in A and satisfies the equation
rank A+ dim NulA = n
dim NulA =n- rank A
Rank A = 5 - dim Nul A
Rank A = 4
Thus, the measurement of dim Col A = rank A = five
And since Col A is a subspace of R^4, Col A = R^4.
So, every vector b in R^4 also in Col A, and Ax = b, has an answer for all b. Hence, the structures have an answer for every viable preference of constants on the right aspects of the equations.
