{"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":"3dcfd7c4-6a02-5591-ac51-119c126b84d5","task_key":"number~5ftheory--test--3dcfd7c4-6a02-5591-ac51-119c126b84d5","task_revision_id":"1","upstream_id":"","short_description":"To determine whether a number $\\textit{N}$ is prime, we must test for…","config":"number_theory","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"To determine whether a number $\\\\textit{N}$ is prime, we must test for divisibility by every prime less than or equal to the square root of $\\\\textit{N}$. How many primes must we test to determine whether $2003$ is prime?\",\"type\":\"Number Theory\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}