--%>
Assignment Help - homework help

Problem on Linear equations

Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2 pounds of grapes and paid $4.45.

(a) Let x = price of a pound of apples,  and y = price of a pound of bananas and z = price of a pound of grapes.  Write out three linear equations symbolizing the purchases of Anny, Betti and Karol.

(b) Write down the augmented matrix for your system of three linear equations of part (a).

(c) Employ elementary row operations to reduce the row augmented matrix of part (b) to a reduced row-echelon matrix.

(d) Determine the price per pound for each of 3 fruits?

   Related Questions in Mathematics

  • Q : Abstract Boolean Algebra I. Boolean

    I. Boolean Algebra Define an abstract Boolean Algebra, B,  as follows:  The three operations are:  +   ( x + y addition) ( x y multiplic

    		•
  • Q : Problem on inventory merchandise AB

    AB Department Store expects to generate the following sales figures for the next three months:                            

    		•
  • Q : Nonlinear integer programming problem

    Explain Nonlinear integer programming problem with an example ?

    		•
  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

    		•
  • Q : Problem on Linear equations Anny, Betti

    Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2

    		•
  • 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 : Set Theory & Model of a Boolean Algebra

    II. Prove that Set Theory is a Model of a Boolean Algebra The three Boolean operations of Set Theory are the three set operations of union (U), intersection (upside down U), and complement ~.  Addition is set

    		•
  • Q : Statistics math Detailed explanation of

    Detailed explanation of requirements for Part C-1 The assignment states the following requirement for Part 1, which is due at the end of Week 4: “Choose a topic from your field of study. Keep in mind you will need to collect at least [sic] 3- points of data for this project. Construct the sheet y

    		•
  • Q : Who developed a rigorous theory for

    Who developed a rigorous theory for Brownian motion?

    		•
  • Q : Who had find Monte Carlo and finite

    Who had find Monte Carlo and finite differences of the binomial model?

    		•