As far as I know, it seems that no one on HSM has organized an equation marathon before. Click to reveal hidden text
If there is one, please let me know :D
So why not give it a try? Click to reveal hidden text
Even though equation problems might generally be seen as less challenging. :roll:
Let's start one! Some basic rules need to be clarified: If a problem has not been solved within days, then others are eligible to post a new probkem. Not only simple one-variable equations, but also systems of equations are allowed. The difficulty of these equations should be no less than that of typical quadratic one-variable equations. If the problem involves higher degrees or more variables, please ensure that the problem is solvable (i.e., has a definite solution, rather than an approximate one). Please indicate the domain of the solution to the equation (e.g., solve in , solve in ).
Here's an simple yet fun problem, hope you enjoy it :P : P1
There are 16 kangaroos on a giant 4×4 chessboard, with exactly one kangaroo on each square. In each round, every kangaroo jumps to a neighboring square (up, down, left, or right — but not diagonally). All kangaroos stay on the board. More than one kangaroo can occupy the same square. What is the maximum number of empty squares that can exist after 100 rounds?
Three people arrive at the same place independently, at a random between and If each person remains there for minutes, what's the probability that all three people meet each other?
I'm already familiar with the variant where there are only two people, where you Click to reveal hidden text
try to plot and solve for the area of a hexagon in that square.
It was an AIME problem from the 90s I believe. However, I don't know how one could visualize this in a Click to reveal hidden text
Given that the sequence is an arithmetic sequence, ,. Let the general term of the sequence be , and let be the sum of the terms of the sequence . Compare the size of with .
Consider this parabola: y = x^2 + (2m + 1)x + m(m - 3) where m is constant and -1 ≤ m ≤ 4. A(-m-1, y1), B(m/2, y2), C(-m, y3) are three different points on the parabola. Now rotate the axis of symmetry of the parabola 90 degrees counterclockwise around the origin O to obtain line a. Draw a line from the vertex P of the parabola perpendicular to line a, meeting at point H.
1) express the vertex of the quadratic equation using an expression with m.
2) If, regardless of the value of m, the parabola and the line y=x−km (where k is a constant) have exactly one point of intersection, find the value of k.
3) (where I'm struggling the most) When 1 < PH ≤ 6, compare the values of y1, y2, and y3.
pairwise distinct complex numbers are written on a board. It turns out that there are exactly 760 ways to choose two numbers and from the board such that: Ways that differ by the order of selection are considered the same. Prove that there exist two numbers and from the board such that:
pairwise distinct complex numbers are written on a board. It turns out that there are exactly 760 ways to choose two numbers and from the board such that: Ways that differ by the order of selection are considered the same. Prove that there exist two numbers and from the board such that:
Consider the graph of nodes, one for each complex number and draw edges if the condition is held.
is form by exactly disconnected and simple path. Condition is equivalent to meaning that can only be connected to and , this ensure that is a union of disconnected and simple path.
Suppose that we have of these path, each of length . The we have that and , then .
Now, by PHP one of these chains has at least nodes. So we have a complex number and and its easy to check that .
This post has been edited 4 times. Last edited by hectorraul, Apr 20, 2025, 6:25 PM