Answer:
129
Step-by-step explanation:
If you are finding the answer of the hole thing you need to add 49+90
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
The partial products that Lucas would need to solve this problem would be 3,740 and 187,000 if you are multiplying 374 on the top column and 510 on the bottom column. Or, the partial products Lucas would need is 2,040 and 35,700 and 153,000. Both partial products combination added together would be 190,740.
