{"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":"90f1fe90-3a6f-5136-bba3-470b9c15109c","task_key":"test--90f1fe90-3a6f-5136-bba3-470b9c15109c","task_revision_id":"1","upstream_id":"","short_description":"For each \\(i \\in\\{1, \\ldots, 10\\}, a_{i}\\) is chosen independently and uniformly…","config":"","split":"test","body":"{\"problem\":\"For each \\\\(i \\\\in\\\\{1, \\\\ldots, 10\\\\}, a_{i}\\\\) is chosen independently and uniformly at random from \\\\([0, i^{2}]\\\\). Let \\\\(P\\\\) be the probability that \\\\(a_{1}<a_{2}<\\\\cdots<a_{10}\\\\). Estimate \\\\(P\\\\).\"}","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":[]}