Computer Sciences > GATE 2021 SET-2 > Linear Algebra
Suppose that P is a 4 x 5 matrix such that every solution of the equation Px = 0 is a scalar multiple of [2 5 4 3 1]T. The rank of P is _______.

Explanation

Correct : 4 to 4

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science