C
Like two walls they touch the whole line
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
If the transformed equation is g (x) = (1/x + 4) - 6, then the equation was shifted 4 units left, and translated 6 units down.
Y-int, x=0
y = 2(0) therefore y-int is (0,0)
x-int, y=0
0=2x
x = 0 therefore x-int is (0,0)
Answer:
In 3.75 years, you will have $865.30
Step-by-step explanation:
