{"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":"540394cf-49fb-52f4-8e21-b836ce8c5feb","task_key":"test--540394cf-49fb-52f4-8e21-b836ce8c5feb","task_revision_id":"1","upstream_id":"","short_description":"Alice writes 1001 letters on a blackboard, each one chosen independently and…","config":"","split":"test","body":"{\"problem\":\"Alice writes 1001 letters on a blackboard, each one chosen independently and uniformly at random from the set $S=\\\\{a, b, c\\\\}$. A move consists of erasing two distinct letters from the board and replacing them with the third letter in $S$. What is the probability that Alice can perform a sequence of moves which results in one letter remaining on the blackboard?\"}","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":[]}