be the Fermat point of a 
.
,
,
are concurrent and the point of concurrence is 
,
(
well). i want to study so if you guys have some easy or normal problems please send me
?
chess board, except for the 
central square, there is a checker. In one move, a checker can jump over adjacent checker (diagonally), and this adjacent checker (that was jumped over) is removed. Is it possible to come up with a sequence of moves, so that only one checker is left on the board?
Y by
Each of the squares on a 
× board has a zero. At every step you choose a row or a column, we delete all the numbers from it and then we write the numbers from 
to in the empty cells, in an arbitrary order. find the sum
possible maximum of the numbers on the board that can be achieved after a number finite number of steps.
× board has a zero. At every step you choose a row or a column, we delete all the numbers from it and then we write the numbers from 
to in the empty cells, in an arbitrary order. find the sumpossible maximum of the numbers on the board that can be achieved after a number finite number of steps.
This post has been edited 2 times. Last edited by hectorleo123, Aug 21, 2023, 10:31 PM
