[/quote]
,
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?
be a quadrilateral such that the excircles 
and 
of triangles 
and 
touching their sides 
and 
respectively touch the extension of 
at the same point 
meets 
,
.
and 
is right
with 
and 
.
?
that it is possible to form a triangle from segments of length 
.
times and obtain the numbers 
so that segments with lengths 
and 
Prove that
which satisfy 
![$ \frac{a+b+c}{3} \ge \sqrt[10]{\frac{a^3+b^3+c^3}{3}}$](http://latex.artofproblemsolving.com/c/d/a/cdae05ad34239366b0dd3921243522c711b6ae58.png)
method, I can assum 
![$ \frac{2x+\frac{1}{x^2}}{3} \ge \sqrt[10]{ \frac{2x^3+ \frac{1}{x^6}}{3}} $](http://latex.artofproblemsolving.com/c/d/4/cd481672bee1e87d8c97ac623436e0ec75cfa73a.png)
For a positive integer 
,
be the set of bijective functions from 
to itself. For a pair of positive integers 
such that 
,
,
if 
,
?
and a permutation 
?
be the set of non-negative integers and 
be the set of positive real numbers. Let 
be a function such that 
and 
for all integers 
,
for all integers 
.
.
is an integer. Prove that 
are integers.
Y by Mango247, Mango247, Mango247
Let 
be an odd prime number. Around a circular table, students sit. We give pieces of candy to those students in the following manner. The first candy we give to an arbitrary student. Then, going around clockwise, we skip two students and give the next student a piece of candy, then we skip 4 students and give another piece of candy to the next student... In general in the 
th turn we skip 
students and give the next student a piece of candy. We do this until we don't give out all pieces of candy.
How many students won't get any pieces of candy?
How many pairs of neighboring students (those students who sit next to each other on the table) both got at least a piece of candy?
be an odd prime number. Around a circular table, students sit. We give pieces of candy to those students in the following manner. The first candy we give to an arbitrary student. Then, going around clockwise, we skip two students and give the next student a piece of candy, then we skip 4 students and give another piece of candy to the next student... In general in the 
th turn we skip 
students and give the next student a piece of candy. We do this until we don't give out all pieces of candy.
How many students won't get any pieces of candy?
How many pairs of neighboring students (those students who sit next to each other on the table) both got at least a piece of candy?This post has been edited 1 time. Last edited by Steve12345, May 22, 2022, 7:12 AM
