solution to system of equations
Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
In a system of equations AX = B.
by Cramer's rule if det(A)=0, then the system will have no solution but on the other hand, in non-homogeneous system of equations suppose the rank of square matrix nxn is (n-1) and rank of the augmented matrix[A|B] is also having the same rank but then we say that system is consistent, having rank < no. of variables implies infinitely many solutions.
how is this correct?
I mean if the rank of A is n-1 < n and rank(A) = rank(A|B), then it also implies that determinant of square matrix nxn is zero but then we say it is consistent.
pls correct me if my theory is wrong too.
linear-algebra systems-of-equations
add a comment |Â
up vote
2
down vote
favorite
In a system of equations AX = B.
by Cramer's rule if det(A)=0, then the system will have no solution but on the other hand, in non-homogeneous system of equations suppose the rank of square matrix nxn is (n-1) and rank of the augmented matrix[A|B] is also having the same rank but then we say that system is consistent, having rank < no. of variables implies infinitely many solutions.
how is this correct?
I mean if the rank of A is n-1 < n and rank(A) = rank(A|B), then it also implies that determinant of square matrix nxn is zero but then we say it is consistent.
pls correct me if my theory is wrong too.
linear-algebra systems-of-equations
add a comment |Â
up vote
2
down vote
favorite
up vote
2
down vote
favorite
In a system of equations AX = B.
by Cramer's rule if det(A)=0, then the system will have no solution but on the other hand, in non-homogeneous system of equations suppose the rank of square matrix nxn is (n-1) and rank of the augmented matrix[A|B] is also having the same rank but then we say that system is consistent, having rank < no. of variables implies infinitely many solutions.
how is this correct?
I mean if the rank of A is n-1 < n and rank(A) = rank(A|B), then it also implies that determinant of square matrix nxn is zero but then we say it is consistent.
pls correct me if my theory is wrong too.
linear-algebra systems-of-equations
In a system of equations AX = B.
by Cramer's rule if det(A)=0, then the system will have no solution but on the other hand, in non-homogeneous system of equations suppose the rank of square matrix nxn is (n-1) and rank of the augmented matrix[A|B] is also having the same rank but then we say that system is consistent, having rank < no. of variables implies infinitely many solutions.
how is this correct?
I mean if the rank of A is n-1 < n and rank(A) = rank(A|B), then it also implies that determinant of square matrix nxn is zero but then we say it is consistent.
pls correct me if my theory is wrong too.
linear-algebra systems-of-equations
edited Aug 15 at 12:43
Harry Peter
5,49311438
5,49311438
asked Aug 10 at 5:12
ashwani yadav
234
234
add a comment |Â
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
3
down vote
accepted
Cramer rule doesn't says that when determinant is zero, it has no solution. When the determinant is zero, the system can either have no solution (inconsistent) or infinitely many solutions (consistent).
Cramer rule gives us a way to compute the solution when the solution is unique.
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
add a comment |Â
up vote
3
down vote
For the system of two equations:
$ax+by=c$ and $Ax+By=C$
compute $D=beginvmatrixa&b\A&Bendvmatrix$, $D_x=beginvmatrixc&b\C&Bendvmatrix$ and $D_y=beginvmatrixa&c\A&Cendvmatrix$. Now you have two cases:
- If $Dne 0$ then the unique solution is $x=fracD_xD$ and $y=fracD_yD$.
- If $D=0$ then Cramer's rule fails to give the solution (if it exists).
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Cramer rule doesn't says that when determinant is zero, it has no solution. When the determinant is zero, the system can either have no solution (inconsistent) or infinitely many solutions (consistent).
Cramer rule gives us a way to compute the solution when the solution is unique.
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
add a comment |Â
up vote
3
down vote
accepted
Cramer rule doesn't says that when determinant is zero, it has no solution. When the determinant is zero, the system can either have no solution (inconsistent) or infinitely many solutions (consistent).
Cramer rule gives us a way to compute the solution when the solution is unique.
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
add a comment |Â
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Cramer rule doesn't says that when determinant is zero, it has no solution. When the determinant is zero, the system can either have no solution (inconsistent) or infinitely many solutions (consistent).
Cramer rule gives us a way to compute the solution when the solution is unique.
Cramer rule doesn't says that when determinant is zero, it has no solution. When the determinant is zero, the system can either have no solution (inconsistent) or infinitely many solutions (consistent).
Cramer rule gives us a way to compute the solution when the solution is unique.
answered Aug 10 at 5:13
Siong Thye Goh
80.5k1453101
80.5k1453101
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
add a comment |Â
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
thanks , doing a question got mistaken somewhere
â ashwani yadav
Aug 10 at 5:19
add a comment |Â
up vote
3
down vote
For the system of two equations:
$ax+by=c$ and $Ax+By=C$
compute $D=beginvmatrixa&b\A&Bendvmatrix$, $D_x=beginvmatrixc&b\C&Bendvmatrix$ and $D_y=beginvmatrixa&c\A&Cendvmatrix$. Now you have two cases:
- If $Dne 0$ then the unique solution is $x=fracD_xD$ and $y=fracD_yD$.
- If $D=0$ then Cramer's rule fails to give the solution (if it exists).
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
add a comment |Â
up vote
3
down vote
For the system of two equations:
$ax+by=c$ and $Ax+By=C$
compute $D=beginvmatrixa&b\A&Bendvmatrix$, $D_x=beginvmatrixc&b\C&Bendvmatrix$ and $D_y=beginvmatrixa&c\A&Cendvmatrix$. Now you have two cases:
- If $Dne 0$ then the unique solution is $x=fracD_xD$ and $y=fracD_yD$.
- If $D=0$ then Cramer's rule fails to give the solution (if it exists).
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
add a comment |Â
up vote
3
down vote
up vote
3
down vote
For the system of two equations:
$ax+by=c$ and $Ax+By=C$
compute $D=beginvmatrixa&b\A&Bendvmatrix$, $D_x=beginvmatrixc&b\C&Bendvmatrix$ and $D_y=beginvmatrixa&c\A&Cendvmatrix$. Now you have two cases:
- If $Dne 0$ then the unique solution is $x=fracD_xD$ and $y=fracD_yD$.
- If $D=0$ then Cramer's rule fails to give the solution (if it exists).
For the system of two equations:
$ax+by=c$ and $Ax+By=C$
compute $D=beginvmatrixa&b\A&Bendvmatrix$, $D_x=beginvmatrixc&b\C&Bendvmatrix$ and $D_y=beginvmatrixa&c\A&Cendvmatrix$. Now you have two cases:
- If $Dne 0$ then the unique solution is $x=fracD_xD$ and $y=fracD_yD$.
- If $D=0$ then Cramer's rule fails to give the solution (if it exists).
edited Aug 10 at 6:14
answered Aug 10 at 6:03
Mathlover
3,5681021
3,5681021
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
add a comment |Â
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Since when could you divide matrices?
â Chase Ryan Taylor
Aug 10 at 6:12
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
Oh sorry! I used wrong brackets for determinats.
â Mathlover
Aug 10 at 6:13
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
$ddotsmile$
â Chase Ryan Taylor
Aug 10 at 6:14
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
Edited it @Chase Ryan Taylor. Thanks a lot!
â Mathlover
Aug 10 at 6:15
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2878001%2fsolution-to-system-of-equations%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password