{"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":"fc06abf7-1bfa-51c1-b6b6-53865b2b1190","task_key":"test--fc06abf7-1bfa-51c1-b6b6-53865b2b1190","task_revision_id":"1","upstream_id":"","short_description":"[b]a)[/b] Is it possible to find a function $f:\\mathbb N^2\\to\\mathbb N$ such…","config":"","split":"test","body":"{\"problem\":\"[b]a)[/b] Is it possible to find a function $f:\\\\mathbb N^2\\\\to\\\\mathbb N$ such that for every function $g:\\\\mathbb N\\\\to\\\\mathbb N$ and positive integer $M$ there exists $n\\\\in\\\\mathbb N$ such that set $\\\\left\\\\{k\\\\in \\\\mathbb N : f(n,k)=g(k)\\\\right\\\\}$ has at least $M$ elements?\\n[b]b)[/b] Is it possible to find a function $f:\\\\mathbb N^2\\\\to\\\\mathbb N$ such that for every function $g:\\\\mathbb N\\\\to\\\\mathbb N$ there exists $n\\\\in \\\\mathbb N$ such that set  $\\\\left\\\\{k\\\\in\\\\mathbb N : f(n,k)=g(k)\\\\right\\\\}$ has an infinite number of elements?\"}","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":[]}