{"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":"6c14de46-4dd6-50af-b8ac-40a95c8b6a7e","task_key":"test--6c14de46-4dd6-50af-b8ac-40a95c8b6a7e","task_revision_id":"1","upstream_id":"","short_description":"There are $F$ fractions $\\frac{m}{n}$ with the properties: $m$ and $n$ are…","config":"","split":"test","body":"{\"problem\":\"There are $F$ fractions $\\\\frac{m}{n}$ with the properties: $m$ and $n$ are positive integers with $m<n$, $\\\\frac{m}{n}$ is in lowest terms, $n$ is not divisible by the square of any integer larger than 1, and the shortest sequence of consecutive digits that repeats consecutively and indefinitely in the decimal equivalent of $\\\\frac{m}{n}$ has length 6. We define $G=F+p$, where the integer $F$ has $p$ digits. What is the sum of the squares of the digits of $G$?\"}","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":[]}