B. (2,20] is the correct answer
Answer:Yes
Hope this helps!
Step-by-step explanation:
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:{0,2}
Step-by-step explanation:
Substitute 4x in for the y
2x^2-4x=0
Factor out GCF 2x
2x(x-2)=0
Set each factor = 0 and solve
2x=0 x=0 x-2=0 x=2
It’s already in it’s simplest form!
