1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Nastasia [14]
2 years ago
15

HELP ASAP PLEASE! Accounting class! Lorge Corporation has collected the following information after its first year of sales. Sal

es were $1,575,000 on 105,000 units; selling expenses $250,000 (40% variable and 60% fixed); direct materials $606,100; direct labor $250,000; administrative expenses $270,000 (20% variable and 80% fixed); and manufacturing overhead $357,000 (70% variable and 30% fixed). Top management has asked you to do a CVP analysis so that it can make plans for the coming year. It has projected that unit sales will increase by 10% next year.
(See screenshots)

Mathematics
1 answer:
abruzzese [7]2 years ago
3 0

Answer:

what is thia

Step-by-step explanation:

i have no idea what you juat said like fr what topic is this im too bored to read the queation

You might be interested in
En la preparación de un perfume se cuenta con dos tipos de esencia base: 1600 ml de una y 1680 ml de otra. Se quiere envasarlas,
Lostsunrise [7]

Answer:

33,600 frascos

Step-by-step explanation:

Resolvemos esta pregunta utilizando el método mínimo común múltiple

Encuentre y enumere los múltiplos de 1600 y 1680 hasta encontrar el primer múltiplo común. Este es el mínimo común múltiplo.

Múltiplos de 1600:

1600, 3200, 4800, 6400, 8000, 9600, 11200, 12800, 14400, 16000, 17600, 19200, 20800, 22400, 24000, 25600, 27200, 28800, 30400, 32000, 33600, 35200, 36800

Múltiplos de 1680:

1680, 3360, 5040, 6720, 8400, 10080, 11760, 13440, 15120, 16800, 18480, 20160, 21840, 23520, 25200, 26880, 28560, 30240, 31920, 33600, 35280, 36960

Por lo tanto,

LCM (1600, 1680) = 33,600

La menor cantidad de frascos necesarios es 33,600 frascos.

4 0
3 years ago
Is -100 rational or irational
pychu [463]

-100 is rational.

-100 can be turned into a fraction by doing the following...

Just put 1 underneath -100 and you get \frac{-100}{1}

So that means it is rational since it can be a fraction!

4 0
2 years ago
Weatherwise magazine is published in association with the American Meteorological Society. Volume 46, Number 6 has a rating syst
lisabon 2012 [21]

Answer:

a)  c) μ = 16.4.

b)  d) μ > 16.4.

c) a) μ < 16.4.

d) c) μ ≠ 16.4.

e)  d) right; left; both.

Step-by-step explanation:

Question a:

Test if it is getting worse, so at the alternative hypothesis we test if the mean is of greater than 16.4 inches, but at the null hypothesis we test if it is still of 16.4 options, so option C.

Question b:

At the alternative hypothesis we test if the mean is of greater than 16.4 inches, as said above, so the answer is given by option d.

Question c:

Dying down, so if the mean is lower than 16.4 inches, so option a.

Question d:

Don't know, so just test if it is different, which includes both lower or greater, so the correct answer is given by option c.

Question e:

Test if more -> right, so on question b) is a right tailed test.

Test if less -> left, so on question c) is a left tailed test.

Different -> both sides, so on question d) it is a two-tailed test.

Thus the correct answer is given by option d.

3 0
3 years ago
A) Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0s.
Fed [463]

Answer:

A) a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

B) a_{0} = a_{1} = 0

C)   for n = 2

  a_{2} = 1

for n = 3

 a_{3} = 3

for n = 4

a_{4} = 8

for n = 5

a_{5} = 19

Step-by-step explanation:

A) A recurrence relation for the number of bit strings of length n that contain a  pair of consecutive Os can be represented below

if a string (n ) ends with 00 for n-2 positions there are a pair of  consecutive Os therefore there will be : 2^{n-2} strings

therefore for n ≥ 2

The recurrence relation for the number of bit strings of length 'n' that contains consecutive Os

a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

b ) The initial conditions

The initial conditions are : a_{0} = a_{1} = 0

C) The number of bit strings of length seven containing two consecutive 0s

here we apply the re occurrence relation and the initial conditions

a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

for n = 2

  a_{2} = 1

for n = 3

 a_{3} = 3

for n = 4

a_{4} = 8

for n = 5

a_{5} = 19

7 0
3 years ago
When adding two<br> rational numbers what<br> will the sign be if both<br> numbers are positive?
NikAS [45]

Answer:

Step-by-step explanation:

Adding two rational numbers results in a positive sum.

4 0
3 years ago
Other questions:
  • If you study hard, then you can pass the tests.
    12·1 answer
  • Triangle ABC has vertices A(1,4), B(???2,4) , and C(???1,???1) . A dilation with a scale factor of 0.25 and center at the origin
    10·1 answer
  • Jeff saved $500 from his summer job so he would have spending money during the school year. He withdraws $12 from his account ea
    12·1 answer
  • Solve for x.<br> 7 inches<br> Х<br> 11 inches
    15·1 answer
  • Please answer this question now
    6·1 answer
  • Colin invests £100 into his bank account.
    8·2 answers
  • PLEASEEEE HELLLPPPPP
    8·1 answer
  • Find the 30th term of the following sequence. 1, 7, 13, 19, ...
    7·1 answer
  • HELP ME PLEASE IM BEGGING YOU
    13·1 answer
  • HELP ASAP.....NO LINKS AND NO TROLLING
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!