{"id":"f0add24795a8","problem":"At a fish market, there are 10 stalls, all selling the same 10 types of fish. All the fish are caught in either the North Sea or the Mediterranean Sea, and each stall has only one sea of origin for each type of fish. A number, $k$, of customers buy one fish from each stall such that they have one fish of each type. Furthermore, we know that each pair of customers has at least one fish of a different origin. We consider all possible ways to stock the stalls according to the above rules.\n\nWhat is the maximum possible value of $k$?","answer":"2^{10}-10","source":"olympiads_ref","qwen3.5_4b_rl_solved":32,"qwen3.5_4b_rl_attempts":304,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"ca632e79b4da","problem":"For a real number $a$ , let $\\lfloor a \\rfloor$ denote the greatest integer less than or equal to $a$ . Let $\\mathcal{R}$ denote the region in the coordinate plane consisting of points $(x,y)$ such that $\\lfloor x \\rfloor ^2 + \\lfloor y \\rfloor ^2 = 25$ . The region $\\mathcal{R}$ is completely contained in a disk of radius $r$ (a disk is the union of a circle and its interior). The minimum value of $r$ can be written as $\\frac {\\sqrt {m}}{n}$ , where $m$ and $n$ are integers and $m$ is not divisible by the square of any prime. Find $m + n$ .","answer":"132","source":"aime","qwen3.5_4b_rl_solved":36,"qwen3.5_4b_rl_attempts":328,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"886607c6b0b9","problem":"21. N4 (FRA) For any positive integer $x_{0}$, three sequences $\\left\\{x_{n}\\right\\},\\left\\{y_{n}\\right\\}$, and $\\left\\{z_{n}\\right\\}$ are defined as follows: (i) $y_{0}=4$ and $z_{0}=1$; (ii) if $x_{n}$ is even for $n \\geq 0, x_{n+1}=\\frac{x_{n}}{2}, y_{n+1}=2 y_{n}$, and $z_{n+1}=z_{n}$; (iii) if $x_{n}$ is odd for $n \\geq 0, x_{n+1}=x_{n}-\\frac{y_{n}}{2}-z_{n}, y_{n+1}=y_{n}$, and $z_{n+1}=$ $y_{n}+z_{n}$. The integer $x_{0}$ is said to be good if $x_{n}=0$ for some $n \\geq 1$. Find the number of good integers less than or equal to 1994.","answer":"31","source":"olympiads_ref","qwen3.5_4b_rl_solved":35,"qwen3.5_4b_rl_attempts":312,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"dd0e36c518c6","problem":"Let $n \\geq 3$ be an integer and consider an $n \\times n$ board, divided into $n^{2}$ unit squares. We have for each $m \\geq 1$ arbitrarily many $1 \\times m$ rectangles (type I) and arbitrarily many $m \\times 1$ rectangles (type II) available. We cover the board with $N$ of these rectangles, which do not overlap and do not extend beyond the board. The total number of type I rectangles on the board must be equal to the total number of type II rectangles on the board. (Note that a $1 \\times 1$ rectangle is both of type I and of type II.) What is the smallest value of $N$ for which this is possible?","answer":"2n-1","source":"olympiads_ref","qwen3.5_4b_rl_solved":37,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"fb23907ef77a","problem":"A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$ , and a different number in $S$ was divisible by $7$ . The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no. However, upon hearing that all four students replied no, each student was able to determine the elements of $S$ . Find the sum of all possible values of the greatest element of $S$ .","answer":"258","source":"aime","qwen3.5_4b_rl_solved":37,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"a9a6dc6a1451","problem":"Find the number of ordered pairs of integers $(a,b)$ such that the sequence \\[3,4,5,a,b,30,40,50\\] is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression.","answer":"228","source":"aime","qwen3.5_4b_rl_solved":38,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"7ca450f68e04","problem":"Rishabh has 2024 pairs of socks in a drawer. He draws socks from the drawer uniformly at random, without replacement, until he has drawn a pair of identical socks. Compute the expected number of unpaired socks he has drawn when he stops.","answer":"\\frac{4^{2024}}{\\binom{4048}{2024}}-2","source":"omnimath","qwen3.5_4b_rl_solved":37,"qwen3.5_4b_rl_attempts":304,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"f9e1f1a85f1d","problem":"For $n\\ge1$ call a finite sequence $(a_1,a_2,\\ldots,a_n)$ of positive integers progressive if $a_i1$ with the following property:\n\nfor each two positive divisors $k, \\ell2014$ routes between pairs of different cities that include no more than one intermediate stop (the direction of each route matters). Find the least possible $n$ and the least possible $r$ for that value of $n$.","answer":"2016","source":"olympiads_ref","qwen3.5_4b_rl_solved":89,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"ae289c766957","problem":"Find all triples $(x,y,z)$ of positive integers such that $x \\leq y \\leq z$ and \n\\[x^3(y^3+z^3)=2012(xyz+2).\\]","answer":"(2, 251, 252)","source":"omnimath","qwen3.5_4b_rl_solved":96,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.25} {"id":"a81f9a37da01","problem":"The coordinates of the vertices of isosceles trapezoid $ABCD$ are all integers, with $A=(20,100)$ and $D=(21,107)$ . The trapezoid has no horizontal or vertical sides, and $\\overline{AB}$ and $\\overline{CD}$ are the only parallel sides. The sum of the absolute values of all possible slopes for $\\overline{AB}$ is $m\/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ .","answer":"131","source":"aime","qwen3.5_4b_rl_solved":101,"qwen3.5_4b_rl_attempts":336,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"07424b769238","problem":"A $10\\times10\\times10$ grid of points consists of all points in space of the form $(i,j,k)$ , where $i$ , $j$ , and $k$ are integers between $1$ and $10$ , inclusive. Find the number of different lines that contain exactly $8$ of these points.","answer":"168","source":"aime","qwen3.5_4b_rl_solved":100,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"8264c4e354e8","problem":"Find all the triples of positive integers $(a, b, c)$ for which the number\n\n$$\n\\frac{(a+b)^{4}}{c}+\\frac{(b+c)^{4}}{a}+\\frac{(c+a)^{4}}{b}\n$$\n\nis an integer and $a+b+c$ is a prime.","answer":"(1,1,1),(1,2,2),(2,3,6)","source":"olympiads_ref","qwen3.5_4b_rl_solved":105,"qwen3.5_4b_rl_attempts":328,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"2e2c9e9094db","problem":"It is said that an integer $n \\geqslant 1$ is Japanese if it admits three divisors $d_{1}, d_{2}$, and $d_{3}$ such that $1 \\leqslant d_{1}2$ , and $X(k)=1$ if $p(k)=2$ . Let $\\{x_n\\}$ be the sequence defined by $x_0=1$ , and $x_{n+1}X(x_n)=x_np(x_n)$ for $n\\geq 0$ . Find the smallest positive integer $t$ such that $x_t=2090$ .","answer":"149","source":"aime","qwen3.5_4b_rl_solved":135,"qwen3.5_4b_rl_attempts":328,"qwen3.5_4b_base_pass_at_4":0.5} {"id":"f91fc693f4d9","problem":"25. S3 (POL) For an integer \\( x \\geq 1 \\), let \\( p(x) \\) be the least prime that does not divide \\( x \\), and define \\( q(x) \\) to be the product of all primes less than \\( p(x) \\). In particular, \\( p(1)=2 \\). For \\( x \\) such that \\( p(x)=2 \\), define \\( q(x)=1 \\). Consider the sequence \\( x_{0}, x_{1}, x_{2}, \\ldots \\) defined by \\( x_{0}=1 \\) and \n\\[ x_{n+1}=\\frac{x_{n} p\\left(x_{n}\\right)}{q\\left(x_{n}\\right)} \\]\nfor \\( n \\geq 0 \\). Find all \\( n \\) such that \\( x_{n}=1995 \\).","answer":"142","source":"olympiads_ref","qwen3.5_4b_rl_solved":124,"qwen3.5_4b_rl_attempts":296,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"d9bb0f5b8fd9","problem":"Find the smallest number $n$ such that there exist polynomials $f_1, f_2, \\ldots , f_n$ with rational coefficients satisfying \\[x^2+7 = f_1\\left(x\\right)^2 + f_2\\left(x\\right)^2 + \\ldots + f_n\\left(x\\right)^2.\\]","answer":"5","source":"omnimath","qwen3.5_4b_rl_solved":144,"qwen3.5_4b_rl_attempts":336,"qwen3.5_4b_base_pass_at_4":0.25} {"id":"1b8845b35ce3","problem":"Fourteen friends met at a party. One of them, Fredek, wanted to go to bed early. He said goodbye to 10 of his friends, forgot about the remaining 3, and went to bed. After a while he returned to the party, said goodbye to 10 of his friends (not necessarily the same as before), and went to bed. Later Fredek came back a number of times, each time saying goodbye to exactly 10 of his friends, and then went back to bed. As soon as he had said goodbye to each of his friends at least once, he did not come back again. In the morning Fredek realised that he had said goodbye a different number of times to each of his thirteen friends! What is the smallest possible number of times that Fredek returned to the party?","answer":"32","source":"olympiads_ref","qwen3.5_4b_rl_solved":141,"qwen3.5_4b_rl_attempts":328,"qwen3.5_4b_base_pass_at_4":0.25} {"id":"6e0d1b2a3e20","problem":"Let $a > 1$ and $x > 1$ satisfy $\\log_a(\\log_a(\\log_a 2) + \\log_a 24 - 128) = 128$ and $\\log_a(\\log_a x) = 256$ . Find the remainder when $x$ is divided by $1000$ .","answer":"896","source":"aime","qwen3.5_4b_rl_solved":132,"qwen3.5_4b_rl_attempts":304,"qwen3.5_4b_base_pass_at_4":0.0} {"id":"9fba11db3265","problem":"Let $k \\geq 1$ be an integer.\n\nWe consider $4 k$ chips, $2 k$ of which are red and $2 k$ of which are blue. A sequence of those $4 k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an equal number of consecutive blue chips. For example, we can move from $r \\underline{b b b r} \\underline{r} b$ to $r \\underline{r r} b r \\underline{b b b}$ where $r$ denotes a red chip and $b$ denotes a blue chip.\n\nDetermine the smallest number $n$ (as a function of $k$) such that starting from any initial sequence of the $4 k$ chips, we need at most $n$ moves to reach the state in which the first $2 k$ chips are red.","answer":"k","source":"olympiads_ref","qwen3.5_4b_rl_solved":143,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.25} {"id":"ef4765c0e075","problem":"Given that $x, y,$ and $z$ are real numbers that satisfy:\n\\begin{align*} x &= \\sqrt{y^2-\\frac{1}{16}}+\\sqrt{z^2-\\frac{1}{16}}, \\\\ y &= \\sqrt{z^2-\\frac{1}{25}}+\\sqrt{x^2-\\frac{1}{25}}, \\\\ z &= \\sqrt{x^2 - \\frac 1{36}}+\\sqrt{y^2-\\frac 1{36}}, \\end{align*}\nand that $x+y+z = \\frac{m}{\\sqrt{n}},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime, find $m+n.$","answer":"9","source":"amc_aime","qwen3.5_4b_rl_solved":141,"qwen3.5_4b_rl_attempts":312,"qwen3.5_4b_base_pass_at_4":0.25} {"id":"ad129d1dab9e","problem":"Let $\\overline{MN}$ be a diameter of a circle with diameter $1$ . Let $A$ and $B$ be points on one of the semicircular arcs determined by $\\overline{MN}$ such that $A$ is the midpoint of the semicircle and $MB=\\dfrac 35$ . Point $C$ lies on the other semicircular arc. Let $d$ be the length of the line segment whose endpoints are the intersections of diameter $\\overline{MN}$ with the chords $\\overline{AC}$ and $\\overline{BC}$ . The largest possible value of $d$ can be written in the form $r-s\\sqrt t$ , where $r$ , $s$ , and $t$ are positive integers and $t$ is not divisible by the square of any prime. Find $r+s+t$ .","answer":"14","source":"aime","qwen3.5_4b_rl_solved":152,"qwen3.5_4b_rl_attempts":336,"qwen3.5_4b_base_pass_at_4":0.5} {"id":"6d6b0d0decc9","problem":"How many 48-tuples of positive integers \\(\\left(a_{1}, a_{2}, \\ldots, a_{48}\\right)\\) between 0 and 100 inclusive have the property that for all \\(1 \\leq i4$ and $b>1$ such that \\[\\frac{x^2}{a^2}+\\frac{y^2}{a^2-16}=\\frac{(x-20)^2}{b^2-1}+\\frac{(y-11)^2}{b^2}=1.\\] Find the least possible value of $a+b.$","answer":"23","source":"aime","qwen3.5_4b_rl_solved":148,"qwen3.5_4b_rl_attempts":320,"qwen3.5_4b_base_pass_at_4":0.25} {"id":"a1d78bfcfc4f","problem":"Let \\[P(x) = 24x^{24} + \\sum_{j = 1}^{23}(24 - j)(x^{24 - j} + x^{24 + j}).\\] Let $z_{1},z_{2},\\ldots,z_{r}$ be the distinct zeros of $P(x),$ and let $z_{k}^{2} = a_{k} + b_{k}i$ for $k = 1,2,\\ldots,r,$ where $a_{k}$ and $b_{k}$ are real numbers. Let\n\n$\\sum_{k = 1}^{r}|b_{k}| = m + n\\sqrt {p},$\nwhere $m, n,$ and $p$ are integers and $p$ is not divisible by the square of any prime. Find $m + n + p.$","answer":"15","source":"amc_aime","qwen3.5_4b_rl_solved":145,"qwen3.5_4b_rl_attempts":312,"qwen3.5_4b_base_pass_at_4":0.0}