{"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":"c1cd20e0-cad2-59b9-9bd2-379ea61c13ef","task_key":"test--c1cd20e0-cad2-59b9-9bd2-379ea61c13ef","task_revision_id":"1","upstream_id":"","short_description":"A number of $N$ children are at a party and they sit in a circle to play a game…","config":"","split":"test","body":"{\"problem\":\"A number of $N$ children are at a party and they sit in a circle to play a game of Pass and Parcel. Because the host has no other form of entertainment, the parcel has infinitely many layers. On turn $i$, starting with $i=1$, the following two things happen in order:\\n[b]$(1)$[/b] The parcel is passed $i^2$ positions clockwise; and\\n[b]$(2)$[/b] The child currently holding the parcel unwraps a layer and claims the prize inside.\\nFor what values of $N$ will every chidren receive a prize?\\n                                                                                                                                           \\n   $Patrick \\\\ Winter \\\\, United \\\\ Kingdom$\"}","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":[]}