High School Olympiads
Regional, national, and international math olympiads
Regional, national, and international math olympiads
3
M
G
BBookmark
VNew Topic
kLocked
High School Olympiads
Regional, national, and international math olympiads
Regional, national, and international math olympiads
3
M
G
BBookmark
VNew Topic
kLocked
No tags match your search
MDiophantine equation
algebra
combinatorics
geometry
inequalities
number theory
IMO
articles
inequalities proposed
function
algebra unsolved
circumcircle
trigonometry
number theory unsolved
inequalities unsolved
polynomial
geometry unsolved
geometry proposed
combinatorics unsolved
number theory proposed
functional equation
algebra proposed
modular arithmetic
induction
geometric transformation
incenter
calculus
3D geometry
combinatorics proposed
quadratics
Inequality
reflection
ratio
logarithms
prime numbers
analytic geometry
floor function
angle bisector
search
parallelogram
integration
Diophantine equation
rectangle
LaTeX
limit
complex numbers
probability
graph theory
conics
Euler
cyclic quadrilateral
No tags match your search
MG
Topic
First Poster
Last Poster
we can find one pair of a boy and a girl
orl 16
N
an hour ago
by ezpotd
Source: Vietnam TST 2001 for the 42th IMO, problem 3
Some club has 42 members. It’s known that among 31 arbitrary club members, we can find one pair of a boy and a girl that they know each other. Show that from club members we can choose 12 pairs of knowing each other boys and girls.
16 replies
teleporting wizard starts on point (2017, 101), 4 moves
parmenides51 1
N
an hour ago
by jasperE3
Source: 2018 USAIMEO #2 p5 (Mock AIME -USAJMO) https://artofproblemsolving.com/community/c594864h1572209p9658908
A teleporting wizard starts on the point
and can teleport to other Cartesian coordinates with only
of
moves:
,
when
,
, and
when
.
(a) Let
be any polynomial with positive integer coefficients that passes through
. Show that for all such
, there exists a unique point on the curve where the wizard can land on.
(b) For each
, let
be this unique point. Find the equation of the graph that contains all potential
.









(a) Let



(b) For each



1 reply
IMO ShortList 2001, combinatorics problem 1
orl 33
N
an hour ago
by ihategeo_1969
Source: IMO ShortList 2001, combinatorics problem 1
Let
be a sequence of positive integers. Let
be the number of 3-element subsequences
with
, such that
and
. Considering all such sequences
, find the greatest value of
.








33 replies
CooL geo
Pomegranat 0
2 hours ago
Source: Idk
In triangle














0 replies
Coefficient Problem
P162008 2
N
2 hours ago
by cazanova19921
Consider the polynomial 
Find the coefficient of
in the expansion of

Find the coefficient of


2 replies
Shooting An Invisible Tank
Aryan27 0
2 hours ago
Source: 239 MO
An invisible tank is on a
table. A cannon can fire at any
cells of the board after that the tank will move to one of the adjacent cells (by side). Then the process is repeated. Find the smallest value of
such that the cannon can definitely shoot the tank after some time.



0 replies

Showing Tangency
Itoz 1
N
3 hours ago
by ja.
Source: Own
The circumcenter of
is
. Line
meets line
at point
, and there is a point
on
such that
. Line
intersects
at point
. The perpendicular bisector of line segment
intersects line
at point
, and line
intersects
at point
.
Prove that
is tangent to
.

















Prove that


1 reply

1988 USAMO Problem 4
ahaanomegas 31
N
3 hours ago
by LeYohan
Let
be the incenter of triangle
, and let
,
, and
be the circumcenters of triangles
,
, and
, respectively. Prove that the circumcircles of triangles
and
are concentric.










31 replies
How many numbers
brokendiamond 0
4 hours ago
How many 5-digit numbers can be formed using the digits 1, 3, 5, 7, 9 such that the smaller digits are not positioned between two larger digits?
0 replies

