Create the page "2015 AIME Problems/Problem 3" on this wiki! See also the search results found.

Page title matches

• Mock AIME I 2015 Problems/Problem 3
  ==Problem 3== First note that <math>\triangle APB</math> is a 3-4-5 scaled right triangle with <math>\overline{B P}=15</math> and <math>\tr
  2 KB (278 words) - 23:31, 10 June 2015
• 2015 AIME II Problems/Problem 3
  ==Problem== 102 & 3 \\
  5 KB (741 words) - 14:03, 14 February 2023
• 2015 AIME I Problems/Problem 3
  ==Problem== ==Video Solution For Problems 1-3==
  6 KB (1,031 words) - 23:19, 23 January 2024

Page text matches

• American Invitational Mathematics Examination
  ...ed States at the [[International Mathematics Olympiad]] (IMO). While most AIME participants are high school students, some bright middle school students a High scoring AIME students are invited to take the prestigious [[United States of America Mat
  8 KB (1,057 words) - 12:02, 25 February 2024
• Joining an ARML team
  ...e Spring Semester to determine the team each year. The 6 practices include 3 individual tests to help determine the team and some lectures on certain ma * Performance on problems at practice sessions.
  21 KB (3,500 words) - 18:41, 23 April 2024
• Principle of Inclusion-Exclusion
  ...d only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. ==== Problem ====
  9 KB (1,703 words) - 07:25, 24 March 2024
• Mock AMC
  ...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) - 20:58, 6 December 2023
• 2006 AIME I Problems/Problem 11
  == Problem == ...are 2 towers which use blocks <math>1, 2</math>, so there are <math>2\cdot 3^6 = 1458</math> towers using blocks <math>1, 2, \ldots, 8</math>, so the an
  3 KB (436 words) - 05:40, 4 November 2022
• Chicken McNugget Theorem
  ...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 largest
  17 KB (2,748 words) - 19:22, 24 February 2024
• 2015 AIME I Problems
  {{AIME Problems|year=2015|n=I}} ==Problem 1==
  10 KB (1,615 words) - 21:48, 13 January 2024
• Mock AIME I 2015
  ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME I 2015 was written by Art of Problem Solving community members djmathman and Binomial-Theorem.
  1 KB (154 words) - 15:18, 8 September 2014
• Mock AIME I 2015 Problems
  == Problem 1 == [[Mock AIME I 2015 Problems/Problem 1|Solution]]
  9 KB (1,463 words) - 14:48, 12 February 2017
• 2014 AMC 12B
  '''2014 AMC 12B''' problems and solutions. The test was held on February 19, 2014. *[[2014 AMC 12B Problems]]
  2 KB (178 words) - 16:53, 24 January 2020
• 2014 AIME II
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2014 AIME II Problems|Entire Test]]
  1 KB (132 words) - 18:49, 1 June 2020
• 2014 AIME II Problems
  {{AIME Problems|year=2014|n=II}} ==Problem 1==
  8 KB (1,410 words) - 00:04, 29 December 2021
• 2015 AMC 10B Problems/Problem 22
  ==Problem== ...) } 3 \qquad\textbf{(B) } 12-4\sqrt5 \qquad\textbf{(C) } \dfrac{5+2\sqrt5}{3} \qquad\textbf{(D) } 1+\sqrt5 \qquad\textbf{(E) } \dfrac{11+11\sqrt5}{10} <
  7 KB (1,146 words) - 14:09, 13 April 2024
• 2015 AMC 10A Problems/Problem 14
  ==Problem== <math> \textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o
  9 KB (1,380 words) - 09:00, 1 December 2023
• 2015 AIME I
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2015 AIME I Problems|Entire Test]]
  1 KB (133 words) - 18:50, 1 June 2020
• 2015 AIME II
  ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2015 AIME II Problems|Entire Test]]
  1 KB (133 words) - 18:50, 1 June 2020
• 2015 AIME I Problems/Problem 2
  ==Problem== ...Cooperation Conference include <math>2</math> officials from Mexico, <math>3</math> officials from Canada, and <math>4</math> officials from the United
  6 KB (936 words) - 12:22, 4 September 2023
• 2015 AIME I Problems/Problem 3
  ==Problem== ==Video Solution For Problems 1-3==
  6 KB (1,031 words) - 23:19, 23 January 2024
• 2015 AIME I Problems/Problem 8
  ==Problem== You know whatever <math>n</math> is, it has to have 3 digits, because if it had only two, the maximum of <math>s(n)</math> is 18.
  10 KB (1,797 words) - 14:06, 21 January 2024
• 2015 AIME I Problems/Problem 15
  ==Problem== currentprojection=orthographic(-1,-5,3);
  9 KB (1,407 words) - 19:37, 17 February 2024

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)