{"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":"0fae04cb-a8c4-52b5-be7b-af57f75045f5","task_key":"precalculus--test--0fae04cb-a8c4-52b5-be7b-af57f75045f5","task_revision_id":"1","upstream_id":"","short_description":"Let $\\ell$ be the line in space through the points $(0,0,1)$ and $(1,1,1).$ Let…","config":"precalculus","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"Let $\\\\ell$ be the line in space through the points $(0,0,1)$ and $(1,1,1).$  Let $d$ be the length of the shortest possible path that begins at the origin, travels to a point on $\\\\ell,$ then ends at the point $(1,0,0).$  Enter $d^2.$\",\"type\":\"Precalculus\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}