25x2 + 40x + 16 = 25x2 + 20x + 20x + 16 = 5x(5x + 4) + 4(5x + 4) = (5x + 4)(5x + 4) or (5x + 4)2
140x / 64y divide 5x/8y = > 40x/64y X 8y/5x Note the change of sign and the inversion of the Right hand fraction. Cancel down by '5x' 8/64y X 8y/1 Cancel down by '8y' 8/8 X 1/1 = 8/8 = 1 The answer!!!!
15x2 + 58x + 48= 15x2 + 18x + 40x + 48= 3x(5x + 6) + 8(5x + 6)= (3x + 8)(5x + 6)
10 + 5x = 505x = 40x = 8
Euclid's algorithm is a popular algorithm to compute the GCD of two numbers. Algorithm: Gcd(a,b) = Gcd(b, a mod b), where a>=b and Gcd(a,0) = a Say we want to find the GCD of 72 and 105. 105 mod 72 = 33, so GCD(72,105) = GCD(33,72) 72 mod 33 = 6, so GCD(33,72) = GCD(6,33) 33 mod 6 = 3 so GCD(6,33) = GCD(3,6) 6 mod 3 = 0 so GCD(3,6) = GCD(0,3) = 3. So the GCD of 72 and 105 is 3.
8(1+5x) +5 = 13+5x => 8+40x + 5 = 13 +5x => 13+40x = 13+5x => 13-13+40x = 13-13+5x => 40x = 5x => 40x - 5x = 0 => 35x = 0 => 35x/35 = 0/35 => x = 0
The factorization of 25x2 + 40x + 16 is (5x+4)(5x+4).
25x2 + 40x + 16 = 25x2 + 20x + 20x + 16 = 5x(5x + 4) + 4(5x + 4) = (5x + 4)(5x + 4) or (5x + 4)2
5x
5x squared
5x
140x / 64y divide 5x/8y = > 40x/64y X 8y/5x Note the change of sign and the inversion of the Right hand fraction. Cancel down by '5x' 8/64y X 8y/1 Cancel down by '8y' 8/8 X 1/1 = 8/8 = 1 The answer!!!!
8(5x) = 40x
15x2 + 58x + 48= 15x2 + 18x + 40x + 48= 3x(5x + 6) + 8(5x + 6)= (3x + 8)(5x + 6)
It is: (x2 + 5x) (x + 8)
5x(6x + 7y + 8)
5x(7xy + 6x + 8)