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 cant really see any answer but if I had to simplify, then the answer would be 2t - 8 + 1, which would then be simplified to 2t - 7.
Have a nice and wonderfull day.
Brainliest would be appreciated.
Step-by-step explanation:
Answer:Not Here
Step-by-step explanation:.dd
Answer:
c) ( x-15)/-8
Step-by-step explanation:
c) (x-15) / -8
Answer
1/8 3/8
Step-by-step explanation:
