games

Each time, a person takes 1, 2, 3, or 4 chips. The strategy for a player to win the game is taking the number of chips so that the number of chips left is the form of 5k + 1 .

If It is my turn, and there are 2014 chips in the pile, I shoud take 3 chips and the left is 2011 (=5.k +1). And if the opponent takes x chips (x = 1, 2, 3, 4) , i win take 5 - x chips to guarantee the left is always in the form 5k + 1. And finally, the opponent will take the last chip.

Each time, a person takes 1, 2, 3, or 4 chips. The strategy for a player to win the game is taking the number of chips so that the number of chips left is the form of 5k + 1 .

If It is my turn, and there are 2014 chips in the pile, I shoud take 3 chips and the left is 2011 (=5.k +1). And if the opponent takes x chips (x = 1, 2, 3, 4) , i win take 5 - x chips to guarantee the left is always in the form 5k + 1. And finally, the opponent will take the last chip.

Carter

Each time, a person takes 1, 2, 3, or 4 chips. The strategy for a player to win the game is taking the number of chips so that the number of chips left is the form of 5k + 1 .

If It is my turn, and there are 2014 chips in the pile, I shoud take 3 chips and the left is 2011 (=5.k +1). And if the opponent takes x chips (x = 1, 2, 3, 4) , i win take 5 - x chips to guarantee the left is always in the form 5k + 1. And finally, the opponent will take the last chip.

 Let \(S\) be the sum of all the \(mn\) numbers in the table. Note that after an operation, each number stay the same or turns to its negative. Hence there are at most \(2^{mn}\) tables. So \(S\) can only have finitely many possible values. To make the sum of the numbers in each line nonnegative, just look for a line whose numbers have a negative sum. If no such line exists, then we are done. Otherwise, reverse the sign of all the numbers in the line. Then \(S\) increases. Since \(S\) has finitely many possible values, \(S\) can increase finitely many times. So eventually the sum of the numbers in every line must be nonnegative. 

Let SS be the sum of all the mnmn numbers in the table. Note that after an operation, each number stay the same or turns to its negative. Hence there are at most 2mn2mn tables. So SS can only have finitely many possible values. To make the sum of the numbers in each line nonnegative, just look for a line whose numbers have a negative sum. If no such line exists, then we are done. Otherwise, reverse the sign of all the numbers in the line. Then SS increases. Since SS has finitely many possible values, SS can increase finitely many times. So eventually the sum of the numbers in every line must be nonnegative

Let SS be the sum of all the mnmn numbers in the table. Note that after an operation, each number stay the same or turns to its negative. Hence there are at most 2mn2mn tables. So SS can only have finitely many possible values. To make the sum of the numbers in each line nonnegative, just look for a line whose numbers have a negative sum. If no such line exists, then we are done. Otherwise, reverse the sign of all the numbers in the line. Then SS increases. Since SS has finitely many possible values, SS can increase finitely many times. So eventually the sum of the numbers in every line must be nonnegative. 

 In the beginning, randomly divide the members into two groups. Let S be the sum of the number of the pairs of enemies in each group. If a member has at least two enemies in the same group, then the member has at most one enemy in the other group. Transferring the member to the other group, we will decrease S by at least one. Since S is a nonnegative integer, it cannot be decreased forever. So after finitely many transfers, each member can have at most one enemy in the same group. 

In the beginning, randomly divide the members into two groups. Let S be the sum of the number of the pairs of enemies in each group. If a member has at least two enemies in the same group, then the member has at most one enemy in the other group. Transferring the member to the other group, we will decrease S by at least one. Since S is a nonnegative integer, it cannot be decreased forever. So after finitely many transfers, each member can have at most one enemy in the same group.

n the beginning, randomly divide the members into two groups. Let S be the sum of the number of the pairs of enemies in each group. If a member has at least two enemies in the same group, then the member has at most one enemy in the other group. Transferring the member to the other group, we will decrease S by at least one. Since S is a nonnegative integer, it cannot be decreased forever. So after finitely many transfers, each member can have at most one enemy in the same group. 

 No. Let the number of stones
in the three piles be \(a, b\) and \(c\),
respectively. Consider (mod \(3\)) of these
numbers. In the beginning, they are \(1, 2, 0\). After one operation, they become \(0, 1, 2\) no matter which two piles have stones
transfer to the third pile. So the
remainders are always \(0, 1, 2\) in some
order. Therefore, all piles having \(12 \) stones are impossible. 

i don't know.and you?

If we let x=1x=1 and o=–1o=–1, then note that consecutive symbols are replaced by their product. If we consider the product PP of the nine values before and after each operation, we will see that the new PP is the square of the old PP. Hence, PP will always equal 11 after an operation. So nine oo's yielding P=–1P=–1 can never happen. 

If we let x=1x=1 and o=–1o=–1, then note that consecutive symbols are replaced by their product. If we consider the product PP of the nine values before and after each operation, we will see that the new PP is the square of the old PP. Hence, PP will always equal 11 after an operation. So nine oo's yielding P=–1P=–1 can never happen.  

 If we let \(x = 1\) and \(o = – 1\), then note that consecutive symbols are replaced by their product. If we consider the product \(P \) of the nine values before and after each operation, we will see that the new \(P\) is the square of the old \(P\). Hence, \(P \) will always equal \(1 \) after an operation. So nine \(o\)'s yielding \(P = – 1\) can never happen.  

The answer id NO.

At the begining there are 32 black pieces. We will prove that the number of black pieces left on the board is always even.

In the single move, we change a row or column, assume that row or column has k black pieces and 8 - k while pieces, after change all black to white and while to black, that row or column will has 8-k black and k white. The difference between black pieces after a single move is (8 - k) - k = 8 - 2k. The difference is a even (8 - 2k). Therefore, after every move, the black pieces left is alaways even and cannot be one black piece at any time.

The answer id NO.

At the begining there are 32 black pieces. We will prove that the number of black pieces left on the board is always even.

In the single move, we change a row or column, assume that row or column has k black pieces and 8 - k while pieces, after change all black to white and while to black, that row or column will has 8-k black and k white. The difference between black pieces after a single move is (8 - k) - k = 8 - 2k. The difference is a even (8 - 2k). Therefore, after every move, the black pieces left is alaways even and cannot be one black piece at any time.

My answer is no.

At the begining there are 32 black pieces. We will prove that the number of black pieces left on the board is always even.

In the single move, we change a row or column, assume that row or column has k black pieces and 8 - k while pieces, after change all black to white and while to black, that row or column will has 8-k black and k white. The difference between black pieces after a single move is (8 - k) - k = 8 - 2k. The difference is a even (8 - 2k). Therefore, after every move, the black pieces left is alaways even and cannot be one black piece at any time.

At the begining, there are 1974/2=987 odd numbers. When we replace two numbers a and b by a number either a + b or a - b, we see that:

+ if a odd and b even, or a even and b odd then a + b or a - b is still odd

+ if a and b are both even then a + b or a -b is still even

+ If a and  are both odd then a + b or a - b is even

So the number of odd after each such replacement operation is stay the same or deacresed by two. At the begining, there is 987 odd numbers  (987 is odd) and the odd number left must be odd too. So at the final, only one number left, it must be odd number, it is not 0. (because 0 is even). [haha]

At the begining, there are 1974/2=987 odd numbers. When we replace two numbers a and b by a number either a + b or a - b, we see that:

+ if a odd and b even, or a even and b odd then a + b or a - b is still odd

+ if a and b are both even then a + b or a -b is still even

+ If a and  are both odd then a + b or a - b is even

So the number of odd after each such replacement operation is stay the same or deacresed by two. At the begining, there is 987 odd numbers  (987 is odd) and the odd number left must be odd too. So at the final, only one number left, it must be odd number, it is not 0. (because 0 is even).

At the begining, there are 1974/2=987 odd numbers. When we replace two numbers a and b by a number either a + b or a - b, we see that:

+ if a odd and b even, or a even and b odd then a + b or a - b is still odd

+ if a and b are both even then a + b or a -b is still even

+ If a and  are both odd then a + b or a - b is even

So the number of odd after each such replacement operation is stay the same or deacresed by two. At the begining, there is 987 odd numbers  (987 is odd) and the odd number left must be odd too. So at the final, only one number left, it must be odd number, it is not 0. (because 0 is even).

In the beginning randomly pair the points and join the segments. Let \(S \) be the sum of the lengths of the segments. (Note that since there are finitely many ways of connecting \(2n \) points by \(n \) segments, there are finitely many possible values of \(S\).) If two segments \(AB\)and \(CD\)intersect at \(O\), then replace pairs \(AB\)and \(CD\)by \(AC\)and \(BD\). Since

\(AB + CD = AO + OB + CO + OD > AC + BD\)

by the triangle inequality, whenever there is an intersection, doing this replacement will always decrease \(S\). Since there are only finitely many possible values of \(S\), so eventually there will not be any intersection.

In the beginning randomly pair the points and join the segments. Let S be the sum of the lengths of the segments. (Note that since there are finitely many ways of connecting 2n points by n segments, there are finitely many possible values of S.) If two segments ABand CDintersect at O, then replace pairs ABand CDby ACand BD

. Since

AB+CD=AO+OB+CO+OD>AC+BD

by the triangle inequality, whenever there is an intersection, doing this replacement will always decrease S

. Since there are only finitely many possible values of S, so eventually there will not be any intersection.

In the beginning randomly pair the points and join the segments. Let SS be the sum of the lengths of the segments. (Note that since there are finitely many ways of connecting 2n2n points by nn segments, there are finitely many possible values of SS.) If two segments ABABand CDCDintersect at OO, then replace pairs ABABand CDCDby ACACand BDBD. Since

AB+CD=AO+OB+CO+OD>AC+BDAB+CD=AO+OB+CO+OD>AC+BD

by the triangle inequality, whenever there is an intersection, doing this replacement will always decrease SS. Since there are only finitely many possible values of SS, so eventually there will not be any intersection.