--%>

Problem on reduced row-echelon

The augmented matrix from a system of linear equations has the following reduced row-echelon form.

280_row echelon method.jpg

(a)  How many equations are there in the system?
(b)  How many variables are there in the system?
(c)  How many of the variables are independent variables?
(d)  Write out the solution set for the system.

   Related Questions in Mathematics

  • Q : Containee problem For queries Q 1 and Q

    For queries Q1 and Q2, we say Q1 is containedin Q2, denoted Q1 C Q2, iff Q1(D) C Q2

  • Q : Numerical solution of PDE this

    this assignment contains two parts theoretical and coding the code has to be a new. old code and modified code will appear in the university website .

  • Q : Who firstly discovered mathematical

    Who firstly discovered mathematical theory for random walks, that rediscovered later by Einstein?

  • Q : Elasticity of Demand For the demand

    For the demand function D(p)=410-0.2p(^2), find the maximum revenue.

  • Q : Properties of a group How can we say

    How can we say that the pair (G, o) is a group. Explain the properties which proof it.

  • Q : Explain Factorisation by trial division

    Factorisation by trial division: The essential idea of factorisation by trial division is straightforward. Let n be a positive integer. We know that n is either prime or has a prime divisor less than or equal to √n. Therefore, if we divide n in

  • Q : Probability assignments 1. Smith keeps

    1. Smith keeps track of poor work. Often on afternoon it is 5%. If he checks 300 of 7500 instruments what is probability he will find less than 20substandard? 2. Realtors estimate that 23% of homes purchased in 2004 were considered investment properties. If a sample of 800 homes sold in 2

  • Q : Row-echelon matrix Determine into which

    Determine into which of the following 3 kinds (A), (B) and (C) the matrices (a) to (e) beneath can be categorized:       Type (A): The matrix is in both reduced row-echelon form and row-echelon form. Type (B): The matrix

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th

  • Q : Explain Factorisation by Fermats method

    Factorisation by Fermat's method: This method, dating from 1643, depends on a simple and standard algebraic identity. Fermat's observation is that if we wish to nd two factors of n, it is enough if we can express n as the di fference of two squares.