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
Answer:
3 hrs thats my anwser
Step-by-step explanation:
brainliest if right
Answer:
Positive
Step-by-step explanation:
Answer:
im pretty sure its B
Step-by-step explanation:
Answer:
answer is 7x
Step-by-step explanation:
collect like terms by subtracting their coefficient
(9-2) =7x
that's how you get your answer
