In a tic-tac-toe game, each of the nine squares can either be blank, or have an x or an o, so in playing tic-tac-toe there are 39 states. if x wins after 9 turns, there will be 9 ways to place the first x, 8 ways to place the next o and so on, giving 9 · 8 · · · · 1 = 9! different 9 move tic-tac-toe games in which x wins. which of these computations is done correctly with the multiplicative principle? how is independence satisfied or violated?

answer: 1+1

step-by-step explanation: 1+1 is at least 2

answer: integers are just whole numbers: positive, negative, and zero.

i = {-∞, -2, -1, 0, 1, 2, 3, ∞}

let x = 1st integer

let y = 2nd integer

x = 3y + 17   {equation 1}

xy = -24         {equation 2}

substitute 3y+17 in place of x n equation 2

and solve for y.

(3y+17)y = -24

3y2 + 17y = -24

3y2 + 17y + 24 = 0

from quadratic equation:

y = [-17±√(172-4(3)(24))]/(2(3))

y = (-17 ±√1)/6

y = (-17+1)/6   or     y = (-17-1)/6

y = -16/6           or     y = -18/6

y = -2 2/3         or   y = -3

since we are dealing with

y = -3

x = 3y+17 = -9+17 = 8

the integers are -3, 8

step-by-step explanation:

6950 is the