{"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":"d4736454-b2bb-59d7-aba7-a21cfde4b815","task_key":"test--d4736454-b2bb-59d7-aba7-a21cfde4b815","task_revision_id":"1","upstream_id":"","short_description":"I have two cents and Bill has $n$ cents. Bill wants to buy some pencils, which…","config":"","split":"test","body":"{\"problem\":\"I have two cents and Bill has $n$ cents. Bill wants to buy some pencils, which come in two different packages. One package of pencils costs 6 cents for 7 pencils, and the other package of pencils costs a dime for a dozen pencils (i.e. 10 cents for 12 pencils). Bill notes that he can spend all $n$ of his cents on some combination of pencil packages to get $P$ pencils. However, if I give my two cents to Bill, he then notes that he can instead spend all $n+2$ of his cents on some combination of pencil packages to get fewer than $P$ pencils. What is the smallest value of $n$ for which this is possible?\"}","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":[]}