Search results
Create the page "2019 AIME Problems/Problem 5" on this wiki! See also the search results found.
Page title matches
- ==Problem== ...y of <math>1 \cdot \frac{1}{27} + \frac{4!}{2!} \cdot \frac{1}{81} + \frac{5!}{2! \cdot 2!} \cdot \frac{1}{243} +\frac{6!}{3! \cdot 3!} \cdot \frac{1}{74 KB (668 words) - 23:07, 4 January 2025
- ==Problem== ...uniquely determined, so this method works, giving us <math>7 \cdot 6 \cdot 5 \cdot 12 = 2520</math> ways. We are asked to find the remainder when <math>9 KB (1,464 words) - 19:16, 3 January 2025
Page text matches
- ...ake. Sometimes, the administrator may ask other people to sign up to write problems for the contest. * Look at past [[AMC]]/[[AHSME]] tests to get a feel for what kind of problems you should write and what difficulty level they should be.51 KB (6,175 words) - 21:41, 27 November 2024
- ==Problem== This problem is essentially asking how many ways there are to choose <math>2</math> dist5 KB (831 words) - 18:47, 29 January 2025
- ...n McNugget Theorem''' (or '''Postage Stamp Problem''' or '''Frobenius Coin Problem''') states that for any two [[relatively prime]] [[positive integer]]s <mat ...t Theorem has also been called the Frobenius Coin Problem or the Frobenius Problem, after German mathematician Ferdinand Frobenius inquired about the largest17 KB (2,823 words) - 23:06, 15 November 2024
- ...eorems concerning [[polygon]]s, and is helpful in solving complex geometry problems involving lengths. In essence, it involves using a local [[coordinate syst ...school students made it popular. The technique greatly simplifies certain problems.5 KB (812 words) - 15:43, 1 March 2025
- It is used to solve problems of the form: how many ways can one distribute <math>k</math> indistinguisha ...ach urn, then there would be <math>{n \choose k}</math> possibilities; the problem is that you can repeat urns, so this does not work.<math>n</math> and then5 KB (795 words) - 17:39, 31 December 2024
- ...into anything. Using that fact, you can use the Games theorem to solve any problem. 5. Gmaas owned many memes. Then they died. He left the meme business because69 KB (11,805 words) - 20:49, 18 December 2019
- ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2018 AIME II Problems|Entire Test]]1 KB (133 words) - 18:13, 18 March 2020
- ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2019 AIME I Problems|Entire Test]]1 KB (133 words) - 17:41, 29 March 2019
- ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2019 AIME II Problems|Entire Test]]1 KB (133 words) - 15:43, 22 March 2019
- ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2020 AIME I Problems|Entire Test]]1 KB (133 words) - 18:11, 18 March 2020
- {{AIME Problems|year=2018|n=II}} ==Problem 1==9 KB (1,385 words) - 00:26, 21 January 2024
- Here are the problems from the 2019 AMC 10C, a mock contest created by the AoPS user fidgetboss_4000. ==Problem 1==12 KB (1,917 words) - 12:14, 29 November 2021
- ==Problem== label("$\ell_A$",J+9/8*(L-J),1.5*dir(B--C));7 KB (1,053 words) - 14:58, 14 January 2024
- ==Problem== ...roof that <math>a \cos A = PQ</math> can be found here: http://www.irmo.ie/5.Orthic_triangle.pdf7 KB (1,129 words) - 16:27, 6 January 2025
- ==Problem== ...ing <math>2019</math>, and <math>f\left(\tfrac{1+\sqrt{3}i}{2}\right)=2015+2019\sqrt{3}i</math>. Find the remainder when <math>f(1)</math> is divided by <m4 KB (706 words) - 22:18, 28 December 2023
- ==Problem== ...pretty. Let <math>S</math> be the sum of positive integers less than <math>2019</math> that are <math>20</math>-pretty. Find <math>\tfrac{S}{20}</math>.3 KB (474 words) - 01:38, 22 December 2024
- ==Problem== <cmath>n=5\implies(270,360)</cmath>8 KB (1,172 words) - 18:21, 8 August 2024
- ==Problem== label("$\omega_1$",(-4.5,1));14 KB (2,229 words) - 14:57, 27 December 2024
- ==Problem== ...ath> such that, given an unlimited supply of stamps of denominations <math>5,n,</math> and <math>n+1</math> cents, <math>91</math> cents is the greatest9 KB (1,543 words) - 19:48, 3 January 2025
- {{AIME Problems|year=2019|n=I}} ==Problem 1==8 KB (1,331 words) - 06:57, 4 January 2021