answers listlengths 1 1 | datasets listlengths 1 1 | id stringlengths 64 64 | messages listlengths 1 1 | prompt stringlengths 10 3.97k | reference_answer_raw stringlengths 9 3.95k | source stringclasses 11
values | source_records stringlengths 283 1.44k | verifiability dict |
|---|---|---|---|---|---|---|---|---|
[
"1"
] | [
"skywork"
] | c0d0383fb06be4a88174ba0f0523bbe68ec25ceb55a3328df0ab275a44741287 | [
{
"content": "3. Given the set $M=\\{(a, b) \\mid a \\leqslant-1, b \\leqslant m\\}$. If for any $(a, b) \\in M$, it always holds that $a \\cdot 2^{b}-b-3 a \\geqslant 0$, then the maximum value of the real number $m$ is $\\qquad$",
"role": "user"
}
] | 3. Given the set $M=\{(a, b) \mid a \leqslant-1, b \leqslant m\}$. If for any $(a, b) \in M$, it always holds that $a \cdot 2^{b}-b-3 a \geqslant 0$, then the maximum value of the real number $m$ is $\qquad$ | "[\"1\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7143, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 3, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20911"}, {"dataset": "skywork", "extra_inf... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"8"
] | [
"skywork"
] | a1f5c723cbf778e976a2f804e92ce322aacb64856030eb543a6bccb7c417923b | [
{
"content": "3. Grey Wolf needs to cut a 20-meter long steel pipe into 4-meter long segments, and it takes 2 minutes for each cut. How many minutes will it take in total?",
"role": "user"
}
] | 3. Grey Wolf needs to cut a 20-meter long steel pipe into 4-meter long segments, and it takes 2 minutes for each cut. How many minutes will it take in total? | "[\"8\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7147, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20912"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"621"
] | [
"skywork"
] | c531ac23fcf9d710f98063262838a5d2c94598db682ca920064db6cee5a8c402 | [
{
"content": "A positive integer $N$ has base-eleven representation $\\underline{a}\\kern 0.1em\\underline{b}\\kern 0.1em\\underline{c}$ and base-eight representation $\\underline1\\kern 0.1em\\underline{b}\\kern 0.1em\\underline{c}\\kern 0.1em\\underline{a},$ where $a,b,$ and $c$ represent (not necessarily dis... | A positive integer $N$ has base-eleven representation $\underline{a}\kern 0.1em\underline{b}\kern 0.1em\underline{c}$ and base-eight representation $\underline1\kern 0.1em\underline{b}\kern 0.1em\underline{c}\kern 0.1em\underline{a},$ where $a,b,$ and $c$ represent (not necessarily distinct) digits. Find the least such... | "[\"621\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7127, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20913"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac {2}{3}"
] | [
"skywork"
] | 956d60197f52f3b09846c1fee3dcc30f3d5a65791b4a8aa7e77a1537c59d2b43 | [
{
"content": "Given the function $f(x)= \\sqrt {3}|\\cos \\frac {π}{2}x|(x≥0)$, the highest points of the graph from left to right are consecutively labeled as P₁, P₃, P₅, …, and the intersection points of the function y=f(x) with the x-axis from left to right are consecutively labeled as P₂, P₄, P₆, …, Let Sₙ ... | Given the function $f(x)= \sqrt {3}|\cos \frac {π}{2}x|(x≥0)$, the highest points of the graph from left to right are consecutively labeled as P₁, P₃, P₅, …, and the intersection points of the function y=f(x) with the x-axis from left to right are consecutively labeled as P₂, P₄, P₆, …, Let Sₙ = $\overrightarrow {P_{1}... | "[\"\\\\frac {2}{3}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7128, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 10, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20914"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"495"
] | [
"skywork"
] | f353f13dffbe08144a2763250a30351ccb356062c95ba1ff55acdaeeb8527068 | [
{
"content": "Let $M=\\{1,2,\\dots,49\\}$ be the set of the first $49$ positive integers. Determine the maximum integer $k$ such that the set $M$ has a subset of $k$ elements such that there is no $6$ consecutive integers in such subset. For this value of $k$, find the number of subsets of $M$ with $k$ elements... | Let $M=\{1,2,\dots,49\}$ be the set of the first $49$ positive integers. Determine the maximum integer $k$ such that the set $M$ has a subset of $k$ elements such that there is no $6$ consecutive integers in such subset. For this value of $k$, find the number of subsets of $M$ with $k$ elements with the given property. | "[\" 495 \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7140, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 12, "DeepSeek-R1-Distill-Qwen-7B": 14}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20915"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"365"
] | [
"skywork"
] | d3f9251a45ec70db405f29f9d1be6caf6a1b9370daaec349953350e22e6a688c | [
{
"content": "Let $S\\,$ be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of $S\\,$ so that the union of the two subsets is $S\\,$ ? The order of selection does not matter; for example, the pair of subsets $\\{a, c\\},\\{b, c, d, e, f\\}$ represents the... | Let $S\,$ be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of $S\,$ so that the union of the two subsets is $S\,$ ? The order of selection does not matter; for example, the pair of subsets $\{a, c\},\{b, c, d, e, f\}$ represents the same selection as the pair $... | "[\"365\"]" | train-math-aime19832023 | [{"dataset": "skywork", "extra_info": {"index": 7154, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20916"}, {"dataset": "skywork", "extra_inf... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"15"
] | [
"skywork"
] | 6057d0bd56b54e032e028002b3a5473fee2ea32d4b45d6107561274a99a9e118 | [
{
"content": "8. Niu Niu walks along a straight road. She walks from the 1st tree to the 5th tree in exactly 5 minutes. If the distance between adjacent trees is equal, at this speed, it will take $\\qquad$ more minutes for Niu Niu to reach the 17th tree.",
"role": "user"
}
] | 8. Niu Niu walks along a straight road. She walks from the 1st tree to the 5th tree in exactly 5 minutes. If the distance between adjacent trees is equal, at this speed, it will take $\qquad$ more minutes for Niu Niu to reach the 17th tree. | "[\"15\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7148, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 2, "DeepSeek-R1-Distill-Qwen-7B": 4}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20917"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"159"
] | [
"skywork"
] | 749f8b8cf62e2604905d0cb08277bf6b1a43b4376894924d9e67f04a5af0a3f1 | [
{
"content": "Garfield and Odie are situated at $(0,0)$ and $(25,0)$, respectively. Suddenly, Garfield and Odie dash in the direction of the point $(9, 12)$ at speeds of $7$ and $10$ units per minute, respectively. During this chase, the minimum distance between Garfield and Odie can be written as $\\frac{m}{\\... | Garfield and Odie are situated at $(0,0)$ and $(25,0)$, respectively. Suddenly, Garfield and Odie dash in the direction of the point $(9, 12)$ at speeds of $7$ and $10$ units per minute, respectively. During this chase, the minimum distance between Garfield and Odie can be written as $\frac{m}{\sqrt{n}}$ for relatively... | "[\" 159 \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7145, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 11, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 3}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20918"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"2 \\sqrt{7}"
] | [
"skywork"
] | 1faaed40b2d7f8f9ec5983afda14e7d25aa414c439c072d0af333fbb626d9de5 | [
{
"content": "Find the minimum value of the expression\n\n$$\n\\sqrt{x^{2}-2 \\sqrt{3} \\cdot|x|+4}+\\sqrt{x^{2}+2 \\sqrt{3} \\cdot|x|+12}\n$$\n\nas well as the values of $x$ at which it is achieved.",
"role": "user"
}
] | Find the minimum value of the expression
$$
\sqrt{x^{2}-2 \sqrt{3} \cdot|x|+4}+\sqrt{x^{2}+2 \sqrt{3} \cdot|x|+12}
$$
as well as the values of $x$ at which it is achieved. | "[\"2 \\\\sqrt{7}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7149, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 8, "DeepSeek-R1-Distill-Qwen-32B": 2, "DeepSeek-R1-Distill-Qwen-7B": 6}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20919"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{20}{3}"
] | [
"skywork"
] | daa7f1bd6173984220193291262c5fdd4026d95f88f331b6d912a3f4ef36ff5b | [
{
"content": "10.054. Based on an isosceles triangle with a base equal to 8 cm, a circle is constructed on the base as a chord, touching the lateral sides of the triangle (Fig. 10.54). Find the radius of the circle if the length of the height drawn to the base of the triangle is 3 cm.",
"role": "user"
}
] | 10.054. Based on an isosceles triangle with a base equal to 8 cm, a circle is constructed on the base as a chord, touching the lateral sides of the triangle (Fig. 10.54). Find the radius of the circle if the length of the height drawn to the base of the triangle is 3 cm. | "[\"\\\\frac{20}{3}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7158, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 6, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20920"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"420"
] | [
"skywork"
] | 1ae2eeff6891eee8be8f7e903651c142410d3d0a0cd447f085cbe051d60679d3 | [
{
"content": "Determine the number of ways to arrange the letters of the word SUCCESS.",
"role": "user"
}
] | Determine the number of ways to arrange the letters of the word SUCCESS. | "[\"420\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7167, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20921"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"4\\sqrt{7}+4"
] | [
"skywork"
] | 41a4f8a9d0c7f4e42d5dddb7ff706db69fff4e90b55df53ef95926ab60f9a8c1 | [
{
"content": "If the non-negative real numbers $x$ and $y$ satisfy $x^{2}+4y^{2}+4xy+4x^{2}y^{2}=32$, find the minimum value of $x+2y$, and the maximum value of $\\sqrt{7}(x+2y)+2xy$.",
"role": "user"
}
] | If the non-negative real numbers $x$ and $y$ satisfy $x^{2}+4y^{2}+4xy+4x^{2}y^{2}=32$, find the minimum value of $x+2y$, and the maximum value of $\sqrt{7}(x+2y)+2xy$. | "[\"4\\\\sqrt{7}+4\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7151, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20922"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"1"
] | [
"skywork"
] | dfe244dc6beb36f1d4be7fcf5f3636196fdf2edbacd227566e2d19a125fda408 | [
{
"content": "[ Inequalities Problems. Case Analysis]\n\n9 kg of candies cost less than 10 rubles, and 10 kg of the same candies cost more than 11 rubles. How much does 1 kg of these candies cost?",
"role": "user"
}
] | [ Inequalities Problems. Case Analysis]
9 kg of candies cost less than 10 rubles, and 10 kg of the same candies cost more than 11 rubles. How much does 1 kg of these candies cost? | "[\"1\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7146, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 14, "DeepSeek-R1-Distill-Qwen-32B": 12, "DeepSeek-R1-Distill-Qwen-7B": 12}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20923"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"6057"
] | [
"skywork"
] | 33fb58d47351dac8442fbe71d6b3486ad82a2e4dda4d5d1c92b5e2ac95a12e26 | [
{
"content": "3. For any pair of numbers, a certain operation «*» is defined, satisfying the following properties: $\\quad a *(b * c)=(a * b) \\cdot c$ and $a * a=1$, where the operation «$\\cdot$» is the multiplication operation. Find the root $x$ of the equation: $\\quad x * 3=2019$.",
"role": "user"
}
... | 3. For any pair of numbers, a certain operation «*» is defined, satisfying the following properties: $\quad a *(b * c)=(a * b) \cdot c$ and $a * a=1$, where the operation «$\cdot$» is the multiplication operation. Find the root $x$ of the equation: $\quad x * 3=2019$. | "[\"6057\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7141, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 8, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 5}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20924"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"20"
] | [
"skywork"
] | 5471885938bf519f6c34e2f7d5ddc7f71e6527c2f26d1cc16f21f510794a52db | [
{
"content": "What is the value of $\\frac{550+50}{5^{2}+5}$ ?\n(A) 32\n(B) 40\n(C) 12\n(D) 65\n(E) 20",
"role": "user"
}
] | What is the value of $\frac{550+50}{5^{2}+5}$ ?
(A) 32
(B) 40
(C) 12
(D) 65
(E) 20 | "[\"20\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7169, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 3, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20925"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{32}{7}"
] | [
"skywork"
] | aeae5aa5449dc13fe07726690813c1b85bba4152aab359b90b515ca0db7ab967 | [
{
"content": "There is a grid of height 2 stretching infinitely in one direction. Between any two edge-adjacent cells of the grid, there is a door that is locked with probability $\\frac{1}{2}$ independent of all other doors. Philip starts in a corner of the grid (in the starred cell). Compute the expected numb... | There is a grid of height 2 stretching infinitely in one direction. Between any two edge-adjacent cells of the grid, there is a door that is locked with probability $\frac{1}{2}$ independent of all other doors. Philip starts in a corner of the grid (in the starred cell). Compute the expected number of cells that Philip... | "[\"\\\\frac{32}{7}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7162, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20926"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"99\\%"
] | [
"skywork"
] | 3cd33a076e69051465ae395191d83352b7ba0a3a89c5c8c231c4ff4c3b628713 | [
{
"content": "Two machine tools, A and B, produce the same product. The products are divided into first-class and second-class according to quality. In order to compare the quality of the products produced by the two machine tools, each machine tool produced 200 products. The quality of the products is as follo... | Two machine tools, A and B, produce the same product. The products are divided into first-class and second-class according to quality. In order to compare the quality of the products produced by the two machine tools, each machine tool produced 200 products. The quality of the products is as follows:<br/>
| |... | "[\"99\\\\%\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7142, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 12, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20928"}, {"dataset": "skywork", "extra_... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"n = 3^k"
] | [
"skywork"
] | 49d7623a0ca7b28b09a309e3e11d5719f87e2f4cb5c6c741d9338cc900e3ac52 | [
{
"content": "For which positive integers $n$ can the polynomial $p(x) = 1 + x^n + x^{2n}$ is written as a product of two polynomials with integer coefficients (of degree $\\ge 1$)?",
"role": "user"
}
] | For which positive integers $n$ can the polynomial $p(x) = 1 + x^n + x^{2n}$ is written as a product of two polynomials with integer coefficients (of degree $\ge 1$)? | "[\" n = 3^k \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7170, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20930"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"8"
] | [
"skywork"
] | 0959e83075f03d1104f82c9c77d662a85e4772407563067b56e0a1da2ff0f83f | [
{
"content": "10.321. The medians of a triangle are 3, 4, and 5 cm. Find the area of the triangle.",
"role": "user"
}
] | 10.321. The medians of a triangle are 3, 4, and 5 cm. Find the area of the triangle. | "[\"8\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7181, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20931"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"a_{n}=\\frac{3}{4}n-1"
] | [
"skywork"
] | 1c26e65560d875ed1e1556d05b9841839497c3c589ed220c5b9bf87e26031ee6 | [
{
"content": "5. Given an arithmetic sequence $\\left\\{a_{n}\\right\\}$ satisfies:\n$$\na_{1}<0, a_{100} \\geqslant 74, a_{200}<200 \\text {, }\n$$\n\nand the number of terms of this sequence in the interval $\\left(\\frac{1}{2}, 8\\right)$ is 2 less than the number of terms in the interval $\\left[14, \\frac{... | 5. Given an arithmetic sequence $\left\{a_{n}\right\}$ satisfies:
$$
a_{1}<0, a_{100} \geqslant 74, a_{200}<200 \text {, }
$$
and the number of terms of this sequence in the interval $\left(\frac{1}{2}, 8\right)$ is 2 less than the number of terms in the interval $\left[14, \frac{43}{2}\right]$. Then the general term ... | "[\"a_{n}=\\\\frac{3}{4}n-1\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7171, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 8, "DeepSeek-R1-Distill-Qwen-7B": 12}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20932"}, {"dataset": "skywork", "extra_i... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"11"
] | [
"skywork"
] | 99770b0aa8150b9348e8bcd81bc5f6813122b1c64d2f18cf719e9a781427aa7b | [
{
"content": "Find the smallest number $n \\geq 5$ for which there can exist a set of $n$ people, such that any two people who are acquainted have no common acquaintances, and any two people who are not acquainted have exactly two common acquaintances.\n\n[i]Bulgaria[/i]",
"role": "user"
}
] | Find the smallest number $n \geq 5$ for which there can exist a set of $n$ people, such that any two people who are acquainted have no common acquaintances, and any two people who are not acquainted have exactly two common acquaintances.
[i]Bulgaria[/i] | "[\"11\"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7179, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 15, "DeepSeek-R1-Distill-Qwen-32B": 12, "DeepSeek-R1-Distill-Qwen-7B": 13}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20933"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"f_{n}=2n!-(n+1)"
] | [
"skywork"
] | 01c94d193b884a0994b501abff2d26661bd940aa19625fedfe8388a4b538d6f1 | [
{
"content": "Example 8 The sequence $a_{n}$ is defined as follows: $a_{1}=0, a_{2}=1$\n$$\na_{n}=\\frac{1}{2} n a_{n-1}+\\frac{1}{2} n(n-1) a_{n-2}+(-1) n\\left(1-\\frac{n}{2}\\right)(n \\geqslant 3)\n$$\n\nTry to find the simplest expression for $f_{n}=a_{n}+2 C_{n}^{1} a_{n-1}+3 C_{n}^{n} a_{n-2}+\\cdots+(n-... | Example 8 The sequence $a_{n}$ is defined as follows: $a_{1}=0, a_{2}=1$
$$
a_{n}=\frac{1}{2} n a_{n-1}+\frac{1}{2} n(n-1) a_{n-2}+(-1) n\left(1-\frac{n}{2}\right)(n \geqslant 3)
$$
Try to find the simplest expression for $f_{n}=a_{n}+2 C_{n}^{1} a_{n-1}+3 C_{n}^{n} a_{n-2}+\cdots+(n-1) C_{n}^{n-2} a_{2}+n C_{n}^{n-1}... | "[\"f_{n}=2n!-(n+1)\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7161, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 15}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20934"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"96"
] | [
"skywork"
] | 060bd70b2c540f0fcde86354a81da766df176b5da9f8969d2d2997726b19d1b3 | [
{
"content": "8. (10 points) For a two-digit number $n$, A, B, C, and D have the following conversation:\n$A: “ n$ is divisible by $2^{4}.$”\n$B: “ n$ is divisible by $3^{3}.$”\n$C:$ “ $n$ is divisible by $6^{2}.$”\n$D$ : “ The sum of the digits of $n$ is 15.”\nOnly two of them are correct. What is the value of... | 8. (10 points) For a two-digit number $n$, A, B, C, and D have the following conversation:
$A: “ n$ is divisible by $2^{4}.$”
$B: “ n$ is divisible by $3^{3}.$”
$C:$ “ $n$ is divisible by $6^{2}.$”
$D$ : “ The sum of the digits of $n$ is 15.”
Only two of them are correct. What is the value of $n$? $\qquad$ | "[\"96\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7160, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20935"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"-1"
] | [
"skywork"
] | 21cb01a91b8dc190c857cd4e153621f9c3f240cb49cd7f180fd8ec0ab5ad1ac2 | [
{
"content": "Given \\( f(x) = \\sum_{k=1}^{2017} \\frac{\\cos k x}{\\cos^k x} \\), find \\( f\\left(\\frac{\\pi}{2018}\\right) \\).",
"role": "user"
}
] | Given \( f(x) = \sum_{k=1}^{2017} \frac{\cos k x}{\cos^k x} \), find \( f\left(\frac{\pi}{2018}\right) \). | "[\"-1\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7175, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 14, "DeepSeek-R1-Distill-Qwen-32B": 2, "DeepSeek-R1-Distill-Qwen-7B": 5}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20936"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{100}{101}"
] | [
"skywork"
] | 72f7dea7e7c113eee50a563152a1aef5d94c01cc6e04fe983755df7820813d29 | [
{
"content": "Let $n!=n\\cdot (n-1)\\cdot (n-2)\\cdot \\ldots \\cdot 2\\cdot 1$.For example, $5! = 5\\cdot 4\\cdot 3 \\cdot 2\\cdot 1 = 120.$ Compute $\\frac{(6!)^2}{5!\\cdot 7!}$.",
"role": "user"
}
] | Let $n!=n\cdot (n-1)\cdot (n-2)\cdot \ldots \cdot 2\cdot 1$.For example, $5! = 5\cdot 4\cdot 3 \cdot 2\cdot 1 = 120.$ Compute $\frac{(6!)^2}{5!\cdot 7!}$. | "[\"\\\\frac{100}{101}\"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7186, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20937"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"1- \\dfrac { \\sqrt {3}\\pi}{24}"
] | [
"skywork"
] | eea83df470b4caa9872be52251d4ce8097c091d07a6a8cef4bc5054e5f0ea7b1 | [
{
"content": "Given an ant crawling inside an equilateral triangle with side length $4$, calculate the probability that the distance from the ant to all three vertices of the triangle is more than $1$.",
"role": "user"
}
] | Given an ant crawling inside an equilateral triangle with side length $4$, calculate the probability that the distance from the ant to all three vertices of the triangle is more than $1$. | "[\"1- \\\\dfrac { \\\\sqrt {3}\\\\pi}{24}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7174, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20938"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"45"
] | [
"skywork"
] | a59718d2f1989601d1577f33b3780550a7049e70602e0b42b3506609d57acafd | [
{
"content": "In the tetrahedron $P-ABC$, $\\angle APB=\\angle BPC=\\angle CPA=90^{\\circ}$, $M$ is a point within the base $ABC$, $\\angle APM=\\alpha, \\angle BPM=\\beta, \\sin \\alpha=\\frac{\\sqrt{6}}{3}, \\cos \\beta=\\frac{\\sqrt{6}}{6}$, then the value of $\\angle CPM$ is\nA. $30^{\\circ}$\nB. $45^{\\cir... | In the tetrahedron $P-ABC$, $\angle APB=\angle BPC=\angle CPA=90^{\circ}$, $M$ is a point within the base $ABC$, $\angle APM=\alpha, \angle BPM=\beta, \sin \alpha=\frac{\sqrt{6}}{3}, \cos \beta=\frac{\sqrt{6}}{6}$, then the value of $\angle CPM$ is
A. $30^{\circ}$
B. $45^{\circ}$
C. $60^{\circ}$
D. $75^{\circ}$ | "[\"45\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7159, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20939"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"35"
] | [
"skywork"
] | 289dfe46bfaa8857daa608d9ec5456e50772b7aadda69911b9b683c1780ef63b | [
{
"content": "18.4.3 $\\star \\star$ A positive integer $n$ is not divisible by $2$ or $3$, and there do not exist non-negative integers $a$, $b$ such that $\\left|2^{a}-3^{b}\\right|=n$. Find the minimum value of $n$.",
"role": "user"
}
] | 18.4.3 $\star \star$ A positive integer $n$ is not divisible by $2$ or $3$, and there do not exist non-negative integers $a$, $b$ such that $\left|2^{a}-3^{b}\right|=n$. Find the minimum value of $n$. | "[\"35\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7177, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 13, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 4}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20940"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"2013"
] | [
"skywork"
] | 6c9e43e574393b9ca1f2d5ba614d15f68284a72188ea470cb2654ac969e52455 | [
{
"content": "A configuration of $4027$ points in the plane is called Colombian if it consists of $2013$ red points and $2014$ blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a... | A configuration of $4027$ points in the plane is called Colombian if it consists of $2013$ red points and $2014$ blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a Colombian configurati... | "[\"2013\"]" | train-math-still3 | [{"dataset": "skywork", "extra_info": {"index": 7173, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 8, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20941"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"56"
] | [
"skywork"
] | 58cc7beade1527831b718c55a7fa6c6619ca47a217bdc8513185b18b5004ed19 | [
{
"content": "From the set $\\{1, 2, \\cdots, 20\\}$, choose 5 numbers such that the difference between any two numbers is at least 4. How many different ways can this be done?",
"role": "user"
}
] | From the set $\{1, 2, \cdots, 20\}$, choose 5 numbers such that the difference between any two numbers is at least 4. How many different ways can this be done? | "[\"56\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7185, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20942"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"-\\frac{16}{17}"
] | [
"skywork"
] | 9bdaace732941b13a7adcc6a46029c90e7f50a54e4306c7f1293b495fa212e8f | [
{
"content": "Simplify\n\\[\\frac{3 + 5i}{3 - 5i} + \\frac{3 - 5i}{3 + 5i}.\\]",
"role": "user"
}
] | Simplify
\[\frac{3 + 5i}{3 - 5i} + \frac{3 - 5i}{3 + 5i}.\] | "[\"-\\\\frac{16}{17}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7192, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20944"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"p=2/3,q=-8/3"
] | [
"skywork"
] | fec9508d4f8172eefde911d9a78283cd5cdd9ce3620b568ee5a6bd18b287ecb1 | [
{
"content": "For what $p$ and $q$ does the equation $x^{2}+p x+q=0$ satisfy two distinct numbers $2 p$ and $p+q$?",
"role": "user"
}
] | For what $p$ and $q$ does the equation $x^{2}+p x+q=0$ satisfy two distinct numbers $2 p$ and $p+q$? | "[\"p=2/3,q=-8/3\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7180, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 3, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20945"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"29"
] | [
"skywork"
] | ef0f0b224df68c7243631845fa06c48123fc6e8807cfeef28e2d616cf0cf69b1 | [
{
"content": "3. In a certain basketball tournament, Xiao Ming played 10 games. In the 6th, 7th, 8th, and 9th games, he scored 23 points, 14 points, 11 points, and 20 points, respectively. His average score in the first 9 games was higher than his average score in the first 5 games. If the average score of the ... | 3. In a certain basketball tournament, Xiao Ming played 10 games. In the 6th, 7th, 8th, and 9th games, he scored 23 points, 14 points, 11 points, and 20 points, respectively. His average score in the first 9 games was higher than his average score in the first 5 games. If the average score of the 10 games he played exc... | "[\"29\"]" | train-math-numinamath1.5_cn_contest | [{"dataset": "skywork", "extra_info": {"index": 7156, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 7, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20946"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"85"
] | [
"skywork"
] | fced0451a33a297bc2e07ddaa1b2081b37a463910d9d4276dda01f6329728452 | [
{
"content": "6. $\\left(\\frac{1}{3}+\\frac{1}{6}+\\frac{1}{12}+\\frac{1}{24}+\\frac{1}{48}+\\frac{1}{96}+\\frac{1}{192}+\\frac{1}{384}\\right) \\times 128=$ .",
"role": "user"
}
] | 6. $\left(\frac{1}{3}+\frac{1}{6}+\frac{1}{12}+\frac{1}{24}+\frac{1}{48}+\frac{1}{96}+\frac{1}{192}+\frac{1}{384}\right) \times 128=$ . | "[\"85\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7198, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 3, "DeepSeek-R1-Distill-Qwen-7B": 4}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20947"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"1018"
] | [
"skywork"
] | 1c8e41e24e08ee3a3edf7bc355243249c4cb433ea8edd907f725bf65852fa795 | [
{
"content": "Natural numbers \\(a, b, c\\) are chosen such that \\(a < b < c\\). It is also known that the system of equations \\(2x + y = 2035\\) and \\(y = |x - a| + |x - b| + |x - c|\\) has exactly one solution. Find the minimum possible value of \\(c\\).",
"role": "user"
}
] | Natural numbers \(a, b, c\) are chosen such that \(a < b < c\). It is also known that the system of equations \(2x + y = 2035\) and \(y = |x - a| + |x - b| + |x - c|\) has exactly one solution. Find the minimum possible value of \(c\). | "[\"1018\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7178, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 10, "DeepSeek-R1-Distill-Qwen-32B": 6, "DeepSeek-R1-Distill-Qwen-7B": 4}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20948"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"230"
] | [
"skywork"
] | ca3c1b0e563ff44a0933d9fe31c0fd3464f0c424340d41c71ba1b61a3b97fcc2 | [
{
"content": "A four-element set $\\{a, b, c, d\\}$ of positive integers is called [i]good[/i] if there are two of them such that their product is a mutiple of the greatest common divisor of the remaining two. For example, the set $\\{2, 4, 6, 8\\}$ is good since the greatest common divisor of $2$ and $6$ is $2... | A four-element set $\{a, b, c, d\}$ of positive integers is called [i]good[/i] if there are two of them such that their product is a mutiple of the greatest common divisor of the remaining two. For example, the set $\{2, 4, 6, 8\}$ is good since the greatest common divisor of $2$ and $6$ is $2$, and it divides $4\times... | "[\"230\"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7183, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20949"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{4}{11}"
] | [
"skywork"
] | 0b559e79e522be6cdbd473ce419908d5d3217f8aaf424b9c86a8bed69dc02857 | [
{
"content": "At a community gathering there are only single women and married men with their wives. The probability that a randomly selected woman is single is $\\frac{3}{7}$. Calculate the fraction of the people in the gathering who are married men.",
"role": "user"
}
] | At a community gathering there are only single women and married men with their wives. The probability that a randomly selected woman is single is $\frac{3}{7}$. Calculate the fraction of the people in the gathering who are married men. | "[\"\\\\frac{4}{11}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7168, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20950"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"18"
] | [
"skywork"
] | 871bdc75c30c40597f929c6ead863ca09383e0694b476750a92e30c958d94b51 | [
{
"content": "Let $P(x)=x^3+ax^2+bx+c$ be a polynomial where $a,b,c$ are integers and $c$ is odd. Let $p_{i}$ be the value of $P(x)$ at $x=i$. Given that $p_{1}^3+p_{2}^{3}+p_{3}^{3}=3p_{1}p_{2}p_{3}$, find the value of $p_{2}+2p_{1}-3p_{0}.$",
"role": "user"
}
] | Let $P(x)=x^3+ax^2+bx+c$ be a polynomial where $a,b,c$ are integers and $c$ is odd. Let $p_{i}$ be the value of $P(x)$ at $x=i$. Given that $p_{1}^3+p_{2}^{3}+p_{3}^{3}=3p_{1}p_{2}p_{3}$, find the value of $p_{2}+2p_{1}-3p_{0}.$ | "[\"18\"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7153, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 7, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 2}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20951"}, {"dataset": "skywork", "extra_inf... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"8"
] | [
"skywork"
] | 771233ed2c0b71e1fb95f8510a9ba4a7c915601dab933b795d7be023b93d857e | [
{
"content": "Carlinhos likes to write numbers in his notebook. One day he wrote the numbers from 1 to 999, one after the other, to form the giant number:\n\n$$\n123456789101112 \\ldots 997998999\n$$\n\nAbout this number, the following questions are asked:\n\n(a) How many digits were written?\n\n(b) How many ti... | Carlinhos likes to write numbers in his notebook. One day he wrote the numbers from 1 to 999, one after the other, to form the giant number:
$$
123456789101112 \ldots 997998999
$$
About this number, the following questions are asked:
(a) How many digits were written?
(b) How many times does the digit 1 appear?
(c)... | "[\"8\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7176, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 10, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20952"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"5"
] | [
"skywork"
] | a0ea52853be464dc60724d3713a444b41b8356328cb1da71bb6f83693dc5c538 | [
{
"content": "[ $\\quad \\underline{\\text { Tangents to Spheres }}$]\n\nIn a regular hexagonal pyramid $\\operatorname{SABCDEF}$ ( $S$ - apex) the side of the base is $2 \\sqrt{3}$, and the height of the pyramid $S H$ is 6. A plane passes through point $E$ perpendicular to line $A S$ and intersects segment $S ... | [ $\quad \underline{\text { Tangents to Spheres }}$]
In a regular hexagonal pyramid $\operatorname{SABCDEF}$ ( $S$ - apex) the side of the base is $2 \sqrt{3}$, and the height of the pyramid $S H$ is 6. A plane passes through point $E$ perpendicular to line $A S$ and intersects segment $S H$ at point $O$. Points $P$ a... | "[\"5\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7182, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 14, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20953"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"|a| \\leq 2"
] | [
"skywork"
] | f3459a7449778083423dc83ecb59b14282040df8c70a0f8d5641cb14e07941ae | [
{
"content": "Find all reals $a$ such that the sequence $\\{x(n)\\}$, $n=0,1,2, \\ldots$ that satisfy: $x(0)=1996$ and $x_{n+1} = \\frac{a}{1+x(n)^2}$ for any natural number $n$ has a limit as n goes to infinity.",
"role": "user"
}
] | Find all reals $a$ such that the sequence $\{x(n)\}$, $n=0,1,2, \ldots$ that satisfy: $x(0)=1996$ and $x_{n+1} = \frac{a}{1+x(n)^2}$ for any natural number $n$ has a limit as n goes to infinity. | "[\" |a| \\\\leq 2 \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7187, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 7, "DeepSeek-R1-Distill-Qwen-7B": 14}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20954"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"2"
] | [
"skywork"
] | 4e1e264eb244ec6e7e67f38f0c489cded3b337b6cef7581abbfe234a0cd32cad | [
{
"content": "## Task B-3.1.\n\nDetermine the value of the expression $A=1+\\operatorname{tg} 35^{\\circ}+\\operatorname{tg} 10^{\\circ}+\\operatorname{tg} 35^{\\circ} \\cdot \\operatorname{tg} 10^{\\circ}$.",
"role": "user"
}
] | ## Task B-3.1.
Determine the value of the expression $A=1+\operatorname{tg} 35^{\circ}+\operatorname{tg} 10^{\circ}+\operatorname{tg} 35^{\circ} \cdot \operatorname{tg} 10^{\circ}$. | "[\"2\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7205, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20955"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"v\\geqslant1+\\sqrt{2}"
] | [
"skywork"
] | 0799a76096d9c6ab875ef195731dc619d348aaf9e0900da626bb10da3d6afb62 | [
{
"content": "A player on a computer controls a fox hunting two rabbits. At vertex $A$ of the square $A B C D$ there is a burrow: if at least one rabbit gets into it in the absence of the fox, the game is lost. The fox catches a rabbit as soon as it is in the same point (possibly at point $A$). Initially, the f... | A player on a computer controls a fox hunting two rabbits. At vertex $A$ of the square $A B C D$ there is a burrow: if at least one rabbit gets into it in the absence of the fox, the game is lost. The fox catches a rabbit as soon as it is in the same point (possibly at point $A$). Initially, the fox is at point $C$, an... | "[\"v\\\\geqslant1+\\\\sqrt{2}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7166, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20956"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"8"
] | [
"skywork"
] | 0a74f581f8d3793d0370ca93fd17cc788cdf7e08a4a6a462b387a612fe800352 | [
{
"content": "How many triples $(a, b, c)$ of positive integers satisfy the conditions $6 a b=c^{2}$ and $a<b<c \\leq 35$ ?\n(A) 10\n(B) 8\n(C) 6\n(D) 7\n(E) 9",
"role": "user"
}
] | How many triples $(a, b, c)$ of positive integers satisfy the conditions $6 a b=c^{2}$ and $a<b<c \leq 35$ ?
(A) 10
(B) 8
(C) 6
(D) 7
(E) 9 | "[\"8\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7201, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20957"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{1}{2}"
] | [
"skywork"
] | b385714c29054f2dfacae899902ef34cf45a34a9f0ed67d16e703d04095efffb | [
{
"content": "9. (16 points) Given $a \\in \\mathbf{R}_{+}$, the equation\n$$\nx^{2}-2 a x-2 a \\ln x=0\n$$\n\nhas a unique solution in $(0,+\\infty)$. Find the value of $a$.",
"role": "user"
}
] | 9. (16 points) Given $a \in \mathbf{R}_{+}$, the equation
$$
x^{2}-2 a x-2 a \ln x=0
$$
has a unique solution in $(0,+\infty)$. Find the value of $a$. | "[\"\\\\frac{1}{2}\"]" | train-math-numinamath1.5_cn_contest | [{"dataset": "skywork", "extra_info": {"index": 7203, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20958"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"25"
] | [
"skywork"
] | 748a6e9f0c060ae7f464dd003764e3a6e247dda7a5a06f49e92f8ce85dfa23b4 | [
{
"content": "Compute the smallest positive integer $k$ such that 49 divides $\\binom{2 k}{k}$.",
"role": "user"
}
] | Compute the smallest positive integer $k$ such that 49 divides $\binom{2 k}{k}$. | "[\"25\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7207, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 14, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20959"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"40"
] | [
"skywork"
] | 1f610f366174395baa64871fed87897292e250da586fa4a707aa165aa7a2368d | [
{
"content": "6. Let $[x]$ denote the greatest integer not exceeding the real number $x$ (for example, $[3.14]=3, [0]=0, [-3.14]=-4$). If a positive integer $x$ satisfies $x-[\\sqrt{x}]^{2}=9$, then $x$ is called a \"good number\". Then, among the 2014 positive integers from $1$ to $2014$, the number of good nu... | 6. Let $[x]$ denote the greatest integer not exceeding the real number $x$ (for example, $[3.14]=3, [0]=0, [-3.14]=-4$). If a positive integer $x$ satisfies $x-[\sqrt{x}]^{2}=9$, then $x$ is called a "good number". Then, among the 2014 positive integers from $1$ to $2014$, the number of good numbers is $(\quad)$.
(A) 3... | "[\"40\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7184, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20960"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"6"
] | [
"skywork"
] | 67c62877081a4086e132638186f8c515896f6116f79cbb5f67f665ed08017cce | [
{
"content": "A chess team has $26$ members. However, only $16$ members attended the last meeting: half of the girls attended but all of the boys attended. How many boys are on the chess team?",
"role": "user"
}
] | A chess team has $26$ members. However, only $16$ members attended the last meeting: half of the girls attended but all of the boys attended. How many boys are on the chess team? | "[\"6\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7195, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20961"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"25"
] | [
"skywork"
] | 6d3f0ec8c3d97c0858e6d48c31fe3c80af06fce2e93163d49f0be6bfeddf7d0b | [
{
"content": "From an external point $A$, a tangent $A B$ and a secant $A C D$ are drawn to a circle. Find the area of triangle $C B D$, if $A C: A B=2: 3$ and the area of triangle $A B C$ is 20.",
"role": "user"
}
] | From an external point $A$, a tangent $A B$ and a secant $A C D$ are drawn to a circle. Find the area of triangle $C B D$, if $A C: A B=2: 3$ and the area of triangle $A B C$ is 20. | "[\"25\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7200, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 10, "DeepSeek-R1-Distill-Qwen-32B": 8, "DeepSeek-R1-Distill-Qwen-7B": 6}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20962"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"287"
] | [
"skywork"
] | 63b52cec91cf4e553dc20c1d87c9a48f6bdc2c04033a513e619aa4b33b04b18c | [
{
"content": "1. (8 points) Calculate $(235-2 \\times 3 \\times 5) \\times 7 \\div 5=$",
"role": "user"
}
] | 1. (8 points) Calculate $(235-2 \times 3 \times 5) \times 7 \div 5=$ | "[\"287\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7212, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20964"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"12"
] | [
"skywork"
] | 8fb0772c94d3cdf08e9837586cc497ba1abf7fc4ff7c37936802ae372b8fddac | [
{
"content": "Ana and Bonita were born on the same date in different years, $n$ years apart. Last year Ana was $5$ times as old as Bonita. This year Ana's age is the square of Bonita's age. What is $n?$",
"role": "user"
}
] | Ana and Bonita were born on the same date in different years, $n$ years apart. Last year Ana was $5$ times as old as Bonita. This year Ana's age is the square of Bonita's age. What is $n?$ | "[\"12\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7189, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20965"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"2015028"
] | [
"skywork"
] | 596a171f6acfa586d4bdfddd1a877a65a0768165c05f30221566a8df75985e50 | [
{
"content": "10. Let $[x]$ denote the greatest integer not exceeding the real number $x$. Then the value of $\\sum_{k=1}^{2008}\\left[\\frac{2008 k}{2009}\\right]$ is $\\qquad$ .",
"role": "user"
}
] | 10. Let $[x]$ denote the greatest integer not exceeding the real number $x$. Then the value of $\sum_{k=1}^{2008}\left[\frac{2008 k}{2009}\right]$ is $\qquad$ . | "[\"2015028\"]" | train-math-numinamath1.5_cn_contest | [{"dataset": "skywork", "extra_info": {"index": 7211, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20966"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{2046\\pi}{2047}"
] | [
"skywork"
] | 4fa2ec6782cf46a721d4f7a480f8e5b61f160e5bf61e8c7e86a7864620069dcf | [
{
"content": "For $\\theta<\\pi$, find the maximum real number $\\theta$ such that\n$$\n\\prod_{k=0}^{10} \\cos 2^{k} \\theta \\neq 0, \\prod_{k=0}^{10}\\left(1+\\frac{1}{\\cos 2^{k} \\theta}\\right)=1\n$$",
"role": "user"
}
] | For $\theta<\pi$, find the maximum real number $\theta$ such that
$$
\prod_{k=0}^{10} \cos 2^{k} \theta \neq 0, \prod_{k=0}^{10}\left(1+\frac{1}{\cos 2^{k} \theta}\right)=1
$$ | "[\"\\\\frac{2046\\\\pi}{2047}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7199, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 14, "DeepSeek-R1-Distill-Qwen-32B": 6, "DeepSeek-R1-Distill-Qwen-7B": 14}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20967"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"12\\pi\\mathrm{}"
] | [
"skywork"
] | 5d19db2112730c7c70eda2f6fbfb26dc4a9065f5ef74be76312e20ea4ad8392a | [
{
"content": "## Zadatak B-2.5.\n\nDuljine stranica trokuta $A B C$ su $|A B|=13,|B C|=14$ i $|A C|=15$. Izračunajte opseg kružnice koja dodiruje stranice $\\overline{A B}$ i $\\overline{A C}$, a središte joj je na pravcu $B C$.",
"role": "user"
}
] | ## Zadatak B-2.5.
Duljine stranica trokuta $A B C$ su $|A B|=13,|B C|=14$ i $|A C|=15$. Izračunajte opseg kružnice koja dodiruje stranice $\overline{A B}$ i $\overline{A C}$, a središte joj je na pravcu $B C$. | "[\"12\\\\pi\\\\mathrm{}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7209, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20968"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{21}{4}"
] | [
"skywork"
] | 978c962bd8da95a1be607fc1417b30b72c689a01353aa354708041e315b16cc4 | [
{
"content": "[ Area and orthogonal projection ]\n\nFind the area of the section of a regular triangular prism ABCA1B1C1 by a plane passing through vertex C and the midpoint of side B1C1 of the base A1B1C1, and parallel to the diagonal AC1 of the lateral face AA1C1C, if the distance between the line AC1 and the... | [ Area and orthogonal projection ]
Find the area of the section of a regular triangular prism ABCA1B1C1 by a plane passing through vertex C and the midpoint of side B1C1 of the base A1B1C1, and parallel to the diagonal AC1 of the lateral face AA1C1C, if the distance between the line AC1 and the cutting plane is 1, and... | "[\"\\\\frac{21}{4}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7193, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 5, "DeepSeek-R1-Distill-Qwen-7B": 13}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20969"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{2}{3}"
] | [
"skywork"
] | 0c6af22d1eb7884c74a5c592122ae12eca6e481e90acc8a5ceb9e040dd7155d8 | [
{
"content": "6. A triangular piece of paper of area 1 is folded along a line parallel to one of the sides and pressed flat. What is the minimum possible area of the resulting figure?",
"role": "user"
}
] | 6. A triangular piece of paper of area 1 is folded along a line parallel to one of the sides and pressed flat. What is the minimum possible area of the resulting figure? | "[\"\\\\frac{2}{3}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7196, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 11, "DeepSeek-R1-Distill-Qwen-7B": 7}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20970"}, {"dataset": "skywork", "extra_i... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"144"
] | [
"skywork"
] | 0c17252a89b102742434266981f7b0ed96bd3ee64ee049ee62a00eefa540b7d4 | [
{
"content": "I4.1 Suppose the 9-digit number $\\overline{32 x 35717 y}$ is a multiple of 72 , and $P=x y$, find the value of $P$.\nI4.2 Given that the lines $4 x+y=\\frac{P}{3}, m x+y=0$ and $2 x-3 m y=4$ cannot form a triangle. Suppose that $m>0$ and $Q$ is the minimum possible value of $m$, find $Q$.\n\nI4.3... | I4.1 Suppose the 9-digit number $\overline{32 x 35717 y}$ is a multiple of 72 , and $P=x y$, find the value of $P$.
I4.2 Given that the lines $4 x+y=\frac{P}{3}, m x+y=0$ and $2 x-3 m y=4$ cannot form a triangle. Suppose that $m>0$ and $Q$ is the minimum possible value of $m$, find $Q$.
I4.3 Given that $R, x, y, z$ ar... | "[\"144\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7096, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 15}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20971"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"2016"
] | [
"skywork"
] | 62db6f249f3132bb85b1fb417d5c285cc0289e648d64affd9dcf68bf44ccc548 | [
{
"content": "In a country with $n$ cities, all direct airlines are two-way. There are $r>2014$ 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$.",
"rol... | In a country with $n$ cities, all direct airlines are two-way. There are $r>2014$ 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$. | "[\"2016\"]" | train-math-numinamath1.5_olympiads_ref | [{"dataset": "skywork", "extra_info": {"index": 7165, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 15, "DeepSeek-R1-Distill-Qwen-32B": 11, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20972"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{4}{3}"
] | [
"skywork"
] | 3f24afbdc63e26bea0b9f6952b3f0b1bd3071b30d36c0ec6564dd86acb384d78 | [
{
"content": "Example 4. Calculate the double integral $I=\\iint_{D} y^{2} \\sin x d x d y$, where $D$ is the region bounded by the lines $x=0, x=\\pi, y=0, y=1+\\cos x$.",
"role": "user"
}
] | Example 4. Calculate the double integral $I=\iint_{D} y^{2} \sin x d x d y$, where $D$ is the region bounded by the lines $x=0, x=\pi, y=0, y=1+\cos x$. | "[\"\\\\frac{4}{3}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7213, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20973"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{38\\sqrt{5}}{5}"
] | [
"skywork"
] | bf5c37a26565f17b4b89e8385bf16670f1050e35ca8ac41abbe2ef3c75955a53 | [
{
"content": "In a regular quadrilateral frustum with lateral edges \\(A A_{1}, B B_{1}, C C_{1}, D D_{1}\\), the side length of the upper base \\(A_{1} B_{1} C_{1} D_{1}\\) is 1, and the side length of the lower base is 7. A plane passing through the edge \\(B_{1} C_{1}\\) perpendicular to the plane \\(A D_{1}... | In a regular quadrilateral frustum with lateral edges \(A A_{1}, B B_{1}, C C_{1}, D D_{1}\), the side length of the upper base \(A_{1} B_{1} C_{1} D_{1}\) is 1, and the side length of the lower base is 7. A plane passing through the edge \(B_{1} C_{1}\) perpendicular to the plane \(A D_{1} C\) divides the frustum into... | "[\"\\\\frac{38\\\\sqrt{5}}{5}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7197, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 13, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20974"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{(AC+BC)(1+\\sqrt{2})}{2}"
] | [
"skywork"
] | 3cc51af7b1b49cb5b091b17657649c313f3b540faab2ca70a88c1d15edfd0c39 | [
{
"content": "In triangle $ABC$, the lengths of sides $AC$ and $BC$ are fixed, while the angle at $C$ varies. The midpoint of side $AC$ is $M$, the midpoint of side $BC$ is $N$, and the center of the square constructed outward on side $AB$ is $O$. How should the angle $ACB$ be chosen so that the sum of the dist... | In triangle $ABC$, the lengths of sides $AC$ and $BC$ are fixed, while the angle at $C$ varies. The midpoint of side $AC$ is $M$, the midpoint of side $BC$ is $N$, and the center of the square constructed outward on side $AB$ is $O$. How should the angle $ACB$ be chosen so that the sum of the distances $OM$ and $ON$ is... | "[\"\\\\frac{(AC+BC)(1+\\\\sqrt{2})}{2}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7191, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20975"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"555"
] | [
"skywork"
] | 689929a879a338e7e9a4860695e80ad1ea9073713cffef16941ba94a3ce3fa29 | [
{
"content": "【Question 16】\nA chessboard has 13 rows and 17 columns, with each small square containing a number. Starting from the top left corner, the first row is sequentially $1,2, \\cdots, 17$; the second row is sequentially $18,19, \\cdots, 34 ; \\cdots$ until the last row. Now, the numbers on this chessb... | 【Question 16】
A chessboard has 13 rows and 17 columns, with each small square containing a number. Starting from the top left corner, the first row is sequentially $1,2, \cdots, 17$; the second row is sequentially $18,19, \cdots, 34 ; \cdots$ until the last row. Now, the numbers on this chessboard are rewritten, starti... | "[\"555\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7194, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 4, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20976"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"60.5"
] | [
"skywork"
] | 5a75751e27273874c3abaa79f5a69de55c50a6d086dd79ef35deca6e4b96a748 | [
{
"content": "14. As shown in the figure, in square $A B C D$, the area of square $A M O P$ is 8 square centimeters, and the area of square $C N O Q$ is 24.5 square centimeters. What is the area of square $A B C D$ in square centimeters?",
"role": "user"
}
] | 14. As shown in the figure, in square $A B C D$, the area of square $A M O P$ is 8 square centimeters, and the area of square $C N O Q$ is 24.5 square centimeters. What is the area of square $A B C D$ in square centimeters? | "[\"60.5\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7190, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 7, "DeepSeek-R1-Distill-Qwen-32B": 3, "DeepSeek-R1-Distill-Qwen-7B": 2}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20977"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"16"
] | [
"skywork"
] | 9b9b145a248ba7aa41a2491f2c807eecbb38601a287b3f2aeeeb6f72480daf2c | [
{
"content": "Problem 2. A group of adventurers is showing off their loot. It is known that exactly 5 adventurers have rubies; exactly 11 have emeralds; exactly 10 have sapphires; exactly 6 have diamonds. In addition, it is known that\n\n- if an adventurer has diamonds, then they have either emeralds or sapphir... | Problem 2. A group of adventurers is showing off their loot. It is known that exactly 5 adventurers have rubies; exactly 11 have emeralds; exactly 10 have sapphires; exactly 6 have diamonds. In addition, it is known that
- if an adventurer has diamonds, then they have either emeralds or sapphires (but not both at the ... | "[\"16\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7206, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 13, "DeepSeek-R1-Distill-Qwen-32B": 4, "DeepSeek-R1-Distill-Qwen-7B": 13}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20978"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\mbox{four}"
] | [
"skywork"
] | d1a81dce6f90fb0dc913aa432b83421641807f6fe2f86f44afc809aba732a4d8 | [
{
"content": "How many positive integers, including $1,$ are divisors of both $40$ and $72?$",
"role": "user"
}
] | How many positive integers, including $1,$ are divisors of both $40$ and $72?$ | "[\"\\\\mbox{four}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7223, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20979"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"560"
] | [
"skywork"
] | 61962134ccb14c25989267067b99d95f912b6512ddb2ec3eea25414925e705b3 | [
{
"content": "In a shooting match, eight clay targets are arranged in two hanging columns of three targets each and one column of two targets. A marksman is to break all the targets according to the following rules:\n1) The marksman first chooses a column from which a target is to be broken.\n2) The marksman mu... | In a shooting match, eight clay targets are arranged in two hanging columns of three targets each and one column of two targets. A marksman is to break all the targets according to the following rules:
1) The marksman first chooses a column from which a target is to be broken.
2) The marksman must then break the lowest... | "[\"560\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7215, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20980"}, {"dataset": "skywork", "extra_inf... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"256"
] | [
"skywork"
] | 7de4375a6fff04a0994e050db7d2ee0983751e371a1f1e57ab1c80f70dfcd816 | [
{
"content": "For every positive integer $k$ , let $\\mathbf{T}_k = (k(k+1), 0)$ , and define $\\mathcal{H}_k$ as the homothety centered at $\\mathbf{T}_k$ with ratio $\\tfrac{1}{2}$ if $k$ is odd and $\\tfrac{2}{3}$ is $k$ is even. Suppose $P = (x,y)$ is a point such that $$ (\\mathcal{H}_{4}... | For every positive integer $k$ , let $\mathbf{T}_k = (k(k+1), 0)$ , and define $\mathcal{H}_k$ as the homothety centered at $\mathbf{T}_k$ with ratio $\tfrac{1}{2}$ if $k$ is odd and $\tfrac{2}{3}$ is $k$ is even. Suppose $P = (x,y)$ is a point such that $$ (\mathcal{H}_{4} \circ \mathcal{H}_{3} \circ... | "[\"256\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7202, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 13, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20981"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"x > 1"
] | [
"skywork"
] | c2b6db3dc33f4c264555a5aa28ef5f30b3762bc2cedebc3990e098beef32e3fa | [
{
"content": "For which real numbers $ x>1$ is there a triangle with side lengths $ x^4\\plus{}x^3\\plus{}2x^2\\plus{}x\\plus{}1, 2x^3\\plus{}x^2\\plus{}2x\\plus{}1,$ and $ x^4\\minus{}1$?",
"role": "user"
}
] | For which real numbers $ x>1$ is there a triangle with side lengths $ x^4\plus{}x^3\plus{}2x^2\plus{}x\plus{}1, 2x^3\plus{}x^2\plus{}2x\plus{}1,$ and $ x^4\minus{}1$? | "[\" x > 1 \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7210, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20982"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"360"
] | [
"skywork"
] | 2bf4cc89971864cbf38484f45d838a8f9b490ca477caa9858bacc4babec6915e | [
{
"content": "A pyramid with volume 40 cubic inches has a rectangular base. If the length of the base is doubled, the width tripled and the height increased by $50\\%$, what is the volume of the new pyramid, in cubic inches?",
"role": "user"
}
] | A pyramid with volume 40 cubic inches has a rectangular base. If the length of the base is doubled, the width tripled and the height increased by $50\%$, what is the volume of the new pyramid, in cubic inches? | "[\"360\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7204, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20983"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"205"
] | [
"skywork"
] | a3e2dc480ea16a16d45c350f1da73e08e3a1b1a999cffa41bdf6cf51133111d4 | [
{
"content": "At the start of this month, Mathilde and Salah each had 100 coins. For Mathilde, this was $25 \\%$ more coins than she had at the start of last month. For Salah, this was $20 \\%$ fewer coins than he had at the start of last month. What was the total number of coins that they had at the start of l... | At the start of this month, Mathilde and Salah each had 100 coins. For Mathilde, this was $25 \%$ more coins than she had at the start of last month. For Salah, this was $20 \%$ fewer coins than he had at the start of last month. What was the total number of coins that they had at the start of last month? | "[\"205\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7222, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20984"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"78"
] | [
"skywork"
] | 2fd142b405435cfee7d3b5bfcba807b284c9dd8affd3f1992aa24f6b03cee2c9 | [
{
"content": "Ruxandra wants to visit Singapore, Mongolia, Bhutan, Indonesia, and Japan. In how many ways can she order her trip to visit each country exactly once, with the conditions that she cannot visit Mongolia first and cannot visit Bhutan last?",
"role": "user"
}
] | Ruxandra wants to visit Singapore, Mongolia, Bhutan, Indonesia, and Japan. In how many ways can she order her trip to visit each country exactly once, with the conditions that she cannot visit Mongolia first and cannot visit Bhutan last? | "[\"78\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7220, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20985"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"101"
] | [
"skywork"
] | d02c21ee0fa02ff0ff647549ef1b21f43e24431398568abc81099b5094f45f10 | [
{
"content": "In a company, some pairs of people are friends (if $A$ is friends with $B$, then $B$ is friends with $A$). It turns out that among every set of 100 people in the company, the number of pairs of friends is odd. Find the largest possible number of people in such a company.",
"role": "user"
}
] | In a company, some pairs of people are friends (if $A$ is friends with $B$, then $B$ is friends with $A$). It turns out that among every set of 100 people in the company, the number of pairs of friends is odd. Find the largest possible number of people in such a company. | "[\"101\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7217, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 12, "DeepSeek-R1-Distill-Qwen-32B": 9, "DeepSeek-R1-Distill-Qwen-7B": 4}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20986"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"34"
] | [
"skywork"
] | ecefefa5af06da7a666a0cd8ada7b7d03bfaaa1fdf0454fc0f32d1efb0f1123e | [
{
"content": "Problem 3. The students from $\\mathrm{IV}^{\\mathrm{a}}$ class are members of the environmental, literary, or math section. Five students are members of all three sections, and nine students are members of two sections. Eight students are members of both the environmental and literary sections, a... | Problem 3. The students from $\mathrm{IV}^{\mathrm{a}}$ class are members of the environmental, literary, or math section. Five students are members of all three sections, and nine students are members of two sections. Eight students are members of both the environmental and literary sections, and the same number are m... | "[\"34\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7216, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 3, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20987"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"9"
] | [
"skywork"
] | 2bb6b2ec699d6272bc3de2899372d4c7561c09b1401245795d7583214de65fdb | [
{
"content": "7. (10 points) $\\frac{\\frac{10}{19}-\\frac{9}{18}+\\frac{8}{17}-\\frac{7}{16}+\\frac{6}{15}-\\frac{5}{14}+\\frac{4}{13}-\\frac{3}{12}+\\frac{2}{11}-\\frac{1}{10}}{\\frac{17}{19}-\\frac{16}{18}+\\frac{15}{17}-\\frac{14}{16}+\\frac{13}{15}+\\frac{12}{13}-\\frac{11}{12}+\\frac{10}{11}-\\frac{9}{10}... | 7. (10 points) $\frac{\frac{10}{19}-\frac{9}{18}+\frac{8}{17}-\frac{7}{16}+\frac{6}{15}-\frac{5}{14}+\frac{4}{13}-\frac{3}{12}+\frac{2}{11}-\frac{1}{10}}{\frac{17}{19}-\frac{16}{18}+\frac{15}{17}-\frac{14}{16}+\frac{13}{15}+\frac{12}{13}-\frac{11}{12}+\frac{10}{11}-\frac{9}{10}}=$ | "[\"9\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7236, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20988"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"99999919"
] | [
"skywork"
] | fb1818fb63dc1de6398c188810fa5924dc1a0b151dfb6e0027bd09c765e0190c | [
{
"content": "It is given that \\( a = 103 \\times 97 \\times 10009 \\). Find \\( a \\).",
"role": "user"
}
] | It is given that \( a = 103 \times 97 \times 10009 \). Find \( a \). | "[\"99999919\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7239, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 6}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20989"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"341606288"
] | [
"skywork"
] | 931857bd2493d41c92e56920be8206ec11451ff969d641beca0b91dd2236b97f | [
{
"content": "$2017$ chess players participated in the chess tournament, each of them played exactly one chess game with each other. Let's call a trio of chess players $A, B, C$ a [i]principled [/i]one, if $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. What is the largest possible number of threes of... | $2017$ chess players participated in the chess tournament, each of them played exactly one chess game with each other. Let's call a trio of chess players $A, B, C$ a [i]principled [/i]one, if $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. What is the largest possible number of threes of principled chess play... | "[\"341606288\"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7214, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20990"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"1"
] | [
"skywork"
] | f1d7efa97c87f15579d0620f370808422e9a31eadd890a97b570a5b8ed873e51 | [
{
"content": "13.410 Along the sides of a right angle, towards the vertex, two spheres with radii of 2 and 3 cm are moving, with the centers of these spheres moving along the sides of the angle at unequal but constant speeds. At a certain moment, the center of the smaller sphere is 6 cm from the vertex, and the... | 13.410 Along the sides of a right angle, towards the vertex, two spheres with radii of 2 and 3 cm are moving, with the centers of these spheres moving along the sides of the angle at unequal but constant speeds. At a certain moment, the center of the smaller sphere is 6 cm from the vertex, and the center of the larger ... | "[\"1\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7208, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 15, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 15}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20991"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"1.5"
] | [
"skywork"
] | c4123926dc924bc1cf1e16b2a7d1b32012b68c46c0163abe6cd757ebd6996c82 | [
{
"content": "Let $a, b, c$ be positive real numbers such that $3a + 4b + 2c = 3$. Find the minimum value of\n\\[\n\\frac{1}{2a + b} + \\frac{1}{a + 3c} + \\frac{1}{4b + c}.\n\\]",
"role": "user"
}
] | Let $a, b, c$ be positive real numbers such that $3a + 4b + 2c = 3$. Find the minimum value of
\[
\frac{1}{2a + b} + \frac{1}{a + 3c} + \frac{1}{4b + c}.
\] | "[\"1.5\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7225, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 14, "DeepSeek-R1-Distill-Qwen-32B": 15, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20992"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"n = 7"
] | [
"skywork"
] | 3c2e0a5324daab296b8f5f6e3fb4ca03065e02d96babb0d7e9d334aeaf8d785d | [
{
"content": "Does there exist an integer $n > 1$ such that $2^{2^n-1} -7$ is not a perfect square?",
"role": "user"
}
] | Does there exist an integer $n > 1$ such that $2^{2^n-1} -7$ is not a perfect square? | "[\" n = 7 \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7241, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20993"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"1250"
] | [
"skywork"
] | 425edd63baddb3b8c2365304aa14c08d9c18bd67c9dd75848d81e2f55078eea9 | [
{
"content": "67. On the copyright page of each book, the following are printed: format, sheets, word count, price, etc. For example: “Format: 720mm * 960mm 1/16 Sheets: 12 Word count: 240 thousand words” The average number of words per page in this book is $\\qquad$ words. (Note: 16-page format, i.e., 1 sheet ... | 67. On the copyright page of each book, the following are printed: format, sheets, word count, price, etc. For example: “Format: 720mm * 960mm 1/16 Sheets: 12 Word count: 240 thousand words” The average number of words per page in this book is $\qquad$ words. (Note: 16-page format, i.e., 1 sheet equals 16 pages). | "[\"1250\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7227, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 9, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 2}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20994"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{\\pi}{3}+2k\\pi"
] | [
"skywork"
] | 6d738dbfebba659ee77c03edabcf545add3450254bfbcce6850665495bae2b82 | [
{
"content": "Task B-3.1. Solve the equation\n\n$$\n\\log _{\\sqrt{2} \\sin x}(1+\\cos x)=2\n$$",
"role": "user"
}
] | Task B-3.1. Solve the equation
$$
\log _{\sqrt{2} \sin x}(1+\cos x)=2
$$ | "[\"\\\\frac{\\\\pi}{3}+2k\\\\pi\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7232, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 10, "DeepSeek-R1-Distill-Qwen-32B": 12, "DeepSeek-R1-Distill-Qwen-7B": 12}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20995"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"(x, y) = (3, 2)"
] | [
"skywork"
] | 81a5995995cd5997765d51554ecd108d18252485cfddd9cb703476027c2cd386 | [
{
"content": "Determine all pairs of positive integers $(x, y)$ such that:\n$$x^4 - 6x^2 + 1 = 7\\cdot 2^y$$",
"role": "user"
}
] | Determine all pairs of positive integers $(x, y)$ such that:
$$x^4 - 6x^2 + 1 = 7\cdot 2^y$$ | "[\" (x, y) = (3, 2) \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7240, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20996"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"f(n) = n"
] | [
"skywork"
] | 8a4b785fc38eadf5af56684b1166f9f71c9d9cb452c10e88280bcf2efde0ec76 | [
{
"content": "Find all functions $f:\\mathbb{Z}^{+}\\to\\mathbb{Z}^{+}$ such that $$m^{2}+f(n)^{2}+(m-f(n))^{2}\\geq f(m)^{2}+n^{2}$$ for all pairs of positive integers $(m,n)$.",
"role": "user"
}
] | Find all functions $f:\mathbb{Z}^{+}\to\mathbb{Z}^{+}$ such that $$m^{2}+f(n)^{2}+(m-f(n))^{2}\geq f(m)^{2}+n^{2}$$ for all pairs of positive integers $(m,n)$. | "[\" f(n) = n \"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7218, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20997"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"180"
] | [
"skywork"
] | 2cf5c055d3da600bb79a8990739433b58f25fa15f7fe54c5a3354d8f085c5e7c | [
{
"content": "What is the smallest positive integer with six positive odd integer divisors and twelve positive even integer divisors?",
"role": "user"
}
] | What is the smallest positive integer with six positive odd integer divisors and twelve positive even integer divisors? | "[\"180\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7243, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20998"}, {"dataset": "skywork", "extra_inf... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"3,7"
] | [
"skywork"
] | 6010d3017c8dece4051a4c22cc37cb5878f7a0cf3c25d036bac7a82d4b6ed687 | [
{
"content": "Example 37 (2006 Thailand Mathematical Olympiad) Find all prime numbers $p$ such that $\\frac{2^{p-1}-1}{p}$ is a perfect square.",
"role": "user"
}
] | Example 37 (2006 Thailand Mathematical Olympiad) Find all prime numbers $p$ such that $\frac{2^{p-1}-1}{p}$ is a perfect square. | "[\"3,7\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7237, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:20999"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{1440}{7}"
] | [
"skywork"
] | a917440ad9f74e6e135faf858c4f1f76e54b437af1301e3c0b7f9b70b8b161c5 | [
{
"content": "In a quadrilateral $WXYZ$, the angles satisfy $\\angle W = 3\\angle X = 4\\angle Y = 6\\angle Z$. Determine the exact degree measure of $\\angle W$.",
"role": "user"
}
] | In a quadrilateral $WXYZ$, the angles satisfy $\angle W = 3\angle X = 4\angle Y = 6\angle Z$. Determine the exact degree measure of $\angle W$. | "[\"\\\\frac{1440}{7}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7231, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21000"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"15"
] | [
"skywork"
] | 9e19bb1f7e993be49f8ae56a16759dec0fe6e0af40c0a50e68f2a9cc22143852 | [
{
"content": "3. In the arithmetic progression $\\left(a_{n}\\right) a_{1000}=150, d=0.5$.\n\nCalculate: $99 \\cdot 100 \\cdot\\left(\\frac{1}{a_{1580} \\cdot a_{1581}}+\\frac{1}{a_{1581} \\cdot a_{1582}}+\\ldots+\\frac{1}{a_{2019} \\cdot a_{2020}}\\right)$.",
"role": "user"
}
] | 3. In the arithmetic progression $\left(a_{n}\right) a_{1000}=150, d=0.5$.
Calculate: $99 \cdot 100 \cdot\left(\frac{1}{a_{1580} \cdot a_{1581}}+\frac{1}{a_{1581} \cdot a_{1582}}+\ldots+\frac{1}{a_{2019} \cdot a_{2020}}\right)$. | "[\"15\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7221, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 4, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21001"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"16"
] | [
"skywork"
] | 31f276f6bb1fac5353fde6376ed313d797bfa9b2cb53d63f680c86fae0c6685a | [
{
"content": "Find the smallest whole number that is larger than the sum\n\\[2\\dfrac{1}{2}+3\\dfrac{1}{3}+4\\dfrac{1}{4}+5\\dfrac{1}{5}.\\]",
"role": "user"
}
] | Find the smallest whole number that is larger than the sum
\[2\dfrac{1}{2}+3\dfrac{1}{3}+4\dfrac{1}{4}+5\dfrac{1}{5}.\] | "[\"16\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7245, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21002"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"2^{-2023}"
] | [
"skywork"
] | f9c8c83c8889ce0801f5d1fa83fbec9cb579d8e68052f1c961cd77f82c617cb5 | [
{
"content": "Exercise 13. A polynomial $P$ is said to be fantastic if there exist real numbers $\\mathrm{a}_{0}, \\ldots, \\mathrm{a}_{2022}$ such that\n\n$$\nP(X)=X^{2023}+a_{2022} X^{2022}+\\cdots+a_{1} X+a_{0}\n$$\n\nif it has 2023 roots $\\mathrm{r}_{1}, \\ldots, \\mathrm{r}_{2023}$ (not necessarily distin... | Exercise 13. A polynomial $P$ is said to be fantastic if there exist real numbers $\mathrm{a}_{0}, \ldots, \mathrm{a}_{2022}$ such that
$$
P(X)=X^{2023}+a_{2022} X^{2022}+\cdots+a_{1} X+a_{0}
$$
if it has 2023 roots $\mathrm{r}_{1}, \ldots, \mathrm{r}_{2023}$ (not necessarily distinct) in $[0,1]$, and if $\mathrm{P}(... | "[\"2^{-2023}\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7230, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 2, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21003"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"8:11"
] | [
"skywork"
] | a376cb082aae7f391e20d3b6c1f5fe16cebc0be8e0f494107ec2ee348d32bb9d | [
{
"content": "At around 8 o'clock in the morning, two cars left the fertilizer plant one after another, heading toward Happy Village. Both cars travel at a speed of 60 kilometers per hour. At 8:32, the distance the first car had traveled from the fertilizer plant was three times the distance traveled by the sec... | At around 8 o'clock in the morning, two cars left the fertilizer plant one after another, heading toward Happy Village. Both cars travel at a speed of 60 kilometers per hour. At 8:32, the distance the first car had traveled from the fertilizer plant was three times the distance traveled by the second car. At 8:39, the ... | "[\"8:11\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7233, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 8, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21004"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"82"
] | [
"skywork"
] | 5d7ed2380434a42a857709579169acbf5a252109b8971557c9c85e83052b939e | [
{
"content": "For each positive integer $n$, define \\[g(n) = \\gcd\\left\\{0! n!, 1! (n-1)!, 2 (n-2)!, \\ldots, k!(n-k)!, \\ldots, n! 0!\\right\\}.\\] Find the sum of all $n \\leq 25$ for which $g(n) = g(n+1)$.",
"role": "user"
}
] | For each positive integer $n$, define \[g(n) = \gcd\left\{0! n!, 1! (n-1)!, 2 (n-2)!, \ldots, k!(n-k)!, \ldots, n! 0!\right\}.\] Find the sum of all $n \leq 25$ for which $g(n) = g(n+1)$. | "[\"82\"]" | train-math-numinamath1.5_aops_forum | [{"dataset": "skywork", "extra_info": {"index": 7224, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21005"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"\\alpha=-1+\\mathrm{i},\\beta=-3"
] | [
"skywork"
] | ebcf33dc233c1bae76b22947e3ec7b1a355539063e41f05fbd08618006d30b48 | [
{
"content": "16. Given in the complex plane $\\triangle A B C$ has vertices $A, B, C$ corresponding to the complex numbers $3+2 \\mathrm{i}, 3 \\mathrm{i}, 2-\\mathrm{i}$, and the moving point $P$ corresponds to the complex number $z$. If the equation $|\\bar{z}|^{2}+\\alpha z+\\bar{\\alpha} \\bar{z}+\\beta=0$... | 16. Given in the complex plane $\triangle A B C$ has vertices $A, B, C$ corresponding to the complex numbers $3+2 \mathrm{i}, 3 \mathrm{i}, 2-\mathrm{i}$, and the moving point $P$ corresponds to the complex number $z$. If the equation $|\bar{z}|^{2}+\alpha z+\bar{\alpha} \bar{z}+\beta=0$ represents the circumcircle of ... | "[\"\\\\alpha=-1+\\\\mathrm{i},\\\\beta=-3\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7229, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 13, "DeepSeek-R1-Distill-Qwen-32B": 5, "DeepSeek-R1-Distill-Qwen-7B": 4}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21006"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"2"
] | [
"skywork"
] | 67f832a54c1ecd570f96a1b07d6397fb9ea9ba72a8f27beb929c8aa83de15af7 | [
{
"content": "8. If the equation with respect to $x$\n$$\nx^{2}+a x+b-3=0(a, b \\in \\mathbf{R})\n$$\n\nhas real roots in the interval $[1,2]$, then the minimum value of $a^{2}+(b-4)^{2}$ is $\\qquad$.",
"role": "user"
}
] | 8. If the equation with respect to $x$
$$
x^{2}+a x+b-3=0(a, b \in \mathbf{R})
$$
has real roots in the interval $[1,2]$, then the minimum value of $a^{2}+(b-4)^{2}$ is $\qquad$. | "[\"2\"]" | train-math-numinamath1.5_olympiads | [{"dataset": "skywork", "extra_info": {"index": 7226, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 14, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21007"}, {"dataset": "skywork", "extra_... | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"-1"
] | [
"skywork"
] | c0faffdcf0bb6cc8b65153e106528e4ea9a0c2e590bad3758dee1301e4ee444b | [
{
"content": "Given that $\\{1, a, \\frac{b}{a}\\} = \\{0, a^2, a+b\\}$, find the value of $a^{2015} + b^{2014}$.",
"role": "user"
}
] | Given that $\{1, a, \frac{b}{a}\} = \{0, a^2, a+b\}$, find the value of $a^{2015} + b^{2014}$. | "[\"-1\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7228, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 13, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 9}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21008"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": true,
"reference_components": 1,
"reference_present": true
} |
[
"2+2\\sqrt{2}+2\\sqrt{3}"
] | [
"skywork"
] | 0e3037e9f93e4775299b489b7094f1471650a8ebd0f845d9d543c9641a5cb009 | [
{
"content": "Find the sum of the absolute values of the roots of $x^{4}-4 x^{3}-4 x^{2}+16 x-8=0$.",
"role": "user"
}
] | Find the sum of the absolute values of the roots of $x^{4}-4 x^{3}-4 x^{2}+16 x-8=0$. | "[\"2+2\\\\sqrt{2}+2\\\\sqrt{3}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7261, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 10, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 2}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21009"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"9\\sqrt{41}"
] | [
"skywork"
] | 03433c0746d547867f60fc06f32ff0c56e6ca14bdfb010861c0798ab56546421 | [
{
"content": "Consider a parallelogram where each vertex has integer coordinates and is located at $(0,0)$, $(4,5)$, $(11,5)$, and $(7,0)$. Calculate the sum of the perimeter and the area of this parallelogram.",
"role": "user"
}
] | Consider a parallelogram where each vertex has integer coordinates and is located at $(0,0)$, $(4,5)$, $(11,5)$, and $(7,0)$. Calculate the sum of the perimeter and the area of this parallelogram. | "[\"9\\\\sqrt{41}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7251, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 16, "DeepSeek-R1-Distill-Qwen-32B": 16, "DeepSeek-R1-Distill-Qwen-7B": 16}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21010"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{1}{3}"
] | [
"skywork"
] | 7caccc9253da896c00ab7c91d84c8cba9b4f86d2c65944a5dc5c61a4d176b233 | [
{
"content": "Given $cos({\\frac{π}{4}+α})=\\frac{{\\sqrt{2}}}{3}$, then $\\frac{{sin2α}}{{1-sinα+cosα}}=$____.",
"role": "user"
}
] | Given $cos({\frac{π}{4}+α})=\frac{{\sqrt{2}}}{3}$, then $\frac{{sin2α}}{{1-sinα+cosα}}=$____. | "[\"\\\\frac{1}{3}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7242, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 1, "DeepSeek-R1-Distill-Qwen-32B": 1, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21011"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{\\sqrt{2}}{2}"
] | [
"skywork"
] | b80589ae539d60c4499d77b2e7d997cc652d40b4f91cc8742c5e08e61f267448 | [
{
"content": "Given a power function $y = f(x)$ whose graph passes through the point $(4, 2)$, find $f\\left( \\frac{1}{2} \\right)$.",
"role": "user"
}
] | Given a power function $y = f(x)$ whose graph passes through the point $(4, 2)$, find $f\left( \frac{1}{2} \right)$. | "[\"\\\\frac{\\\\sqrt{2}}{2}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7235, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 7, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 2}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21012"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"\\frac{10}{3}"
] | [
"skywork"
] | 0b0c945da8e380e07ef9b93a0f96dba8a7e40210374745711dca55056feb5e19 | [
{
"content": "For each value of $x$, $g(x)$ is defined to be the minimum value of the three numbers $3x + 3$, $\\frac{1}{3}x + 1$, and $-\\frac{2}{3}x + 8$. Find the maximum value of $g(x)$.",
"role": "user"
}
] | For each value of $x$, $g(x)$ is defined to be the minimum value of the three numbers $3x + 3$, $\frac{1}{3}x + 1$, and $-\frac{2}{3}x + 8$. Find the maximum value of $g(x)$. | "[\"\\\\frac{10}{3}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7264, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 8, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 1}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21013"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
[
"-\\frac{1}{9}"
] | [
"skywork"
] | 1387af233b85521bcea7c5a9592f19f976dca51f51084508f27897a4f9f4fb72 | [
{
"content": "Given $\\cos (\\frac{\\pi}{4}-\\frac{\\theta}{2})=\\frac{2}{3}$, find the value of $\\sin \\theta$.",
"role": "user"
}
] | Given $\cos (\frac{\pi}{4}-\frac{\theta}{2})=\frac{2}{3}$, find the value of $\sin \theta$. | "[\"-\\\\frac{1}{9}\"]" | train-math-deepscaler | [{"dataset": "skywork", "extra_info": {"index": 7259, "model_difficulty": {"DeepSeek-R1-Distill-Qwen-1.5B": 0, "DeepSeek-R1-Distill-Qwen-32B": 0, "DeepSeek-R1-Distill-Qwen-7B": 0}}, "file": "data/math-00000-of-00001.parquet", "row_id": "skywork:data/math-00000-of-00001.parquet:21014"}] | {
"all_reference_components_parse": true,
"any_reference_component_parses": true,
"label_correctness_independently_verified": false,
"plain_numeric_reference": false,
"reference_components": 1,
"reference_present": true
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.