No tags match your search
M3D geometry
geometry
algebra
number theory
trigonometry
inequalities
function
polynomial
probability
combinatorics
calculus
analytic geometry
3D geometry
quadratics
AMC
ratio
AIME
modular arithmetic
logarithms
LaTeX
complex numbers
rectangle
conics
circumcircle
geometric transformation
induction
integration
floor function
system of equations
counting
perimeter
rotation
trig identities
vector
trapezoid
search
graphing lines
angle bisector
prime numbers
slope
parallelogram
AMC 10
relatively prime
symmetry
parabola
Diophantine equation
Vieta
angles
factorial
Inequality
domain
No tags match your search
MG
Topic
First Poster
Last Poster
hard problem
Cobedangiu 1
N
17 minutes ago
by lbh_qys
Let a,b,c>0, a^3+b^3+c^3=3. Find min D(and prove)
D= 5(a^2+b^2+c^2)+4(1/a+1/b+1/c)
D= 5(a^2+b^2+c^2)+4(1/a+1/b+1/c)
1 reply

Inspired by old results
sqing 1
N
26 minutes ago
by sqing
Source: Own
Let
and
Prove that



1 reply
1 viewing
Numbers Theory
Amin12 9
N
39 minutes ago
by Ihatecombin
Source: Iran 3rd round 2017 Numbers theory final exam-P3
Let
be a positive integer. Prove that there exists a poisitve integer
such that



9 replies
cyclic ineq not tight
RainbowNeos 1
N
an hour ago
by lbh_qys
Source: own
Given
and
with sum
. Show that
where
.



![\[\sum_{i=1}^n \min\{{x_i^2, x_{i+1}}\}\leq \frac{1}{2}.\]](http://latex.artofproblemsolving.com/7/f/0/7f01a8d065c8e03233fe2254946522a5762f80e2.png)

1 reply

Something nice
KhuongTrang 22
N
an hour ago
by KhuongTrang
Source: own
Problem. Given
be non-negative real numbers such that
Prove that



22 replies

Send me your problem.
B1t 0
an hour ago
Does anyone have a non-famous hard problem (Category C or N is great) with a Mohs rating of 35M( harder than average imo p2) or higher? If you do, please send me the problem via private message along with the solution. I will propose it for the Olympiad. Please do not post it here.
0 replies
integral points
jhz 3
N
an hour ago
by flower417477
Source: 2025 CTST P17
Prove: there exist integer
satisfying the following conditions:
for all 
Define the set
then
,and any rectangular strip of width 1 covers at most two points of S.





![\[S = \left\{ \left( \sum_{i=1}^{10} a_i x_i, \sum_{i=1}^{10} a_i y_i \right) : a_1, a_2, \cdots, a_{10} \in \{0, 1\} \right\},\]](http://latex.artofproblemsolving.com/d/e/b/deb50830b9fe10c86ea169c044c1b26f515b2514.png)

3 replies
