{"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":"7c98dc3d-1998-5fd5-92e9-a5de883998fc","task_key":"test--7c98dc3d-1998-5fd5-92e9-a5de883998fc","task_revision_id":"1","upstream_id":"","short_description":"(Lucas Numbers) The Lucas numbers are defined by $L_{0}=2, L_{1}=1$, and…","config":"","split":"test","body":"{\"problem\":\"(Lucas Numbers) The Lucas numbers are defined by $L_{0}=2, L_{1}=1$, and $L_{n+2}=L_{n+1}+L_{n}$ for every $n \\\\geq 0$. There are $N$ integers $1 \\\\leq n \\\\leq 2016$ such that $L_{n}$ contains the digit 1 . Estimate $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":[]}