Search results
Create the page "2019 AIME Problems/Problem 17" on this wiki! See also the search results found.
- ==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
- 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. 17. Gmaas is so interesting that an entire science has been devoted to studyin69 KB (11,805 words) - 20:49, 18 December 2019
- {{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== ...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== draw(circumcircle(A,B,(-17/8,0)),rgb(.7,.7,.7));14 KB (2,229 words) - 14:57, 27 December 2024
- {{AIME Problems|year=2019|n=II}} ==Problem 1==7 KB (1,254 words) - 14:45, 21 August 2023
- ==Problem== ...congruent with <math>AB = 9</math>, <math>BC=AD=10</math>, and <math>CA=DB=17</math>. The intersection of these two triangular regions has area <math>\tf9 KB (1,508 words) - 14:02, 7 September 2024
- ==Problem== Another way to solve this problem is to do casework on all the perfect squares from <math>1^2</math> to <math20 KB (3,220 words) - 03:24, 14 August 2024
- ==Problem== ...th>16</math> or <math>16</math> and <math>17</math>. Only <math>\boxed{(16,17)}</math> works.7 KB (1,208 words) - 09:21, 4 October 2022
- ==Problem== Find the least odd prime factor of <math>2019^8+1</math>.8 KB (1,264 words) - 01:22, 7 March 2024
- ...hing. Using that fact, you can use the Almighty Gmaas theorem to solve any problem. 17. Almighty Gmaas is so interesting that an entire science has been devoted99 KB (14,096 words) - 23:49, 19 February 2025
- ==Problem== ...h> be the number of real-valued solutions to the equation <math>f(f(f(x)))=17</math> for <math>0\leq x\leq 2020</math>. Find the remainder when <math>N</7 KB (1,187 words) - 05:58, 3 February 2025
- ==Problem== ...138}=\frac{204}{384}=\frac{17}{32},</cmath> from which the answer is <math>17+32=\boxed{049}.</math>17 KB (2,722 words) - 18:32, 23 January 2023
- c. 17,000-15,000 BC: The Lascaux cave paintings contain depictions of an omnipote - 2019: The burning of Notre Dame causes many of Gmaas's bibles to be burnt. Immed89 KB (15,007 words) - 15:02, 19 February 2025
- [[2019 AIME II Problems/Problem 15]] Solution 5 [[2023 USAJMO Problems/Problem 6]] Solution 110 KB (1,116 words) - 12:37, 11 June 2024
- ...into anything. Using that fact, you can use the Games theorem to solve any problem. 17. Gmaas is so interesting that an entire science has been devoted to studyin69 KB (11,828 words) - 19:26, 3 September 2024
