menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

TIFR-2011-Maths-A-13

1 vote
232 views
$A$ is $3 \times 4$-matrix of rank $3$. Then the system of equations,

$Ax = b$

has exactly one solution.
in Linear Algebra 232 views

1 Answer

1 vote
FALSE

A is 3*4 matrix ; here m<n means 3<4

Rank(A)=3=m

so , number of solution is always infinity.
0
Both ‘infinite’ and ‘no solution’ possible
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

2 votes
1 answer
1
293 views
TIFR-2011-Maths-B-13
Any non-singular $k \times k$-matrix with real entries can be made singular by changing exactly one entry.
Any non-singular $k \times k$-matrix with real entries can be made singular by changing exactly one entry.
asked Dec 10, 2015 in Linear Algebra makhdoom ghaya 293 views
4 votes
1 answer
2
472 views
TIFR-2011-Maths-A-3
Let $A$ be a $5 \times 5$ matrix with real entries, then $A$ has An eigenvalue which is purely imaginary At least one real eigenvalue At least two eigenvalues which are not real At least $2$ distinct real eigenvalues
Let $A$ be a $5 \times 5$ matrix with real entries, then $A$ has An eigenvalue which is purely imaginary At least one real eigenvalue At least two eigenvalues which are not real At least $2$ distinct real eigenvalues
asked Dec 9, 2015 in Linear Algebra makhdoom ghaya 472 views
2 votes
1 answer
3
245 views
TIFR-2011-Maths-B-8
If $A$ and $B$ are $3 \times 3$ matrices and $A$ is invertible, then there exists an integer $n$ such that $A + nB$ is invertible.
If $A$ and $B$ are $3 \times 3$ matrices and $A$ is invertible, then there exists an integer $n$ such that $A + nB$ is invertible.
asked Dec 9, 2015 in Linear Algebra makhdoom ghaya 245 views
1 vote
0 answers
4
149 views
TIFR-2011-Maths-B-1
State True or False Let $A$ be a $2 \times 2$-matrix with complex entries. The number of $2 \times 2$-matrices $A$ with complex entries satisfying the equation $A^{3}$ is infinite.
State True or False Let $A$ be a $2 \times 2$-matrix with complex entries. The number of $2 \times 2$-matrices $A$ with complex entries satisfying the equation $A^{3}$ is infinite.
asked Dec 9, 2015 in Linear Algebra makhdoom ghaya 149 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...