{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"8a28e988-9f33-5b1c-91b7-8bfea1d7514f","task_key":"test--8a28e988-9f33-5b1c-91b7-8bfea1d7514f","task_revision_id":"3","upstream_id":"","short_description":"An integer partition, is a way of writing n as a sum of positive integers. Two…","config":"","split":"test","body":"{\"problem\":\"An integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition.\\n[quote]For example, 4 can be partitioned in five distinct ways:\\n4\\n3 + 1\\n2 + 2\\n2 + 1 + 1\\n1 + 1 + 1 + 1[/quote]\\nThe number of partitions of n is given by the partition function $p\\\\left ( n \\\\right )$. So $p\\\\left ( 4 \\\\right ) = 5$ .\\nDetermine all the positive integers so that $p\\\\left ( n \\\\right )+p\\\\left ( n+4 \\\\right )=p\\\\left ( n+2 \\\\right )+p\\\\left ( n+3 \\\\right )$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}