{"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":"1a50a8a6-47c4-5765-945c-1898eb864da0","task_key":"counting~5fand~5fprobability--test--1a50a8a6-47c4-5765-945c-1898eb864da0","task_revision_id":"1","upstream_id":"","short_description":"How many distinguishable ways are there to write $9$ as the sum of $1\\text{'s},$…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"How many distinguishable ways are there to write $9$ as the sum of $1\\\\text{'s},$ $2\\\\text{'s},$ and $4\\\\text{'s},$ where the order of the addends matters? For example, $4 + 4 + 1$ and $1 + 4 + 4$ are two different ways.\",\"type\":\"Counting & Probability\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}