--%>
Assignment Help - homework help

Problem on sales and budget

XYZ Farm Supply data regarding the store's operations follow:

• Sales are budgeted at $480,000 for November, $430,000 for December, and $340,000 for January.

• Collections are expected to be 65% in the month of sale, 35% in the month following the sale.

• The cost of goods sold is 77% of sales.

• The company purchases 52% of its merchandise in the month prior to the month of sale and 48% in the month of sale. Payment for merchandise is made in the month following the purchase.

• Monthly selling & administrative expenses to be paid in cash are $20,900.

• Monthly depreciation is $21,700.

• Ignore taxes.

The net income for December would be:

A) $37,300
B) $56,300
C) $51,700
D) $35,300

   Related Questions in Mathematics

  • Q : Uniform scaling what is uniform scaling

    what is uniform scaling in computer graphic

    		•
  • 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 : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

    		•
  • Q : Who derived the Black–Scholes Equation

    Who derived the Black–Scholes Equation?

    		•
  • Q : Formal logic It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

    		•
  • Q : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f

    		•
  • Q : Problem on Fermats method A public key

    A public key for RSA is published as n = 17947 and a = 3. (i) Use Fermat’s method to factor n. (ii) Check that this defines a valid system and find the private key X.

    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 : Formal logic It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

    		•
  • Q : Logic and math The homework is attached

    The homework is attached in the first two files, it's is related to Sider's book, which is "Logic for philosophy" I attached this book too, it's the third file.

    		•