All categories

3 years ago

Byron has his own bakery. He bakes 84 cakes each week. How many can he make in one day?

Mathematics

2 answers:

Lerok [7]3 years ago

8 0

Answer: 12 cakes

Step-by-step explanation:

gladu [14]3 years ago

4 0

Answer: 12 cakes a day

Step-by-step explanation: You would have to divide the number of cakes he makes in a week with 7, since there are 7 days a week. He can bake 12 cakes a day to make a total of 84 at the end of the week.

84/7=12

You might be interested in

Jack wants to buy a pair of trousers for $60 when he went to the store he found that the prices marked down by 20% how much do t

blondinia [14]

To find the discount, multiply 60 by .2, which is 12. Now subtract 12 from 60. The trousers should cost $48 now because the cost has been reduced by 20% of 60, which is $12.

7 0

4 years ago

Read 2 more answers

The lengths of the sides of a triangle are x,x+1 and 7 centimeters and the perimeter of the triangle is 56 centimeters. The equa

____ [38]

Answer:

the longest side is 25

Step-by-step explanation:

the equation would be x+ x+1 + 7 for the 3 sides of the triangle

x + (x+1) + 7=56

combine like terms

2x+8 = 56

subtract 8 from each side

2x = 48

divide by 2

x = 24

the sides are

x=24

x+1 = 25

the longest side is 25

7 0

3 years ago

What triangle is called with 2 pairs of parallel sides and 4 right angles

vlada-n [284]

This is impossible for a triangle to have however, your description perfectly matches a square or a rectangle

8 0

3 years ago

Eight children want to share 6 oranges so that everyone gets the same amount. How much of the oranges can each child have?

Leya [2.2K]

That would be 6 divided by 8 so the answer is 0.75 hope that helped!!

5 0

3 years ago

Read 2 more answers

If S is countable and nonempty, prove their exist a surjection g: N --> S

aleksley [76]

Answer with Step-by-step explanation:

We are given S be any set which is countable and nonempty.

We have to prove that their exist a surjection g:N $\rightarrow S$

Surjection: It is also called onto function .When cardinality of domain set is greater than or equal to cardinality of range set then the function is onto

Cardinality of natural numbers set = $\chi_0$ ( Aleph naught)

There are two cases

1.S is finite nonempty set

2.S is countably infinite set

1.When S is finite set and nonempty set

Then cardinality of set S is any constant number which is less than the cardinality of set of natura number

Therefore, their exist a surjection from N to S.

2.When S is countably infinite set and cardinality with aleph naught

Then cardinality of set S is equal to cardinality of set of natural .Therefore, their exist a surjection from N to S.

Hence, proved

8 0

3 years ago