{"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":"6c28949d-ff70-5fe0-af49-a122ef6b0f19","task_key":"counting~5fand~5fprobability--test--6c28949d-ff70-5fe0-af49-a122ef6b0f19","task_revision_id":"1","upstream_id":"","short_description":"There are five tourist locations in Italy that Mary would like to visit, but she…","config":"counting_and_probability","split":"test","body":"{\"level\":\"Level 2\",\"problem\":\"There are five tourist locations in Italy that Mary would like to visit, but she only has time to see three.  In how many ways can she choose three of the locations to visit (the order in which she visits them does not matter)?\",\"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":[]}