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
Consider the numbers from 
to 
. A game is made by placing all the numbers in pairs and replacing each pair with the largest prime divisor of the sum of the numbers of that couple. For example, if we match the numbers as: 
, we get the following list of 
numbers: 
. where there are repetitions. The game continues in a similar way until in the end only one number remains. Determine the highest possible value from the number that remains at the end.
to 
. A game is made by placing all the numbers in pairs and replacing each pair with the largest prime divisor of the sum of the numbers of that couple. For example, if we match the numbers as: 
, we get the following list of 
numbers: 
. where there are repetitions. The game continues in a similar way until in the end only one number remains. Determine the highest possible value from the number that remains at the end.
can be achieved given a game of 
is impossible as a final answer because it is 
.
