{"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":"d0b0fe4b-8972-5aa3-89c2-8a5dc152e127","task_key":"test--d0b0fe4b-8972-5aa3-89c2-8a5dc152e127","task_revision_id":"1","upstream_id":"","short_description":"A palindrome is a positive integer which reads in the same way in both…","config":"","split":"test","body":"{\"problem\":\"A palindrome is a positive integer which reads in the same way in both directions (for example, $1$, $343$ and $2002$ are palindromes, while $2005$ is not). Is it possible to find $2005$ pairs in the form of $(n, n + 110)$ where both numbers are palindromes?\"}","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":[]}