A. use the euclidean algorithm to find gcd(870, 153). show every step and every iteration of the algorithm, but you do not need to show each individual calculation used. b. use the euclidean algorithm to find gcd(4282, 1239). show every step and every iteration of the algorithm, but you do not need to show each individual calculation used.

i think it might be a but you might want a second opinion

the polynomial is a perfect square trinomial of the form a^2-2ab+b^2:

option a. true

step-by-step explanation:

9x^2-12x+4

comparing with the form a^2-2ab+b^2

1.) a^2=9x^2

solving for a: square root both sides of the equation:

sqrt(a^2)=sqrt(9x^2)

a=sqrt(9) sqrt(x^2)

a=3x

2.) b^2=4

solving for b: square root both sides of the equation:

sqrt(b^2)=sqrt(4)

b=2

to be a perfet square trinomial 2ab must be equal to 12x. let's check:

2ab = 2 (3x) (2)

2ab = 12x

correct

the distance between the school and her home is 3.6km.

12 mins = 0.2 hours = 1/5 hour

54 ÷ 3 = 18km per hour

1/5 of 18 = 3.6km per 12 mins