{"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":"345cc11a-008c-5a3a-b0ef-1a005b92def7","task_key":"number~5ftheory--test--345cc11a-008c-5a3a-b0ef-1a005b92def7","task_revision_id":"1","upstream_id":"","short_description":"Let $S$ be the set of all integers $k$ such that, if $k$ is in $S$, then…","config":"number_theory","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"Let $S$ be the set of all integers $k$ such that, if $k$ is in $S$, then $\\\\frac{17k}{66}$ and $\\\\frac{13k}{105}$ are terminating decimals. What is the smallest integer in $S$ that is greater than 2010?\",\"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":[]}