{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"f602207f-b77b-5eac-95d9-5f76e911f2d5","task_key":"test--f602207f-b77b-5eac-95d9-5f76e911f2d5","task_revision_id":"1","upstream_id":"","short_description":"For an integer $x \\geq 1$, let $p(x)$ be the least prime that does not divide…","config":"","split":"test","body":"{\"problem\":\"For an integer $x \\\\geq 1$, let $p(x)$ be the least prime that does not divide $x$, and define $q(x)$ to be the product of all primes less than $p(x)$. In particular, $p(1) = 2.$ For $x$ having $p(x) = 2$, define $q(x) = 1$. Consider the sequence $x_0, x_1, x_2, \\\\ldots$ defined by $x_0 = 1$ and \\\\[ x_{n+1} = \\\\frac{x_n p(x_n)}{q(x_n)} \\\\] for $n \\\\geq 0$. Find all $n$ such that $x_n = 1995$.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}