{"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":"b24a950f-9c83-5026-ba6f-6fa7595b8f72","task_key":"test--b24a950f-9c83-5026-ba6f-6fa7595b8f72","task_revision_id":"1","upstream_id":"","short_description":"Find, as a function of $\\, n, \\,$ the sum of the digits of \\[9 \\times 99 \\times…","config":"","split":"test","body":"{\"problem\":\"Find, as a function of $\\\\, n, \\\\,$ the sum of the digits of \\\\[9 \\\\times 99 \\\\times 9999 \\\\times \\\\cdots \\\\times \\\\left( 10^{2^n} - 1 \\\\right),\\\\] where each factor has twice as many digits as the previous one.\"}","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":[]}