{"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":"cb09aca1-0b56-5246-b954-4cdc6ad7544c","task_key":"test--cb09aca1-0b56-5246-b954-4cdc6ad7544c","task_revision_id":"1","upstream_id":"","short_description":"For $1 \\leq j \\leq 2014$, define $b_{j}=j^{2014} \\prod_{i=1, i \\neq…","config":"","split":"test","body":"{\"problem\":\"For $1 \\\\leq j \\\\leq 2014$, define $b_{j}=j^{2014} \\\\prod_{i=1, i \\\\neq j}^{2014}(i^{2014}-j^{2014})$ where the product is over all $i \\\\in\\\\{1, \\\\ldots, 2014\\\\}$ except $i=j$. Evaluate $\\\\frac{1}{b_{1}}+\\\\frac{1}{b_{2}}+\\\\cdots+\\\\frac{1}{b_{2014}}$.\"}","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":[]}