The Answer to your problem is:
0.006
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:
-27
Step-by-step explanation:
Given expression:
-9(x + 3) = 27
Now use the open the bracket;
-9x - 27 = 27
Given -9x + (?) = 27
Comparing the two equations shows that the question mark corresponds to the value -27;
The solution is -27
