{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"math","formal_name":"MATH","introduction":"MATH organises 12,500 high-school competition problems into seven subjects and five difficulty levels, each with a full worked solution. It underlies much of the later mathematics evaluation work; this catalogue imports the full test split: 5,000 problems across all seven subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/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":"0cc9a4f3-0639-51f0-b46b-7dcaec69e682","task_key":"intermediate~5falgebra--test--0cc9a4f3-0639-51f0-b46b-7dcaec69e682","task_revision_id":"1","upstream_id":"","short_description":"For a positive integer $m,$ let $f(m) = m^2 + m + 1$. Find the largest positive…","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"For a positive integer $m,$ let $f(m) = m^2 + m + 1$.  Find the largest positive integer $n$ such that\\n\\\\[1000 f(1^2) f(2^2) \\\\dotsm f(n^2) \\\\ge f(1)^2 f(2)^2 \\\\dotsm f(n)^2.\\\\]\",\"type\":\"Intermediate Algebra\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}