{"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":"6e38bdba-4d91-54f5-9a9f-4f70f1fda4c4","task_key":"test--6e38bdba-4d91-54f5-9a9f-4f70f1fda4c4","task_revision_id":"1","upstream_id":"","short_description":"Starting with the number 0, Casey performs an infinite sequence of moves as…","config":"","split":"test","body":"{\"problem\":\"Starting with the number 0, Casey performs an infinite sequence of moves as follows: he chooses a number from $\\\\{1,2\\\\}$ at random (each with probability $\\\\frac{1}{2}$) and adds it to the current number. Let $p_{m}$ be the probability that Casey ever reaches the number $m$. Find $p_{20}-p_{15}$.\"}","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":[]}