{"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":"2b94c20b-2e32-5a69-9e09-965461c08a66","task_key":"test--2b94c20b-2e32-5a69-9e09-965461c08a66","task_revision_id":"1","upstream_id":"","short_description":"The English alphabet, which has 26 letters, is randomly permuted. Let \\(p_{1}\\)…","config":"","split":"test","body":"{\"problem\":\"The English alphabet, which has 26 letters, is randomly permuted. Let \\\\(p_{1}\\\\) be the probability that \\\\(\\\\mathrm{AB}, \\\\mathrm{CD}\\\\), and \\\\(\\\\mathrm{EF}\\\\) all appear as contiguous substrings. Let \\\\(p_{2}\\\\) be the probability that \\\\(\\\\mathrm{ABC}\\\\) and \\\\(\\\\mathrm{DEF}\\\\) both appear as contiguous substrings. Compute \\\\(\\\\frac{p_{1}}{p_{2}}\\\\).\"}","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":[]}