{"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":"7a9d2552-7837-582b-9d9f-4f42cc443d8f","task_key":"test--7a9d2552-7837-582b-9d9f-4f42cc443d8f","task_revision_id":"1","upstream_id":"","short_description":"For each positive digit $D$ and positive integer $k$, we use the symbol…","config":"","split":"test","body":"{\"problem\":\"For each positive digit $D$ and positive integer $k$, we use the symbol $D_{(k)}$ to represent the positive integer having exactly $k$ digits, each of which is equal to $D$. For example, $2_{(1)}=2$ and $3_{(4)}=3333$. There are $N$ quadruples $(P, Q, R, k)$ with $P, Q$ and $R$ positive digits, $k$ a positive integer with $k \\\\leq 2018$, and $P_{(2k)}-Q_{(k)}=\\\\left(R_{(k)}\\\\right)^{2}$. What is the sum of the digits of $N$?\"}","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":[]}