{"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":"01b0c3cb-1483-5297-a6ab-7ef00a1ccff4","task_key":"test--01b0c3cb-1483-5297-a6ab-7ef00a1ccff4","task_revision_id":"1","upstream_id":"","short_description":"Mark writes the expression $\\sqrt{d}$ for each positive divisor $d$ of 8 ! on…","config":"","split":"test","body":"{\"problem\":\"Mark writes the expression $\\\\sqrt{d}$ for each positive divisor $d$ of 8 ! on the board. Seeing that these expressions might not be worth points on HMMT, Rishabh simplifies each expression to the form $a \\\\sqrt{b}$, where $a$ and $b$ are integers such that $b$ is not divisible by the square of a prime number. Compute the sum of $a+b$ across all expressions that Rishabh writes.\"}","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":[]}