If integers are selected randomly from 1 to 35, what is the minimum number of integers that need to be selected such that among the chosen numbers we can always find two integers whose difference is divisible by 7?

step-by-step explanation:

4  

25

5258y

54.

t5

5r

54

5856

542

5458

86

.8558.65

565

565

55898

786

8/95

5896

8656265

556478

what are you trying find out?

step-by-step explanation:

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: