A monkey collects 60 coconuts and wants to store them in stacks that each contain the same number of coconuts. Describe all the different stacks the monkey can make, including the number of coconuts in each stack. Then find the prime factorization of 60. The monkey can make 1 stack of , 2 stacks of , 3 stacks of , 4 stacks of , 5 stacks of , 6 stacks of , 60 stacks of , 30 stacks of , 20 stacks of , 15 stacks of , 12 stacks of and 10 stacks of . The prime factorization of 60 is

1 stack of 60

2 stacks of 30

3 stacks of 20

4 stacks of 15

5 stacks of 12

6 stacks of 10

60 stacks of 1

30 stacks of 2

20 stacks of 3

15 stacks of 4

12 stacks of 5

Prime Factorisation

Step-by-step explanation:

To find the number of stacks you can make just divide the total by the size of the stacks. This also works in reverse.

To find the prime factorisation you just find the factors of the number by dividing it by the largest prime possible.

i think this could be a possible answer (1 / 84) -1

good luck! : d

im not sure

step-by-step explanation: