Let gcd(a, b, c) denote the greatest common divisor of the three non-zero integers a, b and c Use Corollary 17.2.1 to prove that gcd(a, b,c)-gcd(gcd(a. b).c).
Hence find the greatest common divisor of 11033442, 1102246 and 6035.

a and c

step-by-step explanation:

an

y = 6x -3y -12

y +3y +12 = 6x

=> . x = { 2y / 3 +2 } this is equation of line in terms of x

=> . if line meets the x-axis the co-ordinates of meeting point would be ( x , 0 )

=> . x = 2 ( 0 ) / 3 + 2

=> . x = 2

so, the point is ( 2 , 0 )

let f (x ) is a function and c be a positive real number,   the graph of the function g (x ) = f (cx ) is represented as follows.

when, c > 1,   the function compresses it in the x - direction.

when, 0 < c < 1, the function stretches it.

the function is g ( x ) = (9x )2.

the heighest power of x in g ( x ) = (9x )2 is 2, so the parent function is square function.

the equation of parent function is f ( x ) = x 2 .

the function is g ( x ) = (9x )2 and the parent function is f ( x ) = x 2 .

so, the functions f and g have the following relationship.

g ( x ) = f ( 9x ).

compare the function g ( x ) = f ( 9x ) with g (x ) = f (cx ).

c = 9 ( > 1 ).

so, the function g (x ) = (9x )2 compresses it in the x - direction.

step-by-step explanation: