All categories

3 years ago

Mina compro un queso que pesaba 3/4 de kilo .si lo partió en 1/8 de kilo cada una ¿cuantas porciones de queso pudo sacar ?

Mathematics

1 answer:

Ksju [112]3 years ago

5 0

Answer:

Tenemos.

Lo que compro de queso = 3/4 k

Cada pedazo pesa = 1/8k

Número de pedazos = (3/4)/(1/8)

Número de pedazos = (3 *8)/(4*1) = 24/4 = 6

Respuesta.

Salen 6 pedazos

Step-by-step explanation:

You might be interested in

Algebra Vocabulary Crossword help ?!

avanturin [10]

1. a relation described in word format (17 letter) is "is direct variation"

9. a way to name a function identifying its input (16 letter) is "f of x equals x square"

5 0

3 years ago

Read 2 more answers

Pls help!!!!!!!!!!!!!!!!

Mariulka [41]

Answer:

f(2) = 75

f(6) = 4091

Step-by-step explanation:

5 0

3 years ago

Harold collected data on the daily high temperature in two cities over a period of one week.

nata0808 [166]

Answer: The temperature in Carlton was always cooler than in Borden.

Step-by-step explanation:

4 0

3 years ago

Plz answer this asap first answer gets brainliest

Korvikt [17]

Answer:

g(x) has the greater max: 11 versus 6

Step-by-step explanation:

One can readily discern the max value of the graph; it is 6 and occurs at x =1.

Regarding the function g(x) = (-1/2)x^2 + 4x + 3: Find the vertex, which also represents the max value:

Here the coefficients are a = -1/2, b = 4 and c = 3, so that the axis of symmetry is:

x = -b/(2a), which here is x = -4 / ( 2·[-1/2] ) = -4 / (-1) = 4

At x = 4, the function (y) value is

g(4) = (-1/2)(4)² + 4(4) + 3, or

g(4) = -8 + 16 + 3, or 11

This is greater than the max value of the graphed function.

8 0

3 years ago

There are three nursing positions to be filled at Lilly Hospital. Position 1 is the day nursing supervisor; position 2 is the ni

Stels [109]

Answer:

There are 1716 ways the three positions can be filled by these applicants.

Step-by-step explanation:

Permutation is the number of arrangement of k items from n distinct items.

$^{n}P_{k}=\frac{n!}{(n-k)!}$

For example, permutation can be used to compute the number of ways to arrange 4 mathematics books together when arranging all the 7 books on a shelf.

In this case there are 3 available nursing positions to be filled.

A total of 13 candidates are qualified for all the three positions.

Then the number of ways the 3 positions can be filled by the 13 candidates can be determine using permutation.

Compute the possible number of selections as follows:

$^{13}P_{3}=\frac{13!}{(13-3)!}=\frac{13!}{10!}=\frac{13\times 12\times 11\times 10!}{10!}=1716$

Thus, there are 1716 ways the three positions can be filled by these applicants.

3 0

3 years ago