{"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":"ff4b5898-b392-553f-a0d3-8c4b7529f7b2","task_key":"test--ff4b5898-b392-553f-a0d3-8c4b7529f7b2","task_revision_id":"1","upstream_id":"","short_description":"A sequence $y_1,y_2,\\dots,y_k$ of real numbers is called \\emph{zigzag} if $k=1$,…","config":"","split":"test","body":"{\"problem\":\"A sequence $y_1,y_2,\\\\dots,y_k$ of real numbers is called \\\\emph{zigzag} if $k=1$, or if $y_2-y_1, y_3-y_2, \\\\dots, y_k-y_{k-1}$ are nonzero and alternate in sign. Let $X_1,X_2,\\\\dots,X_n$ be chosen independently from the uniform distribution on $[0,1]$. Let $a(X_1,X_2,\\\\dots,X_n)$ be the largest value of $k$ for which there exists an increasing sequence of integers $i_1,i_2,\\\\dots,i_k$ such that $X_{i_1},X_{i_2},\\\\dots,X_{i_k}$ is zigzag. Find the expected value of $a(X_1,X_2,\\\\dots,X_n)$ for $n \\\\geq 2$.\"}","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":[]}