{"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":"3ba2707f-8bae-5654-8c80-c3767cadbc29","task_key":"test--3ba2707f-8bae-5654-8c80-c3767cadbc29","task_revision_id":"1","upstream_id":"","short_description":"For positive reals $p$ and $q$, define the remainder when $p$ is divided by $q$…","config":"","split":"test","body":"{\"problem\":\"For positive reals $p$ and $q$, define the remainder when $p$ is divided by $q$ as the smallest nonnegative real $r$ such that $\\\\frac{p-r}{q}$ is an integer. For an ordered pair $(a, b)$ of positive integers, let $r_{1}$ and $r_{2}$ be the remainder when $a \\\\sqrt{2}+b \\\\sqrt{3}$ is divided by $\\\\sqrt{2}$ and $\\\\sqrt{3}$ respectively. Find the number of pairs $(a, b)$ such that $a, b \\\\leq 20$ and $r_{1}+r_{2}=\\\\sqrt{2}$.\"}","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":[]}