Search results
Create the page "2017 AMC 12A Problems/Problem Last Problem" on this wiki! See also the search results found.
Page title matches
- ==Problem== ...s of the interior angles of a convex polygon and arrives at a sum of <math>2017</math>. She then discovers that she forgot to include one angle. What is th1 KB (212 words) - 13:56, 10 June 2023
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=1|num-a=3}}1 KB (179 words) - 06:03, 14 September 2024
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=15|num-a=17}}2 KB (353 words) - 13:21, 19 December 2020
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=7|num-a=9}}3 KB (508 words) - 06:22, 14 September 2024
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=4|num-a=6}}910 bytes (143 words) - 14:42, 9 June 2023
- ==Problem== These are a graphical representation of all 24 values of z, as stated in the problem. Now, we want <math>z^6</math> to be real. The only 2 cases where this happ4 KB (636 words) - 00:42, 19 September 2024
- ==Problem== ...if <math>n</math> is odd and greater than <math>1</math>. What is <math>f(2017)</math>?1 KB (226 words) - 06:23, 14 September 2024
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=5|num-a=7}}1 KB (210 words) - 06:12, 14 September 2024
- ==Problem== ...ng <math>1</math>, the last digit <math>9</math> carries over, turning the last digit into <math>0</math>. If the next digit is also a <math>9</math>, this3 KB (561 words) - 02:20, 4 November 2024
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=6|num-a=8}}1 KB (233 words) - 06:18, 14 September 2024
- ==Problem== ...</math>, inclusive, satisfy the equation <math>(\log_b a)^{2017}=\log_b(a^{2017})?</math>1 KB (213 words) - 22:34, 16 September 2024
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=9|num-a=11}}1 KB (196 words) - 06:09, 14 September 2024
- ==Problem== {{AMC10 box|year=2017|ab=A|num-b=10|num-a=12}}1 KB (167 words) - 06:34, 14 September 2024
- ==Problem== Chloe chooses a real number uniformly at random from the interval <math> [ 0,2017 ]</math>. Independently, Laurent chooses a real number uniformly at random3 KB (381 words) - 13:58, 10 June 2023
- ==Problem== {{AMC12 box|year=2017|ab=A|num-b=12|num-a=14}}2 KB (244 words) - 17:26, 7 August 2020
- == Problem == {{AMC10 box|year=2017|ab=A|num-b=11|num-a=13}}3 KB (446 words) - 13:58, 10 June 2023
- ==Problem== .../math> ways to fill the center chair times <math>2</math> ways to fill the last two chairs yields <math>2 * 2 * 2 * 2 = 16</math> ways to fill the chairs.2 KB (295 words) - 10:48, 12 February 2017
- ==Problem== Solving the original problem, <math>f(1)=1 + 1 + b + 100 + c = 102+b+c=102+900-8009=\boxed{\textbf{©}\,10 KB (1,861 words) - 09:47, 17 October 2021
- ==Problem== {{AMC12 box|year=2017|ab=A|num-b=14|num-a=16}}3 KB (564 words) - 13:12, 23 October 2021
- ==Problem== It is possible to solve this problem using elementary counting methods. This solution proceeds by a cleaner gene18 KB (2,901 words) - 00:24, 3 November 2024
Page text matches
- ...d only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. ==== Problem ====9 KB (1,703 words) - 00:20, 7 December 2024
- ...0, AMC 12, and AIME competitions it is very common to use WLOG in geometry problems by assuming one undefined side length to be equal to 1. == Problems using WLOG ==2 KB (318 words) - 22:35, 13 September 2024
- ...ake. Sometimes, the administrator may ask other people to sign up to write problems for the contest. Mock AMCs are usually very popular in the months leading up to the actual [[AMC]] competition. There is no guarantee that community members will make Mock51 KB (6,175 words) - 20:41, 27 November 2024
- == Problems == Here are some problems with solutions that utilize Vieta's quadratic formulas:3 KB (528 words) - 20:24, 21 October 2024
- {{AMC12 Problems|year=2013|ab=A}} == Problem 1 ==14 KB (2,206 words) - 01:34, 9 September 2024
- '''2016 AMC 12A''' problems and solutions. The test was held on February 2, 2016. *[[2016 AMC 12A Problems]]2 KB (178 words) - 19:56, 12 December 2022
- {{AMC12 Problems|year=2014|ab=B}} ==Problem 1==13 KB (2,066 words) - 13:08, 1 November 2022
- '''2016 AMC 12B''' problems and solutions. The test was held on February 17, 2016. <!-- Link syntax: [[2016 AMC 12B Problems/Problem 1|Problem1]] -->2 KB (187 words) - 12:09, 8 February 2016
- {{AMC12 Problems|year=2016|ab=B}} ==Problem 1==14 KB (2,037 words) - 18:09, 29 July 2023
- ...into anything. Using that fact, you can use the Games theorem to solve any problem. ...oblems, which has around 73,000 bytes. EDIT: Gmaas has beaten 2008 most iT Problems! It is the longest AoPS Wiki article ever. Gmaas's article has 89,119 bytes69 KB (11,805 words) - 19:49, 18 December 2019
- '''2017 AMC 12A''' problems and solutions. The test was held on February 7, 2017. *[[2017 AMC 12A Problems]]2 KB (176 words) - 11:25, 11 March 2017
- '''2017 AMC 12B''' problems and solutions. The test was held on February 15, 2017. *[[2017 AMC 12B Problems]]2 KB (176 words) - 11:26, 11 March 2017
- {{AMC12 Problems|year=2017|ab=A}} ==Problem 1==15 KB (2,418 words) - 15:58, 7 November 2022
- {{AMC12 Problems|year=2017|ab=B}} ==Problem 1==15 KB (2,343 words) - 17:26, 25 December 2020
- Circular Inversion can be a very useful tool in solving problems involving many tangent circles and/or lines. == Problems ==12 KB (1,824 words) - 17:49, 15 February 2025
- '''2018 AMC 12A''' problems and solutions. The test was held on February 7, 2018. *[[2018 AMC 12A Problems]]2 KB (176 words) - 10:47, 29 March 2018
- '''2018 AMC 12B''' problems and solutions. The test was held on February 15, 2018. *[[2018 AMC 12B Problems]]2 KB (176 words) - 18:53, 6 July 2020
- {{AMC12 Problems|year=2018|ab=A}} ==Problem 1==15 KB (2,380 words) - 12:39, 3 July 2024
- {{AMC12 Problems|year=2018|ab=B}} == Problem 1 ==14 KB (2,118 words) - 14:36, 28 October 2021
- {{AMC12 Problems|year=2019|ab=B}} ==Problem 1==16 KB (2,480 words) - 17:31, 16 June 2024
