{"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":"a414324e-ee10-5b76-85c7-ba8c12ed2aed","task_key":"algebra--test--a414324e-ee10-5b76-85c7-ba8c12ed2aed","task_revision_id":"1","upstream_id":"","short_description":"For a positive integer $n$, the $n^{th}$ triangular number is…","config":"algebra","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"For a positive integer $n$, the $n^{th}$ triangular number is $T(n)=\\\\dfrac{n(n+1)}{2}.$\\n\\nFor example, $T(3) = \\\\frac{3(3+1)}{2}= \\\\frac{3(4)}{2}=6$, so the third triangular number is 6.\\n\\nDetermine the smallest integer $b>2011$ such that $T(b+1)-T(b)=T(x)$ for some positive integer $x$.\",\"type\":\"Algebra\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}