Datasets:
problem_idx stringlengths 23 26 | problem stringclasses 27
values | max_points int64 7 7 | awarded_points int64 0 6 | solution stringlengths 826 17.1k | sample_solution stringclasses 27
values | token_usage dict | justification stringlengths 415 2.37k | grading_scheme listlengths 2 7 |
|---|---|---|---|---|---|---|---|---|
imc_2025_problem_1_id_0 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 5 | **(a)** Let $(a, b) \in \mathbb{R}^2$ be an arbitrary point. The tangent line to the graph of $P$ at the point $(r, P(r))$ is
$$\ell_r = \{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\}.$$
The point $(a, b)$ lies on $\ell_r$ if and only if
$$b = P'(r)(a - r) + P(r) = aP'(r) + P(r) - rP'(r). \qquad (\ast)$$
Thi... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 17293,
"completion_tokens": 24113,
"total_tokens": 41406
} | - **Uneven degree (0/1):** The student correctly computes that the RHS of $(\ast)$ has odd degree $n$, but then jumps directly to the final conclusion "$\bigcup \ell_x = \mathbb{R}^2$" without ever stating or invoking the fact that a polynomial of odd degree over $\mathbb{R}$ always has a real root. The critical interm... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 2,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_1_id_1 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 3 | **(a)** Suppose $\deg(P) = n$ is odd, so $n \geq 3$. At each point $(r, P(r))$ on the graph, the tangent line $\ell_r$ has equation
$$\ell_r: \quad y = P'(r)(x - r) + P(r).$$
Fix any $a \in \mathbb{R}$. As $r$ varies, the $y$-value that $\ell_r$ attains at $x = a$ is an odd-degree polynomial in $r$ (since $P$ has odd ... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 17500,
"completion_tokens": 37147,
"total_tokens": 54647
} | - **Functional Equation (1/2):** The student correctly writes the tangent line equation $y = P'(r)(x-r) + P(r)$ and refers to "the $y$-value that $\ell_r$ attains at $x = a$," but never explicitly sets up the polynomial equation $b = aP'(r) + P(r) - rP'(r)$ that must be solved for $r$. The reduction from geometry to po... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 1,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_1_id_2 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 1 | **(a)** Let $n = \deg(P)$ be odd with $n \geq 2$, and write $P(x) = c_n x^n + c_{n-1}x^{n-1} + \cdots + c_0$ where $c_n \neq 0$. The tangent line to the graph of $P$ at the point $(r, P(r))$ has equation
$$\ell_r: \quad y = P'(r)(x - r) + P(r) = P'(r) \cdot x + \bigl(P(r) - rP'(r)\bigr).$$
Thus $\ell_r$ has slope $P'... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 10742,
"completion_tokens": 27949,
"total_tokens": 38691
} | - **Functional Equation (0/2):** The student never reduces the problem to solving the polynomial equation $b = aP'(r) + P(r) - rP'(r)$ for $r$. Instead, they separately analyze the $y$-intercept $\varphi(r)$ and the slope $P'(r)$ without writing the condition for an arbitrary point $(a,b)$ to lie on $\ell_r$ as a singl... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 0,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_1_id_3 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 5 | **(a)** Suppose $\deg(P) = n$ is odd with $n \geq 2$. We wish to show that every point $(a, b) \in \mathbb{R}^2$ lies on some tangent line $\ell_r$ to the graph of $P$.
For a given point $(a, b)$, the requirement that it lies on the tangent to the graph at the point $(r, P(r))$ leads to a polynomial equation in $r$. W... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 17308,
"completion_tokens": 24578,
"total_tokens": 41886
} | - **Functional Equation (0/2):** The student never writes down the tangent line equation $\ell_r = \{(x,y) : y = P'(r)(x-r) + P(r)\}$, never substitutes the point $(a,b)$ into it, and never derives the functional equation $b = aP'(r) + P(r) - rP'(r)$. The entire geometric-to-algebraic reduction is absent. The student m... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 0,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_1_id_4 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 3 | **(a)** Suppose $\deg(P) = n$ where $n$ is odd and $n \geq 3$. For each $r \in \mathbb{R}$, the tangent line to the graph of $P$ at $(r, P(r))$ has equation
$$\ell_r: \quad y = P'(r)(x - r) + P(r).$$
We claim that every point $(a, b) \in \mathbb{R}^2$ lies on some tangent line $\ell_r$. Since $\deg(P) = n$ is odd, $P$... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 27050,
"completion_tokens": 43341,
"total_tokens": 70391
} | 1. **Functional Equation (1/2):** The student correctly writes the tangent line equation $y = P'(r)(x - r) + P(r)$ in part (a), earning 1 point for identifying the relevant setup. However, the student never explicitly reduces the problem to the polynomial equation $b = aP'(r) + P(r) - rP'(r)$ in $r$. In part (b), they ... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 1,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_1_id_5 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 1 | **(a)** Suppose $\deg(P) = n$ is odd with $n \geq 3$, and write $P(x) = c_n x^n + c_{n-1}x^{n-1} + \cdots + c_0$ with $c_n \neq 0$. For each $r \in \mathbb{R}$, the tangent line to the graph of $P$ at the point $(r, P(r))$ has equation
$$\ell_r : \quad y = P'(r)(x - r) + P(r).$$
We want to show that every point in $\m... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 10602,
"completion_tokens": 9515,
"total_tokens": 20117
} | 1. **Functional Equation (1/2)**: The student correctly writes the tangent line equation $y = P'(r)(x - r) + P(r)$ and frames the problem as needing every point $(a,b)$ to lie on some tangent line. They even mention the expression $P(r) - rP'(r)$. However, they never explicitly set up the key polynomial equation $b = a... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 1,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_1_id_6 | Let $P \in \mathbb{R}[x]$ be a polynomial with real coefficients, and suppose $\operatorname{deg}(P) \geq 2$. For every $x \in \mathbb{R}$, let $\ell_{x} \subset \mathbb{R}^{2}$ denote the line tangent to the graph of $P$ at the point ( $x, P(x)$ ).
(a) Suppose that the degree of $P$ is odd. Show that $\bigcup_{x \in \... | 7 | 3 | **(a)** Let $(a, b) \in \mathbb{R}^2$ be arbitrary. The tangent line $\ell_r$ at the point $(r, P(r))$ has slope $P'(r)$. For $(a,b)$ to lie on $\ell_r$, we need the slope from $(r, P(r))$ to $(a,b)$ to equal $P'(r)$:
$$\frac{b - P(r)}{a - r} = P'(r). \quad (\star)$$
Write $P(r) = cr^n + \text{lower order terms}$ wit... | (a) Suppose that the degree of $P$ is odd and let $(a, b) \in \mathbb{R}$ be arbitrary. Given $r \in \mathbb{R}$, the equation for $\ell_r$ is given by
\[
\ell_r = \left\{(x, y) \in \mathbb{R}^2 \mid y = P'(r)(x - r) + P(r)\right\}.
\]
For this line to pass through the point $(a, b)$ it is therefore necessary and suffi... | {
"prompt_tokens": 25170,
"completion_tokens": 57148,
"total_tokens": 82318
} | - **Functional Equation (1/2):** The student writes the slope condition $(\star)$ in fraction form, which has a division-by-zero issue at $a = r$, and then asserts "$(\star)$ amounts to a polynomial condition of degree $n$ in $r$" without ever deriving or writing the polynomial equation $b = aP'(r) + P(r) - rP'(r)$. Th... | [
{
"title": "Functional Equation",
"max_points": 2,
"awarded_points": 1,
"desc": "The model reduces the problem to showing that for all points (a, b) in the plane, the functional equation $b = aP'(r) + P(r) - rP'(r)$ needs to have a solution for some $r \\in \\mathbb{R}$."
},
{
"title": "Unev... |
imc_2025_problem_2_id_7 | Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a twice continuously differentiable function, and suppose that $\int_{-1}^{1} f(x) \mathrm{d} x=0$ and $f(1)=f(-1)=1$. Prove that
$$
\int_{-1}^{1}\left(f^{\prime \prime}(x)\right)^{2} \mathrm{~d} x \geq 15
$$
and find all such functions for which equality holds. | 7 | 3 | We wish to show $\int_{-1}^1 (f''(x))^2\,dx \geq 15$ and find the equality case.
**Attempting the lower bound via Cauchy–Schwarz.** For any continuous function $g$ on $[-1,1]$, the Cauchy–Schwarz inequality gives
$$\left(\int_{-1}^{1} f''(x)\, g(x)\,dx\right)^2 \leq \int_{-1}^{1}(f''(x))^2\,dx \cdot \int_{-1}^{1} g(x)... | If $g$ is an arbitrary twice continuously differentiable function on $[-1,1]$, then by applying the Cauchy--Schwarz inequality for $f''$ and $g$ and integrate by parts twice we get
\[
\sqrt{\int_{-1}^{1} (f'')^2 \cdot \int_{-1}^{1} g^2} \geq \int_{-1}^{1} f''g = \Big[f'(1)g(1) - f'(-1)g(-1)\Big] - \int_{-1}^{1} f'g' =
... | {
"prompt_tokens": 14625,
"completion_tokens": 16138,
"total_tokens": 30763
} | - **Applying the Cauchy Inequality (1/1)**: The student correctly states the Cauchy–Schwarz inequality for integrals and performs a valid double integration by parts to obtain formula $(\star)$. Full marks.
- **Deriving a useful function (0/2)**: The student tries $g(x) = x$ and $g(x) = x^2$, both of which fail to eli... | [
{
"title": "Applying the Cauchy Inequality",
"max_points": 1,
"awarded_points": 1,
"desc": "For applying the Cauchy Inequality on the second derivative and a generic function. All points are awarded if the inequality is applied to a a specific function which leads to the correct lower bound."
},
... |
imc_2025_problem_2_id_8 | Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a twice continuously differentiable function, and suppose that $\int_{-1}^{1} f(x) \mathrm{d} x=0$ and $f(1)=f(-1)=1$. Prove that
$$
\int_{-1}^{1}\left(f^{\prime \prime}(x)\right)^{2} \mathrm{~d} x \geq 15
$$
and find all such functions for which equality holds. | 7 | 2 | We wish to prove that $\int_{-1}^{1}(f''(x))^{2}\,dx \geq 15$ and find all functions achieving equality.
**Approach via Cauchy–Schwarz.** The strategy is to apply the Cauchy–Schwarz inequality with $f''$ and a suitable test function. A natural choice is $g(x) = 1 - x^{2}$, which satisfies $g(\pm 1) = 0$ and is symmetr... | If $g$ is an arbitrary twice continuously differentiable function on $[-1,1]$, then by applying the Cauchy--Schwarz inequality for $f''$ and $g$ and integrate by parts twice we get
\[
\sqrt{\int_{-1}^{1} (f'')^2 \cdot \int_{-1}^{1} g^2} \geq \int_{-1}^{1} f''g = \Big[f'(1)g(1) - f'(-1)g(-1)\Big] - \int_{-1}^{1} f'g' =
... | {
"prompt_tokens": 13641,
"completion_tokens": 22136,
"total_tokens": 35777
} | - **Applying the Cauchy Inequality (0/1):** The student writes down the Cauchy–Schwarz inequality but only obtains the trivial bound $0 \leq (\text{something positive})$ because their computation of $\int_{-1}^1 f''g\,dx$ yielded $0$. Cauchy–Schwarz is never successfully applied to produce a nontrivial lower bound, so ... | [
{
"title": "Applying the Cauchy Inequality",
"max_points": 1,
"awarded_points": 0,
"desc": "For applying the Cauchy Inequality on the second derivative and a generic function. All points are awarded if the inequality is applied to a a specific function which leads to the correct lower bound."
},
... |
imc_2025_problem_3_id_9 | Denote by $\mathcal{S}$ the set of all real symmetric $2025 \times 2025$ matrices of rank $1$ whose entries take values $-1$ or $+1$. Let $A, B \in \mathcal{S}$ be matrices chosen independently uniformly at random. Find the probability that $A$ and $B$ commute, i.e. $A B=B A$. | 7 | 1 | **Solution.** Let $n = 2025$. We first characterize the elements of $\mathcal{S}$.
Any real symmetric matrix of rank 1 can be written as $uu^T$ for some nonzero vector $u \in \mathbb{R}^n$. If additionally all entries are $\pm 1$, then we need $u_i u_j \in \{-1, +1\}$ for all $i, j$. In particular, taking $i = j$, we ... | Let $n = 2025$. First, we give a characterisation of matrices in $S$.
Suppose that $A = (a_{ij})_{i,j=1}^{n} \in S$. Since $\operatorname{rk} A = 1$, for every $1 < i, j \leq n$, we have
\[
\det \begin{pmatrix} a_{11} & a_{1j} \\ a_{i1} & a_{ij} \end{pmatrix} = a_{11}a_{ij} - a_{i1}a_{1j} = a_{11}a_{ij} - a_{i1}a_{j1}... | {
"prompt_tokens": 23994,
"completion_tokens": 23645,
"total_tokens": 47639
} | - **Form of matrices in $\mathcal{S}$ (0/2):** The student claims every rank-1 real symmetric matrix is of the form $uu^T$, which is false — this misses negative semidefinite rank-1 matrices like $-vv^T$. The correct characterization $\varepsilon vv^T$ with $\varepsilon \in \{-1,+1\}$ is never established. Earns 0/2.
... | [
{
"title": "Form of matrices in $\\mathcal{S}$",
"max_points": 2,
"awarded_points": 0,
"desc": "The model shows that a matrix in $\\mathcal{S}$ can be expressed as $\\varepsilon v v^T$ for some $\\varepsilon \\in \\{-1, 1\\}$ and $v \\in \\{-1, 1\\}^{2025}$."
},
{
"title": "Size of $\\mathca... |
imc_2025_problem_3_id_10 | Denote by $\mathcal{S}$ the set of all real symmetric $2025 \times 2025$ matrices of rank $1$ whose entries take values $-1$ or $+1$. Let $A, B \in \mathcal{S}$ be matrices chosen independently uniformly at random. Find the probability that $A$ and $B$ commute, i.e. $A B=B A$. | 7 | 4 | Let $n = 2025$.
**Characterization of $\mathcal{S}$.** Any real symmetric matrix of rank 1 can be written as $cww^T$ for some nonzero vector $w$ and scalar $c \neq 0$. Since all entries of our matrix are $\pm 1$, we need $|c| \cdot |w_i w_j| = 1$ for all $i, j$, and so $w$ must have entries in $\{-1,1\}^n$ (up to a gl... | Let $n = 2025$. First, we give a characterisation of matrices in $S$.
Suppose that $A = (a_{ij})_{i,j=1}^{n} \in S$. Since $\operatorname{rk} A = 1$, for every $1 < i, j \leq n$, we have
\[
\det \begin{pmatrix} a_{11} & a_{1j} \\ a_{i1} & a_{ij} \end{pmatrix} = a_{11}a_{ij} - a_{i1}a_{1j} = a_{11}a_{ij} - a_{i1}a_{j1}... | {
"prompt_tokens": 12413,
"completion_tokens": 16265,
"total_tokens": 28678
} | - **Form of matrices in $\mathcal{S}$ (1/2):** The student correctly states the form $A = \varepsilon vv^T$ with $\varepsilon \in \{-1,1\}$ and $v \in \{-1,1\}^n$, but the justification is incomplete. They assert "up to a global rescaling" that $w$ must have $\pm 1$ entries without rigorously proving it (e.g., they don... | [
{
"title": "Form of matrices in $\\mathcal{S}$",
"max_points": 2,
"awarded_points": 1,
"desc": "The model shows that a matrix in $\\mathcal{S}$ can be expressed as $\\varepsilon v v^T$ for some $\\varepsilon \\in \\{-1, 1\\}$ and $v \\in \\{-1, 1\\}^{2025}$."
},
{
"title": "Size of $\\mathca... |
imc_2025_problem_3_id_11 | Denote by $\mathcal{S}$ the set of all real symmetric $2025 \times 2025$ matrices of rank $1$ whose entries take values $-1$ or $+1$. Let $A, B \in \mathcal{S}$ be matrices chosen independently uniformly at random. Find the probability that $A$ and $B$ commute, i.e. $A B=B A$. | 7 | 3 | Let $n = 2025$.
**Form of matrices in $\mathcal{S}$.** Observe that for any $v \in \{-1,1\}^n$ and $\varepsilon \in \{-1,1\}$, the matrix $\varepsilon vv^T$ is real symmetric, has rank $1$, and has all entries in $\{-1,1\}$ since $(\varepsilon vv^T)_{ij} = \varepsilon v_i v_j \in \{-1,1\}$. So every such $\varepsilon ... | Let $n = 2025$. First, we give a characterisation of matrices in $S$.
Suppose that $A = (a_{ij})_{i,j=1}^{n} \in S$. Since $\operatorname{rk} A = 1$, for every $1 < i, j \leq n$, we have
\[
\det \begin{pmatrix} a_{11} & a_{1j} \\ a_{i1} & a_{ij} \end{pmatrix} = a_{11}a_{ij} - a_{i1}a_{1j} = a_{11}a_{ij} - a_{i1}a_{j1}... | {
"prompt_tokens": 11835,
"completion_tokens": 12305,
"total_tokens": 24140
} | - **Form of matrices in $\mathcal{S}$ (1/2):** The student correctly states the form $\varepsilon vv^T$ and verifies the easy direction (that every such matrix lies in $\mathcal{S}$), but the converse direction is hand-waved. The claim "a real symmetric rank-1 matrix is always a scalar multiple of an outer product $ww^... | [
{
"title": "Form of matrices in $\\mathcal{S}$",
"max_points": 2,
"awarded_points": 1,
"desc": "The model shows that a matrix in $\\mathcal{S}$ can be expressed as $\\varepsilon v v^T$ for some $\\varepsilon \\in \\{-1, 1\\}$ and $v \\in \\{-1, 1\\}^{2025}$."
},
{
"title": "Size of $\\mathca... |
imc_2025_problem_4_id_12 | Let $a$ be an even positive integer. Find all real numbers $x$ such that
$$
\left\lfloor\sqrt[a]{b^{a}+x} \cdot b^{a-1}\right\rfloor=b^{a}+\lfloor x / a\rfloor
$$
holds for every positive integer $b$.
(Here $\lfloor x\rfloor$ denotes the largest integer that is no greater than $x$.) | 7 | 4 | We claim that the answer is:
- $x \in [-1, a)$ if $a \geq 4$,
- $x \in [-1, 2) \cup [3, 4)$ if $a = 2$.
**Finding necessary conditions.** Setting $b = 1$ in the given equation, we obtain
$$\lfloor \sqrt[a]{1 + x} \rfloor = 1 + \lfloor x/a \rfloor. \tag{1}$$
Since $\lfloor \sqrt[a]{1+x} \rfloor \geq 0$, we need $\lflo... | We will show that if $a = 2$ then we must have $x \in [-1, 2) \cup [3, 4)$, otherwise $x \in [-1, a)$.
Suppose that $\lfloor x/a \rfloor = m$. Then $m \leq x/a < m + 1$, and
\[
am \leq x < a(m+1). \tag{2}
\]
Let $b = 1$. Then
\[
\floor{\sqrt[a]{1 + x}} = 1 + \lfloor x/a \rfloor. \tag{3}
\]
From (3) it follows that $\f... | {
"prompt_tokens": 32778,
"completion_tokens": 68023,
"total_tokens": 100801
} | - **"Simplifying the LHS for $b=1$" (1/1):** The student clearly sets $b=1$ and derives $\lfloor \sqrt[a]{1+x} \rfloor = 1 + \lfloor x/a \rfloor$.
- **"Creating a tight condition between $a$ and $x$" (0/2):** The student never derives a general 2-variable condition such as $(m+1)^a \leq a(m+1)$ or the combined inequal... | [
{
"title": "Simplifying the LHS for $b=1$",
"max_points": 1,
"awarded_points": 1,
"desc": "For setting $b=1$ and simplifying $\\lfloor \\sqrt[a]{1+x} \\rfloor$ to $1+\\lfloor\\frac{x}{a}\\rfloor$"
},
{
"title": "Creating a tight condition between $a$ and $x$",
"max_points": 2,
"award... |
imc_2025_problem_4_id_13 | Let $a$ be an even positive integer. Find all real numbers $x$ such that
$$
\left\lfloor\sqrt[a]{b^{a}+x} \cdot b^{a-1}\right\rfloor=b^{a}+\lfloor x / a\rfloor
$$
holds for every positive integer $b$.
(Here $\lfloor x\rfloor$ denotes the largest integer that is no greater than $x$.) | 7 | 6 | We claim that for $a = 2$ the answer is $x \in [-1, 2) \cup [3, 4)$, and for even $a \geq 4$ the answer is $x \in [-1, a)$.
**Necessity.** Write $m = \lfloor x/a \rfloor$, so that
$$am \leq x < a(m+1). \tag{1}$$
Substituting $b = 1$ into the given equation, we obtain
$$\lfloor \sqrt[a]{1+x} \rfloor = 1 + \lfloor x/a ... | We will show that if $a = 2$ then we must have $x \in [-1, 2) \cup [3, 4)$, otherwise $x \in [-1, a)$.
Suppose that $\lfloor x/a \rfloor = m$. Then $m \leq x/a < m + 1$, and
\[
am \leq x < a(m+1). \tag{2}
\]
Let $b = 1$. Then
\[
\floor{\sqrt[a]{1 + x}} = 1 + \lfloor x/a \rfloor. \tag{3}
\]
From (3) it follows that $\f... | {
"prompt_tokens": 14831,
"completion_tokens": 20809,
"total_tokens": 35640
} | - **Creating a tight condition between $a$ and $x$ (1/2)**: When intersecting conditions (1) and (3) to derive (4), the student asserts without justification that "the lower bound from (3) is at least as large as that from (1)" (i.e., $(1+m)^a - 1 \geq am$) and "the upper bound from (1) is at most as large as that from... | [
{
"title": "Simplifying the LHS for $b=1$",
"max_points": 1,
"awarded_points": 1,
"desc": "For setting $b=1$ and simplifying $\\lfloor \\sqrt[a]{1+x} \\rfloor$ to $1+\\lfloor\\frac{x}{a}\\rfloor$"
},
{
"title": "Creating a tight condition between $a$ and $x$",
"max_points": 2,
"award... |
imc_2025_problem_4_id_14 | Let $a$ be an even positive integer. Find all real numbers $x$ such that
$$
\left\lfloor\sqrt[a]{b^{a}+x} \cdot b^{a-1}\right\rfloor=b^{a}+\lfloor x / a\rfloor
$$
holds for every positive integer $b$.
(Here $\lfloor x\rfloor$ denotes the largest integer that is no greater than $x$.) | 7 | 3 | We will show that the answer is $x \in [-1, a)$ for $a \geq 4$ (even), and $x \in [-1, 2) \cup [3, 4)$ for $a = 2$.
**Finding Necessary Conditions.**
Let $m = \lfloor x/a \rfloor$, so that
$$am \leq x < a(m+1). \tag{1}$$
Setting $b = 1$ in the given equation yields
$$\lfloor \sqrt[a]{1 + x} \rfloor = 1 + \lfloor x/a... | We will show that if $a = 2$ then we must have $x \in [-1, 2) \cup [3, 4)$, otherwise $x \in [-1, a)$.
Suppose that $\lfloor x/a \rfloor = m$. Then $m \leq x/a < m + 1$, and
\[
am \leq x < a(m+1). \tag{2}
\]
Let $b = 1$. Then
\[
\floor{\sqrt[a]{1 + x}} = 1 + \lfloor x/a \rfloor. \tag{3}
\]
From (3) it follows that $\f... | {
"prompt_tokens": 15823,
"completion_tokens": 36462,
"total_tokens": 52285
} | - **Creating a tight condition between $a$ and $x$ (0/2):** The student never derives a general 2-variable necessary condition such as $(m+1)^a \leq a(m+1)$ (from which one can deduce $m + 1 \leq a^{1/(a-1)}$ and systematically determine all valid $m$). Instead, the student simply intersects the intervals (1) and (3) f... | [
{
"title": "Simplifying the LHS for $b=1$",
"max_points": 1,
"awarded_points": 1,
"desc": "For setting $b=1$ and simplifying $\\lfloor \\sqrt[a]{1+x} \\rfloor$ to $1+\\lfloor\\frac{x}{a}\\rfloor$"
},
{
"title": "Creating a tight condition between $a$ and $x$",
"max_points": 2,
"award... |
imc_2025_problem_5_id_15 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 6 | **Proof.** We show that for every $\tau \in T_n$, we have $\operatorname{ord}(\tau) < f(n) + n^{0.501}$ for all sufficiently large $n$.
**Setup.** Define $C(\tau) = \{x \in [n] : \tau^k(x) = x \text{ for some } k > 0\}$. This is the set of all elements that lie on some cycle of $\tau$. Since $C(\tau)$ is $\tau$-invari... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 13622,
"completion_tokens": 8789,
"total_tokens": 22411
} | - **$N \leqslant f(n)/2$ (0/1)**: The student asserts "$p \nmid N$, therefore $N \leq f(n)/p$" without justification. The required argument is to *construct* a permutation $\tau_0 \in S_n$ that agrees with $\tau_c$ on $C(\tau)$ and includes a cycle of length $p$ among the remaining $\geq n^{0.501} > p$ elements, so tha... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 2,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_5_id_16 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 1 | **Proof.** For any map $\tau \in T_n$, consider the functional graph of $\tau$ on $[n]$. Each connected component of this directed graph consists of a directed cycle with directed trees ("tails") feeding into it. Let $C(\tau) \subseteq [n]$ denote the set of all elements lying on cycles, i.e., those $x$ for which $\tau... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 13434,
"completion_tokens": 16934,
"total_tokens": 30368
} | 1. **Splitting the order (0/2):** The student never properly defines $R$ as the maximum tail length, never proves that $\tau^R(x) \in C(\tau)$ for all $x$, and never rigorously establishes $\operatorname{ord}(\tau) \leq N + R$. Instead, they merely assert "we expect $\operatorname{ord}(\tau) \leq N + n$" without proof,... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 0,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_5_id_17 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 1 | **Proof.** Let $\tau: [n] \to [n]$ be any map. The functional graph of $\tau$ consists of connected components, each containing a unique directed cycle with tree-like "tails" leading into it. Let $C(\tau) \subseteq [n]$ denote the set of all elements lying on cycles, and let $\tau_c = \tau|_{C(\tau)}$ be the restrictio... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 23549,
"completion_tokens": 35314,
"total_tokens": 58863
} | - **Splitting the order (0/2)**: The student defines $C(\tau)$, $\tau_c$, and $N$ correctly, but never proves any explicit bound of the form $\operatorname{ord}(\tau) \leq N + R$ or even $\operatorname{ord}(\tau) \leq N + n$. The second paragraph only states informally that "the order is essentially $N$ plus the contri... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 0,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_5_id_18 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 4 | **Proof.** We aim to show that for sufficiently large $n$, every $\tau \in T_n$ satisfies $\operatorname{ord}(\tau) < f(n) + n^{0.501}$.
**Decomposition into cyclic and tail parts.** Given $\tau \in T_n$, define
$$C(\tau) = \{x \in [n] : \tau^k(x) = x \text{ for some } k \geq 1\}.$$
Since $C(\tau)$ is $\tau$-invariant... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 24634,
"completion_tokens": 24546,
"total_tokens": 49180
} | - **Splitting the order (2/2):** The candidate correctly defines $C(\tau)$, $\tau_c$, $N$, $h(x)$, and $R$, and rigorously shows $\tau^{R+N} = \tau^R$, concluding $\operatorname{ord}(\tau) \leq N + R$. Full marks.
- **Finish simple case (0/1):** The candidate mentions the case $R < n^{0.501}$ only in passing, writing ... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 2,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_5_id_19 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 1 | **Proof.** For any map $\tau \in T_n$, consider its functional graph on $[n]$. Since $[n]$ is finite, every element eventually enters a cycle under repeated application of $\tau$.
Define $C(\tau) = \{x \in [n] : \tau^k(x) = x \text{ for some } k \geq 1\}$ to be the set of all elements lying on a cycle. Then $C(\tau)$ ... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 22745,
"completion_tokens": 20460,
"total_tokens": 43205
} | - **Splitting the order (1/2):** The student correctly defines $C(\tau)$, $\tau_c$, $N$, $h(x)$, and $R$, earning partial credit for the correct decomposition. However, the claimed bound $\operatorname{ord}(\tau) \mid \operatorname{lcm}(N, R)$ hence $\operatorname{ord}(\tau) \leq N \cdot R$ is incorrect—$R$ is a tail l... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 1,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_5_id_20 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 2 | **Proof.** We wish to show that for all sufficiently large $n$ and every $\tau \in T_n$, we have $\operatorname{ord}(\tau) < f(n) + n^{0.501}$.
**Setup.** Given $\tau \in T_n$, let $C(\tau) = \{x \in [n] : \tau^k(x) = x \text{ for some } k \geq 1\}$ be the set of *cyclic* elements. Since $C(\tau)$ is $\tau$-invariant,... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 38763,
"completion_tokens": 45718,
"total_tokens": 84481
} | 1. **Splitting the order (1/2):** The candidate correctly defines $C(\tau)$, $\tau_c$, $N$, $h(x)$, and $R$, and states the correct bound $\operatorname{ord}(\tau) \leq N + R$. However, the justification remains informal ("transient behavior lasts at most $R$ steps and the cyclic behavior repeats every $N$ steps") with... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 1,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_5_id_21 | For a positive integer $n$, let $[n]=\{1,2, \ldots, n\}$. Denote by $S_{n}$ the set of all bijections from $[n]$ to $[n]$, and let $T_{n}$ be the set of all maps from $[n]$ to $[n]$. Define the order $\operatorname{ord}(\tau)$ of a map $\tau \in T_{n}$ as the number of distinct maps in the set $\{\tau, \tau \circ \tau,... | 7 | 4 | **Proof.** For any $\tau \in T_n$, we aim to show $\operatorname{ord}(\tau) < f(n) + n^{0.501}$ for sufficiently large $n$.
**Setup.** Define $C(\tau) = \{x \in [n] : \tau^k(x) = x \text{ for some } k > 0\}$, the set of *cyclic* elements of $\tau$. Since $\tau$ maps $C(\tau)$ into itself, the restriction $\tau_c = \ta... | For every $\tau \in T_n$ we need to prove that $\operatorname{ord}(\tau) \leqslant f(n) + n^{0.501}$ (if $n$ is large enough).
Denote by $C(\tau)$ the set of elements $x \in [n]$ for which $\tau^k(x) = \underbrace{\tau(\ldots\tau}_{k}(x)\ldots) = x$ for some $k > 0$. It is immediate that $C(\tau)$ is a $\tau$-invarian... | {
"prompt_tokens": 25278,
"completion_tokens": 29276,
"total_tokens": 54554
} | - **"Splitting the order" (2/2):** The candidate correctly defines $C(\tau)$, the restricted permutation $\tau_c$ with order $N$, the hitting times $h(x)$, and the tail length $R$. They establish $\tau^{R+N} = \tau^R$, yielding $\operatorname{ord}(\tau) \leq N + R$. Full marks.
- **"Finish simple case" (1/1):** Case 1... | [
{
"title": "Splitting the order",
"max_points": 2,
"awarded_points": 2,
"desc": "Shows that the order of a map is less than or equal to $N+R$ where $N$ is the order of the permutation consisting of all elements in a cycle and $R$ is the maximum number for which $\\tau^{R-1}(x)$ is not in a cycle for... |
imc_2025_problem_6_id_22 | Let $f:(0, \infty) \rightarrow \mathbb{R}$ be a continuously differentiable function, and let $b>a>0$ be real numbers such that $f(a)=f(b)=k$. Prove that there exists a point $\xi \in(a, b)$ such that
$$
f(\xi)-\xi f^{\prime}(\xi)=k
$$ | 7 | 2 | **Proof.** We wish to show there exists $\xi \in (a, b)$ such that $f(\xi) - \xi f'(\xi) = k$.
First, observe that the expression $f(x) - xf'(x)$ arises naturally from differentiation. Specifically, consider $g(x) = \dfrac{f(x)}{x}$, which is continuously differentiable on $(0, \infty)$ since $f$ is continuously diffe... | Observe that if we consider $g(x) = f(x)/x$ and take its derivative, we get
\[
g'(x) = \frac{xf'(x) - f(x)}{x^2},
\]
where the numerator is almost the expression we have in the problem.
Now we apply Cauchy's theorem to the functions $g(x) = f(x)/x$ and $h(x) = 1/x$, well-defined over $[a, b]$. This gives us the existe... | {
"prompt_tokens": 9839,
"completion_tokens": 22553,
"total_tokens": 32392
} | - **Defining an auxiliary function (0/1):** The student works with $g(x) = f(x)/x$ throughout, but never defines the proper auxiliary function $(f(x) - k)/x = f(x)/x - k/x$ (a genuine linear combination of $f(x)/x$ and $1/x$) that would allow a direct application of Rolle's theorem. Nor does the student pair $g(x) = f(... | [
{
"title": "Defining an auxiliary function",
"max_points": 1,
"awarded_points": 0,
"desc": "Given for defining an auxiliary function that is a linear combination of $f(x)/x$ and $1/x$, or if the defined function is shown to correctly finish the solution."
},
{
"title": "Properties of the aux... |
imc_2025_problem_6_id_23 | Let $f:(0, \infty) \rightarrow \mathbb{R}$ be a continuously differentiable function, and let $b>a>0$ be real numbers such that $f(a)=f(b)=k$. Prove that there exists a point $\xi \in(a, b)$ such that
$$
f(\xi)-\xi f^{\prime}(\xi)=k
$$ | 7 | 3 | Consider the function $g(x) = \dfrac{f(x)}{x}$, which is well-defined and continuously differentiable on $(0,\infty)$, hence continuous on $[a,b]$ and differentiable on $(a,b)$.
We compute its derivative:
$$g'(x) = \frac{xf'(x) - f(x)}{x^2}.$$
Observe that $f(x) - xf'(x) = -x^2\, g'(x)$, so finding a point $\xi$ wher... | Observe that if we consider $g(x) = f(x)/x$ and take its derivative, we get
\[
g'(x) = \frac{xf'(x) - f(x)}{x^2},
\]
where the numerator is almost the expression we have in the problem.
Now we apply Cauchy's theorem to the functions $g(x) = f(x)/x$ and $h(x) = 1/x$, well-defined over $[a, b]$. This gives us the existe... | {
"prompt_tokens": 9413,
"completion_tokens": 9132,
"total_tokens": 18545
} | - **Defining an auxiliary function (0/1):** The student defines only $g(x) = f(x)/x$ and never introduces a second function $h(x) = 1/x$ or a combined auxiliary function such as $(f(x)-k)/x$. This means no auxiliary function that is a linear combination of $f(x)/x$ and $1/x$ (or equivalent single function suited for Ro... | [
{
"title": "Defining an auxiliary function",
"max_points": 1,
"awarded_points": 0,
"desc": "Given for defining an auxiliary function that is a linear combination of $f(x)/x$ and $1/x$, or if the defined function is shown to correctly finish the solution."
},
{
"title": "Properties of the aux... |
imc_2025_problem_6_id_24 | Let $f:(0, \infty) \rightarrow \mathbb{R}$ be a continuously differentiable function, and let $b>a>0$ be real numbers such that $f(a)=f(b)=k$. Prove that there exists a point $\xi \in(a, b)$ such that
$$
f(\xi)-\xi f^{\prime}(\xi)=k
$$ | 7 | 5 | **Proof.** Define the auxiliary functions
$$g(x) = \frac{f(x)}{x} \quad \text{and} \quad h(x) = \frac{1}{x}$$
on the interval $[a, b]$.
We compute their derivatives:
$$g'(x) = \frac{xf'(x) - f(x)}{x^2}, \quad h'(x) = -\frac{1}{x^2}.$$
Observe that the ratio of these derivatives is
$$\frac{g'(x)}{h'(x)} = \frac{\;\dfr... | Observe that if we consider $g(x) = f(x)/x$ and take its derivative, we get
\[
g'(x) = \frac{xf'(x) - f(x)}{x^2},
\]
where the numerator is almost the expression we have in the problem.
Now we apply Cauchy's theorem to the functions $g(x) = f(x)/x$ and $h(x) = 1/x$, well-defined over $[a, b]$. This gives us the existe... | {
"prompt_tokens": 21817,
"completion_tokens": 50208,
"total_tokens": 72025
} | - **Defining an auxiliary function (1/1):** The student correctly defines $g(x) = f(x)/x$ and $h(x) = 1/x$, which is the appropriate linear combination. Full marks.
- **Properties of the auxiliary function (1/2):** The student correctly computes $g'(x)/h'(x) = f(x) - xf'(x)$, demonstrating that the auxiliary functions... | [
{
"title": "Defining an auxiliary function",
"max_points": 1,
"awarded_points": 1,
"desc": "Given for defining an auxiliary function that is a linear combination of $f(x)/x$ and $1/x$, or if the defined function is shown to correctly finish the solution."
},
{
"title": "Properties of the aux... |
imc_2025_problem_7_id_25 | Let $\mathbb{Z}_{>0}$ be the set of positive integers. Find all nonempty subsets $M \subseteq \mathbb{Z}_{>0}$ satisfying both of the following properties:
(a) if $x \in M$, then $2 x \in M$,
(b) if $x, y \in M$ and $x+y$ is even, then $\frac{x+y}{2} \in M$. | 7 | 3 | **Solution.** We claim that the nonempty subsets $M \subseteq \mathbb{Z}_{>0}$ satisfying both properties are exactly the sets of the form
$$M = \{md,\; (m+1)d,\; (m+2)d,\; \ldots\}$$
for a positive odd integer $d$ and a positive integer $m$.
**Step 1: $M$ is closed under addition.**
Let $x, y \in M$. By property (a)... | Note that $M$ is closed under addition since $x + y = \frac{2x + 2y}{2}$. Therefore it is closed under multiplication by an arbitrary natural number. Also, $M$ contains some odd numbers since $x \in M \implies \frac{x + 2x}{2} = \frac{3x}{2} \in M$, and we can repeat this until all factors of $2$ are removed from a num... | {
"prompt_tokens": 11406,
"completion_tokens": 18869,
"total_tokens": 30275
} | - **GCD $d$ (1/2):** The student correctly defines $d = \gcd(M)$, establishes that $d$ is odd, and shows $M \subseteq d\mathbb{Z}_{>0}$. They also use the numerical semigroup framework to show all *sufficiently large* multiples of $d$ are in $M$. However, they never show that there exist two specific members of $M$ who... | [
{
"title": "Closed under addition",
"max_points": 1,
"awarded_points": 1,
"desc": "Shows that $M$ is closed under addition."
},
{
"title": "Contains odd integers",
"max_points": 1,
"awarded_points": 1,
"desc": "Shows that $M$ contains at least one odd integer."
},
{
"titl... |
TROJAN-Bench-S
A benchmark for LLM proof graders. It holds 200 synthetic student proofs with errors injected on purpose, and each proof comes with its ground-truth score on every rubric criterion. A good judge should recover the injected score.
Paper: Can LLMs Reliably Grade Olympiad Proofs? A Study of Mathematical Verification with LLMs
Code: https://github.com/aziksh-ospanov/TROJAN
The problems come from MathArena: IMC 2025, IMO 2025,
USAMO 2025 and USAMO 2026, with 50 proofs from each. Every problem is worth 7 points, and scores
range from 0 to 6. The proofs were generated by the TROJAN pipeline with claude-opus-4-6-thinking
in a generate → critique → refine loop: the model was asked to hit a target score per criterion,
and an LLM critic checked the result.
| Field | Description |
|---|---|
problem_idx |
<competition>_problem_<n>_id_<i> |
problem |
Problem statement |
max_points / awarded_points |
Maximum score / ground-truth score |
solution |
Error-injected proof to be graded |
sample_solution |
Reference solution |
grading_scheme |
Rubric: title, desc, max_points, ground-truth awarded_points |
justification |
Where the points are lost and why (hide this from the judge) |
token_usage |
Tokens spent generating the sample |
from datasets import load_dataset
ds = load_dataset("aziksh/TROJAN-Bench-S", split="test")
- Downloads last month
- 76