suyín has 135 pennies and 225 nickels. she wants to place them all in stacks so that each stack has the same number of coins, and each stack contains only one denomination of coin. what is the greatest number of coins that she can place in each stack?

 45

Step-by-step explanation:

Given : Suyín has 135 pennies and 225 nickels.

She wants to place them all in stacks so that each stack has the same number of coins, and each stack contains only one denomination of coin.

To find the greatest number of coins that she can place in each stack, we need to find the greatest common factor of 135 and 225.

The prime factorization of 135 and 255 are :-

We can see that the greatest common factor of 135 and 225 is

Hence, the greatest number of coins that she can place in each stack = 45

i can answer this question sweetie!

step-by-step explanation:

step-by-step explanation:

i found the koficent of the linear function and i foun c acordind to the strict formula y=kx+c and then i took 2 as an x and replacet it on the formula i found and then foun the y