Answer:
where is the question????
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:
70
-----
20
Step-by-step explanation:
mark me as brilliant
(5, 12) e (-10, -3)
x.......y...1
5.....12..1
-10..-3..1
12x -10y -15 + 120 -5y + 3x = 0
12x + 3x - 10y - 5y - 15 + 120 = 0
15x - 15y + 105 = 0 :(5)
3x - 5y + 21 = 0
m = -a/b
m = -3/-5
m(5) = 3/5
y-yo = m(x-xo)
y-14 = 3/5*(x-7)
y-14 = 3x/5 - 7/5
3x/5 - y + 14 - 7/5 = 0
3x/5 - 5y/5 + 70/5 - 7/5 = 0
3x - 5y + 70 - 7 =0
3x - 5y + 63 = 0
m(s) = -3/-5 = 3/5
m(r) = m(s) --> são paralelas
