138 divided by 42 gives 3 with remainder 12.
63 divided by 17 also gives 3 with remainder 12.
So, we need to build another division that gives gives 3 with remainder 12.
If we want a remainder of 12, we must divide by at least 13 (the remainder can't be greater than what you're dividing for).
Since
We have that 51 divided by 13 gives 3 with remainder 12.
In general, pick any number k>12 and define
And you will be sure that n divided by k gives 3 with remainder 12.
Answer:
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.
