Search results
Create the page "All AMC Problems and Solutions" on this wiki! See also the search results found.
- ...ng]] disciplines, including [[informatics]], [[physics]], [[programming]], and others. ...elebrate [[AoPS Community Awards | achievements of AoPS students, faculty, and community members]].5 KB (624 words) - 14:58, 13 January 2025
- ...many levels of problem solvers. Many also have links to books, websites, and other resources relevant to the topic. ...i's [https://www.tmasacademy.com/ace-the-amc10-12-free-book ACE The AMC 10 and 12 book]17 KB (2,291 words) - 22:33, 13 January 2025
- ...math books''' are recommended by [[Art of Problem Solving]] administrators and members of the [http://aops.com/community AoPS Community]. Levels of reading and math ability are loosely defined as follows:24 KB (3,202 words) - 14:33, 13 January 2025
- ...ed annually by the [[American Mathematics Competitions]] (AMC) to students all over the United States. ...more challenging [[AMC 10]] exam. However, there is no requirement for the AMC 10 besides the fact that you have to be 10<math>^\text{th}</math> grade or4 KB (576 words) - 18:36, 22 September 2024
- ...ica Junior Mathematics Olympiad (USAJMO) for qualification from taking the AMC 10. ...rica]] (MAA). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC!8 KB (1,067 words) - 19:15, 24 October 2024
- ...viation for American Math Contest, used to refer to the AMC 8, AMC 10, and AMC 12. == AMC Contests ==5 KB (696 words) - 02:47, 24 December 2019
- ...]] (AMC). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC and of the recent expansion of USAMO participants from around 250 to around 500 ...SAMO have considerable experience both solving highly challenging problems and [[writing proofs]].6 KB (874 words) - 22:02, 10 November 2024
- If <math>{a}</math> is an [[integer]], <math>{p}</math> is a [[prime number]] and <math>{a}</math> is not [[divisibility|divisible]] by <math>{p}</math>, the ...l case of [[Euler's Totient Theorem]], which states that if <math>a</math> and <math>n</math> are relatively prime integers, then <math>a^{\varphi(n)} \eq16 KB (2,660 words) - 22:42, 28 August 2024
- ...find the solutions of <math> x^2 = -1 </math> but we can now find ''all'' solutions to ''every'' polynomial. (See the [[Fundamental Theorem of Algebra]] for m ...r of the form <math> a + bi </math> where <math> a,b\in \mathbb{R} </math> and <math> i = \sqrt{-1} </math> is the [[imaginary unit]]. The set of complex5 KB (860 words) - 14:36, 10 December 2023
- ...with common difference <math>-8</math>; however, <math>7, 0, 7, 14</math> and <math>4, 12, 36, 108, \ldots</math> are not arithmetic sequences, as the di ...math>, <math>b</math>, and <math>c</math> are in arithmetic progression if and only if <math>b - a = c - b</math>.4 KB (736 words) - 01:00, 7 March 2024
- {{AMC12 Problems|year=2006|ab=B}} [[2006 AMC 12B Problems/Problem 1|Solution]]13 KB (2,058 words) - 11:36, 4 July 2023
- {{AMC12 Problems|year=2006|ab=A}} ...each. How many dollars will it cost to purchase <math>5</math> sandwiches and <math>8</math> sodas?15 KB (2,223 words) - 12:43, 28 December 2020
- {{AMC12 Problems|year=2005|ab=A}} Two is <math>10 \%</math> of <math>x</math> and <math>20 \%</math> of <math>y</math>. What is <math>x - y</math>?13 KB (1,965 words) - 21:18, 7 September 2024
- {{AMC12 Problems|year=2004|ab=A}} [[2004 AMC 12A Problems/Problem 1|Solution]]13 KB (1,953 words) - 23:31, 25 January 2023
- {{AMC12 Problems|year=2003|ab=A}} ...rence between the sum of the first <math>2003</math> even counting numbers and the sum of the first <math>2003</math> odd counting numbers?13 KB (1,955 words) - 20:06, 19 August 2023
- {{AMC12 Problems|year=2002|ab=A}} Compute the sum of all the roots of12 KB (1,792 words) - 12:06, 19 February 2020
- {{AMC12 Problems|year=2000|ab=}} ...s will host the International Mathematical Olympiad. Let <math>I,M,</math> and <math>O</math> be distinct positive integers such that the product <math>I13 KB (1,948 words) - 09:35, 16 June 2024
- {{AMC12 Problems|year=2001|ab=}} ...numbers is <math>S</math>. Suppose <math>3</math> is added to each number and then13 KB (1,957 words) - 11:53, 24 January 2024
- {{AMC12 Problems|year=2002|ab=B}} ...ldots, 999999999\}</math> is a <math>9</math>-digit number <math>M</math>, all of whose digits are distinct. The number <math>M</math> does not contain th10 KB (1,547 words) - 03:20, 9 October 2022
- {{AMC12 Problems|year=2003|ab=B}} [[2003 AMC 12B Problems/Problem 1|Solution]]13 KB (1,987 words) - 17:53, 10 December 2022