{"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":"154839bc-64fe-5a18-aab0-7611c590da50","task_key":"test--154839bc-64fe-5a18-aab0-7611c590da50","task_revision_id":"1","upstream_id":"","short_description":"Let $(F_n)$ be the sequence defined recursively by $F_1=F_2=1$ and…","config":"","split":"test","body":"{\"problem\":\"Let $(F_n)$ be the sequence defined recursively by $F_1=F_2=1$ and $F_{n+1}=F_n+F_{n-1}$ for $n\\\\geq 2$. Find all pairs of positive integers $(x,y)$ such that\\n$$5F_x-3F_y=1.$$\"}","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":[]}