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:
I'm not sure but 19.2
Step-by-step explanation:
I'm sorry if its wrong
-8t+6+6t=5t-2
-2t+6=5t-2
-2t-5t=-2-6
-7t=-8
-7 -7
T=1.14 or 1 1/7
