{"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":"4835690a-37e3-5a79-815e-4a311b92ccd3","task_key":"test--4835690a-37e3-5a79-815e-4a311b92ccd3","task_revision_id":"1","upstream_id":"","short_description":"Suppose that $(a_1, b_1), (a_2, b_2), \\ldots , (a_{100}, b_{100})$ are distinct…","config":"","split":"test","body":"{\"problem\":\"Suppose that $(a_1, b_1), (a_2, b_2), \\\\ldots , (a_{100}, b_{100})$ are distinct ordered pairs of nonnegative integers. Let $N$ denote the number of pairs of integers $(i, j)$ satisfying $1 \\\\le i < j \\\\le 100$ and $|a_ib_j - a_j b_i|=1$ . Determine the largest possible value of $N$ over all possible choices of the $100$ ordered pairs.\"}","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":[]}