Estimate on number of progressions
by Assassino9931, May 2, 2025, 11:09 PM
Let
be a positive integer. For a set
of
real numbers, let
denote the number of increasing arithmetic progressions of length at least two all of whose terms are in
. Prove that, if
is a set of
real numbers, then
![\[ f(S) \leq \frac{n^2}{4} + f(\{1,2,\ldots,n\})\]](//latex.artofproblemsolving.com/c/8/8/c887443e08b9f61e5ce55c3e35fcf2912a6da2a5.png)







![\[ f(S) \leq \frac{n^2}{4} + f(\{1,2,\ldots,n\})\]](http://latex.artofproblemsolving.com/c/8/8/c887443e08b9f61e5ce55c3e35fcf2912a6da2a5.png)
Popular children at camp with algebra and geometry
by Assassino9931, May 2, 2025, 11:07 PM
Fix an odd integer
. At a maths camp, there are
children, each of whom selects
either algebra or geometry as their favourite topic. At lunch, they sit at
tables, with
children
on each table, and start talking about mathematics. A child is said to be popular if their favourite
topic has a majority at their table. For dinner, the students again sit at
tables, with
children
on each table, such that no two children share a table at both lunch and dinner. Determine the
minimal number of young mathematicians who are popular at both mealtimes. (The minimum is across all sets of topic preferences and seating arrangements.)


either algebra or geometry as their favourite topic. At lunch, they sit at


on each table, and start talking about mathematics. A child is said to be popular if their favourite
topic has a majority at their table. For dinner, the students again sit at


on each table, such that no two children share a table at both lunch and dinner. Determine the
minimal number of young mathematicians who are popular at both mealtimes. (The minimum is across all sets of topic preferences and seating arrangements.)
Triangles in dissections
by Assassino9931, May 2, 2025, 11:05 PM
Fix an integer
and let
be a convex polygon in the plane. Let
be the set of all midpoints
of segments
where
. Assume that all of these midpoints are distinct, i.e.
consists of
elements. Dissect the polygon
into triangles so that the following hold:
(1) The intersection of every two triangles (interior and boundary) is either empty or a common
vertex or a common side.
(2) The vertices of all triangles lie in M (not all points in M are necessarily used).
(3) Each side of every triangle is of the form
for some pairwise distinct indices
.
Prove that the total number of triangles in such a dissection is
.









(1) The intersection of every two triangles (interior and boundary) is either empty or a common
vertex or a common side.
(2) The vertices of all triangles lie in M (not all points in M are necessarily used).
(3) Each side of every triangle is of the form


Prove that the total number of triangles in such a dissection is

Tangency geo
by Assassino9931, May 2, 2025, 10:57 PM
Let
be an acute triangle with
and
. Let
be the midpoint of the side
. The circumcircle of triangle
intersects the side
again at
and the circumcircle of triangle
intersects the side
again at
. The point
lies on the perpendicular bisector of the segment
so that the points
and
lie on the same side of
and
. Prove that the circumcircles of triangles
and
are tangent.



















Inequalities in real math research
by Assassino9931, May 2, 2025, 10:53 PM
For a positive integer
denote
. For any real numbers
prove that
![\[ \prod_{i=1}^k F_i(x_{k-i+1},x_{k-i+2},\ldots,x_k) \geq \prod_{i=1}^k F_i(x_i,x_i,\ldots,x_i)\]](//latex.artofproblemsolving.com/a/4/d/a4d515f1102b31cff69d6823df7a58482aec1171.png)



![\[ \prod_{i=1}^k F_i(x_{k-i+1},x_{k-i+2},\ldots,x_k) \geq \prod_{i=1}^k F_i(x_i,x_i,\ldots,x_i)\]](http://latex.artofproblemsolving.com/a/4/d/a4d515f1102b31cff69d6823df7a58482aec1171.png)
A folklore polynomial game
by Assassino9931, May 2, 2025, 10:50 PM
Fix a positive integer
. Yael and Ziad play a game as follows, involving a monic polynomial of degree
. With Yael going first, they take turns to choose a strictly positive real number as the value of one of the coecients of the polynomial. Once a coefficient is assigned a value, it cannot be chosen again later in the game. So the game
lasts for
rounds, until Ziad assigns the final coefficient. Yael wins if
for some real
number
. Otherwise, Ziad wins. Decide who has the winning strategy.


lasts for


number

find the radius of circumcircle!
by jennifreind, May 2, 2025, 2:12 PM
In
,
is acute,
, and
. Let point
be the intersection of the tangent to the circumcircle of
at point
and the perpendicular bisector of segment
. Given that
, find the radius of the circumcircle of
.












This post has been edited 1 time. Last edited by jennifreind, Yesterday at 2:13 PM
IMO Shortlist Problems
by ABCD1728, May 2, 2025, 12:44 PM
Where can I get the official solution for ISL before 2005? The official website only has solutions after 2006. Thanks 

2^x+3^x = yx^2
by truongphatt2668, Apr 22, 2025, 3:38 PM
Prove that the following equation has infinite integer solutions:


Archives



Shouts
Submit
64 shouts
Contributors
Tags
About Owner
- Posts: 0
- Joined: Nov 2, 2024
Blog Stats
- Blog created: Mar 1, 2025
- Total entries: 109
- Total visits: 1201
- Total comments: 35
Search Blog