Solve All 6 IMO 2024 Problems (42/42), New Framework Looking for Feedback
Blackhole.LightKing3
N18 minutes ago
by DottedCaculator
Hi everyone,
I’ve been experimenting with a different way of approaching mathematical problem solving — a framework that emphasizes recursive structures and symbolic alignment rather than conventional step-by-step strategies.
Using this method, I recently attempted all six problems from IMO 2024 and was able to arrive at what I believe are valid full-mark solutions across the board (42/42 total score, by standard grading).
However, I don’t come from a formal competition background, so I’m sure there are gaps in clarity, communication, or even logic that I’m not fully aware of.
If anyone here is willing to take a look and provide feedback, I’d appreciate it — especially regarding:
The correctness and completeness of the proofs
Suggestions on how to make the ideas clearer or more elegant
Whether this approach has any broader potential or known parallels
I'm here to learn more and improve the presentation and thinking behind the work.
Two circles and intersect at points and . A line through intersects and at points and , respectively. Line intersects at point , and line intersects at point . If is the circumcenter of , prove that .
Let be a triangle with incenter , and let be a point on side . Points and are chosen on lines and respectively such that is a parallelogram. Points and are chosen on side such that and are the angle bisectors of angles and respectively. Let be the circle tangent to segment , the extension of past , and the extension of past . Prove that is tangent to the circumcircle of triangle .
Let be pairwise coprime positive integers with being prime and . On the segment of the real line, mark all integers that are divisible by at least one of the numbers . These points split into a number of smaller segments. Prove that the sum of the squares of the lengths of these segments is divisible by .
An ant is on the Cartesian plane. In a single move, the ant selects a positive integer , then either travels [list]
[*] units vertically (up or down) and units horizontally (left or right); or
[*] units horizontally (left or right) and units vertically (up or down).
[/list]
Thus, for any , the ant can choose to go to one of eight possible points.
Prove that, for any integers and , the ant can travel from to using at most moves.
I have noticed thousands upon thousands of inequalities that you have posted to HSO and was wondering where you get the inspiration, imagination, and even the validation that such inequalities are true? Also, what do you find particularly appealing and important about specifically inequalities rather than other branches of mathematics?