Dataset Viewer
Auto-converted to Parquet Duplicate
name
stringlengths
27
59
instruction
stringlengths
309
37k
description
stringclasses
219 values
keywords
listlengths
3
3
schema_version
stringclasses
1 value
config
unknown
metadata
unknown
files
listlengths
9
9
location
stringlengths
26
58
rlmath/construct-ae-p32-spherical-design-l1-s0
Spherical designs on the 2-sphere. A finite set X of points on the unit sphere S^2 in R^3 is a spherical t-design if for every polynomial P(x, y, z) of degree at most t, the average of P over the points of X equals the average of P over the whole sphere (with respect to the uniform surface measure). Equivalently, the...
construct/ae_p32_spherical_designs
[ "rlmath", "construct", "ae_p32_spherical_designs" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p32-spherical-design-l1-s0", "version": "0.2.0", "description": "construct/ae_p32_spherical_designs", "authors": [], "keywords": [ "rlmath", "construct", "ae_p32_spherical_designs" ] }, ...
{ "subset": "construct", "family": "ae_p32_spherical_designs", "problem_key": "spherical_t_design_s2", "domain": "discrete_geometry", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/32-spherical-designs", "source_license": "CC-BY-4.0", "tags": [ "float_tolerance", ...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p32-spherical-design-l1-s0
rlmath/construct-ae-p32-spherical-design-l2-s0
Spherical designs on the 2-sphere. A finite set X of points on the unit sphere S^2 in R^3 is a spherical t-design if for every polynomial P(x, y, z) of degree at most t, the average of P over the points of X equals the average of P over the whole sphere (with respect to the uniform surface measure). Equivalently, the...
construct/ae_p32_spherical_designs
[ "rlmath", "construct", "ae_p32_spherical_designs" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p32-spherical-design-l2-s0", "version": "0.2.0", "description": "construct/ae_p32_spherical_designs", "authors": [], "keywords": [ "rlmath", "construct", "ae_p32_spherical_designs" ] }, ...
{ "subset": "construct", "family": "ae_p32_spherical_designs", "problem_key": "spherical_t_design_s2", "domain": "discrete_geometry", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/32-spherical-designs", "source_license": "CC-BY-4.0", "tags": [ "float_tolerance", ...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p32-spherical-design-l2-s0
rlmath/construct-ae-p32-spherical-design-l3-s0
Spherical designs on the 2-sphere. A finite set X of points on the unit sphere S^2 in R^3 is a spherical t-design if for every polynomial P(x, y, z) of degree at most t, the average of P over the points of X equals the average of P over the whole sphere (with respect to the uniform surface measure). Equivalently, the...
construct/ae_p32_spherical_designs
[ "rlmath", "construct", "ae_p32_spherical_designs" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p32-spherical-design-l3-s0", "version": "0.2.0", "description": "construct/ae_p32_spherical_designs", "authors": [], "keywords": [ "rlmath", "construct", "ae_p32_spherical_designs" ] }, ...
{ "subset": "construct", "family": "ae_p32_spherical_designs", "problem_key": "spherical_t_design_s2", "domain": "discrete_geometry", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/32-spherical-designs", "source_license": "CC-BY-4.0", "tags": [ "float_tolerance", ...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p32-spherical-design-l3-s0
rlmath/construct-ae-p32-spherical-design-l4-s0
Spherical designs on the 2-sphere. A finite set X of points on the unit sphere S^2 in R^3 is a spherical t-design if for every polynomial P(x, y, z) of degree at most t, the average of P over the points of X equals the average of P over the whole sphere (with respect to the uniform surface measure). Equivalently, the...
construct/ae_p32_spherical_designs
[ "rlmath", "construct", "ae_p32_spherical_designs" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p32-spherical-design-l4-s0", "version": "0.2.0", "description": "construct/ae_p32_spherical_designs", "authors": [], "keywords": [ "rlmath", "construct", "ae_p32_spherical_designs" ] }, ...
{ "subset": "construct", "family": "ae_p32_spherical_designs", "problem_key": "spherical_t_design_s2", "domain": "discrete_geometry", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/32-spherical-designs", "source_license": "CC-BY-4.0", "tags": [ "float_tolerance", ...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p32-spherical-design-l4-s0
rlmath/construct-ae-p32-spherical-design-l5-s0
Spherical designs on the 2-sphere. A finite set X of points on the unit sphere S^2 in R^3 is a spherical t-design if for every polynomial P(x, y, z) of degree at most t, the average of P over the points of X equals the average of P over the whole sphere (with respect to the uniform surface measure). Equivalently, the...
construct/ae_p32_spherical_designs
[ "rlmath", "construct", "ae_p32_spherical_designs" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p32-spherical-design-l5-s0", "version": "0.2.0", "description": "construct/ae_p32_spherical_designs", "authors": [], "keywords": [ "rlmath", "construct", "ae_p32_spherical_designs" ] }, ...
{ "subset": "construct", "family": "ae_p32_spherical_designs", "problem_key": "spherical_t_design_s2", "domain": "discrete_geometry", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/32-spherical-designs", "source_license": "CC-BY-4.0", "tags": [ "float_tolerance", ...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p32-spherical-design-l5-s0
rlmath/construct-ae-p32-spherical-design-l6-s0
Spherical designs on the 2-sphere. A finite set X of points on the unit sphere S^2 in R^3 is a spherical t-design if for every polynomial P(x, y, z) of degree at most t, the average of P over the points of X equals the average of P over the whole sphere (with respect to the uniform surface measure). Equivalently, the...
construct/ae_p32_spherical_designs
[ "rlmath", "construct", "ae_p32_spherical_designs" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p32-spherical-design-l6-s0", "version": "0.2.0", "description": "construct/ae_p32_spherical_designs", "authors": [], "keywords": [ "rlmath", "construct", "ae_p32_spherical_designs" ] }, ...
{ "subset": "construct", "family": "ae_p32_spherical_designs", "problem_key": "spherical_t_design_s2", "domain": "discrete_geometry", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/32-spherical-designs", "source_license": "CC-BY-4.0", "tags": [ "float_tolerance", ...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p32-spherical-design-l6-s0
rlmath/construct-ae-p38-factorial-factors-l1-s0
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 36. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 10. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s0", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s0
rlmath/construct-ae-p38-factorial-factors-l1-s1
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 37. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 10. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s1", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s1
rlmath/construct-ae-p38-factorial-factors-l1-s2
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 44. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 12. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s2", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s2
rlmath/construct-ae-p38-factorial-factors-l1-s3
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 45. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 12. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s3", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s3
rlmath/construct-ae-p38-factorial-factors-l1-s4
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 48. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 13. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s4", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s4
rlmath/construct-ae-p38-factorial-factors-l1-s5
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 52. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 15. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s5", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s5
rlmath/construct-ae-p38-factorial-factors-l1-s6
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 54. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 15. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s6", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s6
rlmath/construct-ae-p38-factorial-factors-l1-s7
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 55. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 15. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s7", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s7
rlmath/construct-ae-p38-factorial-factors-l1-s8
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 56. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 15. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s8", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s8
rlmath/construct-ae-p38-factorial-factors-l1-s9
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 59. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 17. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l1-s9", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l1-s9
rlmath/construct-ae-p38-factorial-factors-l2-s0
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 86. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 24. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s0", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s0
rlmath/construct-ae-p38-factorial-factors-l2-s1
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 88. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 25. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s1", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s1
rlmath/construct-ae-p38-factorial-factors-l2-s2
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 97. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 28. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numbe...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s2", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s2
rlmath/construct-ae-p38-factorial-factors-l2-s3
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 106. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 30. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s3", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s3
rlmath/construct-ae-p38-factorial-factors-l2-s4
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 110. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 31. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s4", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s4
rlmath/construct-ae-p38-factorial-factors-l2-s5
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 119. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 35. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s5", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s5
rlmath/construct-ae-p38-factorial-factors-l2-s6
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 120. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 35. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s6", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s6
rlmath/construct-ae-p38-factorial-factors-l2-s7
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 134. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 39. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s7", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s7
rlmath/construct-ae-p38-factorial-factors-l2-s8
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 139. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 40. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s8", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s8
rlmath/construct-ae-p38-factorial-factors-l2-s9
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 152. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 44. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l2-s9", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l2-s9
rlmath/construct-ae-p38-factorial-factors-l3-s0
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 180. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 54. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s0", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s0
rlmath/construct-ae-p38-factorial-factors-l3-s1
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 231. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 69. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s1", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s1
rlmath/construct-ae-p38-factorial-factors-l3-s2
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 252. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 75. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s2", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s2
rlmath/construct-ae-p38-factorial-factors-l3-s3
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 275. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 83. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s3", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s3
rlmath/construct-ae-p38-factorial-factors-l3-s4
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 284. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 85. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s4", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s4
rlmath/construct-ae-p38-factorial-factors-l3-s5
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 313. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 93. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your numb...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s5", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s5
rlmath/construct-ae-p38-factorial-factors-l3-s6
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 339. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 103. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s6", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s6
rlmath/construct-ae-p38-factorial-factors-l3-s7
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 357. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 108. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s7", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s7
rlmath/construct-ae-p38-factorial-factors-l3-s8
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 384. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 117. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s8", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s8
rlmath/construct-ae-p38-factorial-factors-l3-s9
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 395. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 120. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l3-s9", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l3-s9
rlmath/construct-ae-p38-factorial-factors-l4-s0
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 568. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 174. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s0", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s0
rlmath/construct-ae-p38-factorial-factors-l4-s1
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 577. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 178. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s1", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s1
rlmath/construct-ae-p38-factorial-factors-l4-s2
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 584. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 180. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s2", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s2
rlmath/construct-ae-p38-factorial-factors-l4-s3
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 736. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 228. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s3", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s3
rlmath/construct-ae-p38-factorial-factors-l4-s4
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 751. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 232. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s4", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s4
rlmath/construct-ae-p38-factorial-factors-l4-s5
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 778. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 240. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s5", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s5
rlmath/construct-ae-p38-factorial-factors-l4-s6
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 891. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 278. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your num...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s6", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s6
rlmath/construct-ae-p38-factorial-factors-l4-s7
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1031. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 322. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s7", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s7
rlmath/construct-ae-p38-factorial-factors-l4-s8
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1117. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 350. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s8", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s8
rlmath/construct-ae-p38-factorial-factors-l4-s9
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1164. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 365. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l4-s9", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "4", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l4-s9
rlmath/construct-ae-p38-factorial-factors-l5-s0
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1632. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 515. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s0", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s0
rlmath/construct-ae-p38-factorial-factors-l5-s1
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1725. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 546. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s1", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s1
rlmath/construct-ae-p38-factorial-factors-l5-s2
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1825. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 577. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s2", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s2
rlmath/construct-ae-p38-factorial-factors-l5-s3
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 1893. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 599. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s3", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s3
rlmath/construct-ae-p38-factorial-factors-l5-s4
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 2295. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 732. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s4", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s4
rlmath/construct-ae-p38-factorial-factors-l5-s5
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 2400. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 764. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s5", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s5
rlmath/construct-ae-p38-factorial-factors-l5-s6
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 2989. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 956. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s6", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s6
rlmath/construct-ae-p38-factorial-factors-l5-s7
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 3059. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 980. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your nu...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s7", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s7
rlmath/construct-ae-p38-factorial-factors-l5-s8
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 3148. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 1010. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s8", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s8
rlmath/construct-ae-p38-factorial-factors-l5-s9
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 3574. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 1147. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l5-s9", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "5", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l5-s9
rlmath/construct-ae-p38-factorial-factors-l6-s0
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 5043. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 1631. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s0", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s0
rlmath/construct-ae-p38-factorial-factors-l6-s1
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 5728. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 1856. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s1", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s1
rlmath/construct-ae-p38-factorial-factors-l6-s2
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 6230. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2021. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s2", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s2
rlmath/construct-ae-p38-factorial-factors-l6-s3
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 7370. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2398. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s3", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s3
rlmath/construct-ae-p38-factorial-factors-l6-s4
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 7446. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2426. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s4", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s4
rlmath/construct-ae-p38-factorial-factors-l6-s5
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 7712. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2510. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s5", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s5
rlmath/construct-ae-p38-factorial-factors-l6-s6
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 8484. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2770. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s6", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s6
rlmath/construct-ae-p38-factorial-factors-l6-s7
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 8731. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2851. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s7", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s7
rlmath/construct-ae-p38-factorial-factors-l6-s8
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 8823. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 2881. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s8", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s8
rlmath/construct-ae-p38-factorial-factors-l6-s9
Factoring N! into N large factors (Erdos-Guy-Selfridge). Let N = 9545. Write N! as a product of exactly N positive integers, N! = a_1 * a_2 * ... * a_N, such that every factor satisfies a_i >= 3118. (The order of the factors does not matter; repeated values are allowed.) The check is exact: the product of your n...
construct/ae_p38_factorial_factors
[ "rlmath", "construct", "ae_p38_factorial_factors" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p38-factorial-factors-l6-s9", "version": "0.2.0", "description": "construct/ae_p38_factorial_factors", "authors": [], "keywords": [ "rlmath", "construct", "ae_p38_factorial_factors" ] }, ...
{ "subset": "construct", "family": "ae_p38_factorial_factors", "problem_key": "factorial_into_n_large_factors_A034258", "domain": "number_theory", "tier": "research", "level": "6", "source": "AlphaEvolve-Repository-of-Problems/38-factoring-N-factorial", "source_license": "CC-BY-4.0", "tags": [ "ag...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p38-factorial-factors-l6-s9
rlmath/construct-ae-p52-erdos-squarefree-l1-s0
Erdos squarefree problem. Let N = 71. Find a set A of distinct integers in {1, 2, ..., N} with 3 <= |A| <= 26 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s0", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s0
rlmath/construct-ae-p52-erdos-squarefree-l1-s1
Erdos squarefree problem. Let N = 82. Find a set A of distinct integers in {1, 2, ..., N} with 4 <= |A| <= 28 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s1", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s1
rlmath/construct-ae-p52-erdos-squarefree-l1-s2
Erdos squarefree problem. Let N = 91. Find a set A of distinct integers in {1, 2, ..., N} with 4 <= |A| <= 28 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s2", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s2
rlmath/construct-ae-p52-erdos-squarefree-l1-s3
Erdos squarefree problem. Let N = 39. Find a set A of distinct integers in {1, 2, ..., N} with 2 <= |A| <= 24 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s3", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s3
rlmath/construct-ae-p52-erdos-squarefree-l1-s4
Erdos squarefree problem. Let N = 54. Find a set A of distinct integers in {1, 2, ..., N} with 2 <= |A| <= 24 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s4", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s4
rlmath/construct-ae-p52-erdos-squarefree-l1-s5
Erdos squarefree problem. Let N = 80. Find a set A of distinct integers in {1, 2, ..., N} with 3 <= |A| <= 26 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s5", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s5
rlmath/construct-ae-p52-erdos-squarefree-l1-s6
Erdos squarefree problem. Let N = 66. Find a set A of distinct integers in {1, 2, ..., N} with 3 <= |A| <= 26 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s6", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s6
rlmath/construct-ae-p52-erdos-squarefree-l1-s7
Erdos squarefree problem. Let N = 40. Find a set A of distinct integers in {1, 2, ..., N} with 2 <= |A| <= 24 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s7", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s7
rlmath/construct-ae-p52-erdos-squarefree-l1-s8
Erdos squarefree problem. Let N = 84. Find a set A of distinct integers in {1, 2, ..., N} with 4 <= |A| <= 28 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s8", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s8
rlmath/construct-ae-p52-erdos-squarefree-l1-s9
Erdos squarefree problem. Let N = 55. Find a set A of distinct integers in {1, 2, ..., N} with 2 <= |A| <= 24 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as JS...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l1-s9", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "1", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l1-s9
rlmath/construct-ae-p52-erdos-squarefree-l2-s0
Erdos squarefree problem. Let N = 101. Find a set A of distinct integers in {1, 2, ..., N} with 4 <= |A| <= 28 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s0", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s0
rlmath/construct-ae-p52-erdos-squarefree-l2-s1
Erdos squarefree problem. Let N = 124. Find a set A of distinct integers in {1, 2, ..., N} with 5 <= |A| <= 30 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s1", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s1
rlmath/construct-ae-p52-erdos-squarefree-l2-s2
Erdos squarefree problem. Let N = 361. Find a set A of distinct integers in {1, 2, ..., N} with 15 <= |A| <= 50 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as ...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s2", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s2
rlmath/construct-ae-p52-erdos-squarefree-l2-s3
Erdos squarefree problem. Let N = 156. Find a set A of distinct integers in {1, 2, ..., N} with 6 <= |A| <= 32 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s3", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s3
rlmath/construct-ae-p52-erdos-squarefree-l2-s4
Erdos squarefree problem. Let N = 241. Find a set A of distinct integers in {1, 2, ..., N} with 10 <= |A| <= 40 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as ...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s4", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s4
rlmath/construct-ae-p52-erdos-squarefree-l2-s5
Erdos squarefree problem. Let N = 293. Find a set A of distinct integers in {1, 2, ..., N} with 12 <= |A| <= 44 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as ...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s5", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s5
rlmath/construct-ae-p52-erdos-squarefree-l2-s6
Erdos squarefree problem. Let N = 151. Find a set A of distinct integers in {1, 2, ..., N} with 6 <= |A| <= 32 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s6", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s6
rlmath/construct-ae-p52-erdos-squarefree-l2-s7
Erdos squarefree problem. Let N = 102. Find a set A of distinct integers in {1, 2, ..., N} with 4 <= |A| <= 28 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s7", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s7
rlmath/construct-ae-p52-erdos-squarefree-l2-s8
Erdos squarefree problem. Let N = 207. Find a set A of distinct integers in {1, 2, ..., N} with 9 <= |A| <= 38 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s8", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s8
rlmath/construct-ae-p52-erdos-squarefree-l2-s9
Erdos squarefree problem. Let N = 127. Find a set A of distinct integers in {1, 2, ..., N} with 5 <= |A| <= 30 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as J...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l2-s9", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "2", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l2-s9
rlmath/construct-ae-p52-erdos-squarefree-l3-s0
Erdos squarefree problem. Let N = 718. Find a set A of distinct integers in {1, 2, ..., N} with 29 <= |A| <= 78 such that for ALL a, b in A (including a = b) the number a*b + 1 is NOT squarefree, i.e. a*b + 1 is divisible by p^2 for some prime p. Answer format: {"A": [a_1, a_2, ..., a_m]} Write your final answer as ...
construct/ae_p52_erdos_squarefree
[ "rlmath", "construct", "ae_p52_erdos_squarefree" ]
1.4
{ "schema_version": "1.4", "artifacts": [], "task": { "name": "rlmath/construct-ae-p52-erdos-squarefree-l3-s0", "version": "0.2.0", "description": "construct/ae_p52_erdos_squarefree", "authors": [], "keywords": [ "rlmath", "construct", "ae_p52_erdos_squarefree" ] }, "...
{ "subset": "construct", "family": "ae_p52_erdos_squarefree", "problem_key": "erdos_ab_plus_1_never_squarefree", "domain": "number_theory", "tier": "research", "level": "3", "source": "AlphaEvolve-Repository-of-Problems/52-erdos-squarefree", "source_license": "CC-BY-4.0", "tags": [ "exact_integer"...
[ "environment/Dockerfile", "environment/instance.json", "instruction.md", "solution/solve.sh", "task.toml", "tests/check.py", "tests/instance.json", "tests/run.py", "tests/test.sh" ]
tasks/construct-ae-p52-erdos-squarefree-l3-s0
End of preview. Expand in Data Studio

MathConstructOptimize-Envs (Harbor)

The 3,793 tasks of amphora/MathConstructOptimize-Envs as runnable Harbor environments. Each task is one directory:

tasks/<task_id>/
  task.toml              # metadata (subset, family, problem_key, tier, level, source, license, tags,
                         #   direction/baseline/best_known for optimize), limits, network_mode = "no-network"
  instruction.md         # the prompt; the agent writes its answer to /workdir/answer.json
  environment/Dockerfile # python:3.11 slim + pinned numpy/scipy/sympy/networkx/pysat/z3/pulp/ortools
  environment/instance.json
  tests/test.sh          # runs tests/run.py + tests/check.py, writes /logs/verifier/reward.txt
  solution/solve.sh      # oracle: a known valid answer
uv tool install harbor
huggingface-cli download amphora/MathConstructOptimize-Envs-harbor --repo-type dataset --local-dir mcoe
harbor run -p mcoe/tasks -a oracle -n 16          # validate: every task scores > 0
harbor run -p mcoe/tasks -a terminus-2 -m <model> -n 16

Validation:

  • The oracle agent passes on all 3,793 tasks (construct = 1.0, optimize ≥ 0.1), and a no-op agent scores 0.
  • An HTTP canary confirmed that no-network blocks internet access inside the task container. Research-level best constructions are public, so do not relax this for RL.
  • If you run many trials concurrently, raise Docker's default address pools. Each no-network task creates its own networks, and the defaults are exhausted at roughly 30 concurrent trials.

v2 (2026-11-18): 216 optimize tasks added (Optimization Constants in Mathematics, more AlphaEvolve problems, Leaps in Bounds, FrontierShift, FrontierCO MDS, ALE-Bench, FrontierCS, EdgeBench); the previous version is git tag pre-v2. ALE-Bench tasks are CC BY-ND 4.0 and FrontierShift tasks have no stated license; see LICENSE.md.

See the main dataset card for the reward contract, tags, sources and the upstream verifier bugs we fixed.

Downloads last month
1,108