Answer:
-51.136
Step-by-step explanation:
Answer:
3 is the answer
Step-by-step explanation: That what you get when you multiply all of those
Answer: The greatest number of pages Kenji can decorate = 3
Step-by-step explanation:
Given: Total heart stickers = 15
Total star stickers =12
If all the papers identical, with the same combination of heart and star stickers and no stickers left over.
Then the greatest number of pages Kenji can decorate = GCD(15,12) [GCD=greatest common divisor]
Since 15 = 3 x 5
12=2 x 2 x 3
GCD(15,12) =3
Hence, the greatest number of pages Kenji can decorate = 3
First you would figure out what "x" equals. And then you would replace the "x" in your problem to figure out what the answer is.
