{"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":"db35740e-a473-5fb5-bbf3-74f4f2067190","task_key":"test--db35740e-a473-5fb5-bbf3-74f4f2067190","task_revision_id":"1","upstream_id":"","short_description":"Let $k$ be a fixed even positive integer, $N$ is the product of $k$ distinct…","config":"","split":"test","body":"{\"problem\":\"Let $k$ be a fixed even positive integer, $N$ is the product of $k$ distinct primes $p_1,...,p_k$, $a,b$ are two positive integers, $a,b\\\\leq N$. Denote \\n$S_1=\\\\{d|$ $d|N, a\\\\leq d\\\\leq b, d$ has even number of prime factors$\\\\}$,\\n$S_2=\\\\{d|$ $d|N, a\\\\leq d\\\\leq b, d$ has odd number of prime factors$\\\\}$,\\nProve: $|S_1|-|S_2|\\\\leq C^{\\\\frac{k}{2}}_k$\"}","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":[]}