{"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":"c0555909-62f2-5131-b08d-d2a092c5a5e3","task_key":"test--c0555909-62f2-5131-b08d-d2a092c5a5e3","task_revision_id":"1","upstream_id":"","short_description":"Teresa the bunny has a fair 8-sided die. Seven of its sides have fixed labels…","config":"","split":"test","body":"{\"problem\":\"Teresa the bunny has a fair 8-sided die. Seven of its sides have fixed labels $1,2, \\\\ldots, 7$, and the label on the eighth side can be changed and begins as 1. She rolls it several times, until each of $1,2, \\\\ldots, 7$ appears at least once. After each roll, if $k$ is the smallest positive integer that she has not rolled so far, she relabels the eighth side with $k$. The probability that 7 is the last number she rolls is $\\\\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Compute $100 a+b$.\"}","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":[]}