AoPS Academy
[/quote]
, do not answer with "
is a solution" only. Either you post any kind of proof or at least something unexpected (like "
is the smallest solution). Someone that does not see that is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
such that![\[
4k^3 + 4k + 1
\]](http://latex.artofproblemsolving.com/f/3/5/f355e456cd47ecfdb13597d52fec3d848b67c594.png)
. Two subsets 
and 
of 
are said to be friends if the following conditions are true: equals the product of all elements from . that are friends such that each one of them contains at least 
elements.[/quote]
be a circle on the plane. Let 
and 
be circles which are internally tangent to at points and respectively. Let the centers of and be 
and 
respectively and let the intersection points of and be 
and 
. Assume that lies on the line 
. Let the common external tangent of and that is closer to point be tangent to the circles and at 
and 
respectively. Let the second intersection point of the line 
and be 
and let the second intersection point of the circumcircle of 
and be . Let the circumcenter of 
be 
and let the intersection points of 
and 
be 
. Prove that
be a scalene triangle with incenter 
and incircle . Let the tangency points of to 
be 
respectively. Let the line 
intersect the circumcircle of at the points 
. Assume that 
lies between the points 
and 
. Let 
be a circle that passes through and 
and that is tangent to at the point 
which lies on different semi-planes with 
with respect to the line . Let intersect 
at points and and let the second intersection point of the circumcircle of and the circumcircle of be 
. Prove that the intersection point of 
and 
lies on the circumcircle of if and only if the intersection point of 
and 
lies on .
+1 w
people at a party. Prove that there are two people such that, of the remaining 
people, there are at least 
of them, each of whom either knows both or else knows neither of the two. Assume that knowing is a symmetric relation, and that 
denotes the greatest integer less than or equal to 
.
be a polygon formed by the edges of an infinite chessboard, which does not intersect itself. Let the numbers 
represent the number of unit squares that have exactly 
edges on the boundary of respectively. Find the largest real number 
such that the inequality 
holds for each polygon constructed with these conditions.
such that, for all 
,
, the function 
is defined as, 
and for all 
, if the prime factorization of is 
then 
. We have an arithmetic sequence 
. If for a positive integer 
, the sequence 
is also an arithmetic sequence, show that the sequence has to be constant.
, 
are coprime positive integers. Find all 
such that:
such that![\[f(f(f(\frac{x+y}{2}))+x+y)=f(x)+f(y)+f(\frac{x+y}{2})\]](http://latex.artofproblemsolving.com/6/2/4/624afa78b68f810aaaecf0e1e2251047beeddc36.png)
for all rational numbers 
.
vertices, each edge has one of the colors 
, 
, or 
. For each 
, if the vertices can be divided into 
groups such that any two vertices connected by an edge of color 
are in different groups, find the minimum possible value of 
.
be given pairwise coprime positive integers where 
. Let 
be positive integers. We call 
to be a grandson of if and only if, for all possible piles of stones whose total mass adds up to and consist of stones with masses , it's possible to take some of the stones out from this pile in a way that in the end, we can obtain a new pile of stones with total mass of . Find the greatest possible number that doesn't have any grandsons.
, for which 
for all functions 
, who satisfy the equation 
for all non-negative real numbers and 
.
, then jumps in some order on each of the numbers 
exactly once and finally returns with his last jump to . Can the total distance he travelled with these 
jumps be a) 
, b) 
?
in term of a function 
such that 
