Search results
Create the page "Mock AIME 1 2010 Problems/Problem 11" on this wiki! See also the search results found.
- ...ake. Sometimes, the administrator may ask other people to sign up to write problems for the contest. ...AMC]] competition. There is no guarantee that community members will make Mock AMCs in any given year, but there probably will be one.51 KB (6,175 words) - 20:41, 27 November 2024
- The '''Mock AIME 1 2010''' was created by AoPS users Brut3Forc3, dysfunctionalequations, and Zhero. * [[Mock AIME 1 2010 Problems | Problems]]1 KB (117 words) - 18:42, 28 January 2023
- In the context of problem-solving, the characteristic polynomial is often used to find closed forms f <center><cmath>P_A(t) = \begin{vmatrix}t-a_{11} & -a_{12} & \cdots & -a_{1n} \ -a_{21} & t-a_{22} & \cdots & -a_{2n} \ \19 KB (3,412 words) - 13:57, 21 September 2022
- == Problem 1 == ...th>. Find the number of perfect squares among <math>\{a_1, a_2, \ldots, a_{2010}\}</math>.8 KB (1,377 words) - 12:20, 2 August 2024
- The '''Mock AIME 2 2010''' was created by AoPS users [[User:Andersonw|andersonw]], [[User:Brut3Forc * [[Mock AIME 2 2010 Problems | Problems]]1 KB (126 words) - 18:44, 28 January 2023
- {{AIME Problems|year=Mock|n=2 2010}} == Problem 1 ==7 KB (1,150 words) - 08:10, 8 October 2018
- The '''Mock AIME 3 2010''' was created by AoPS users andersonw, [[User:Brut3Forc3|Brut3Forc3]], dys * [[Mock AIME 3 2010 Problems | Problems]]1 KB (127 words) - 14:16, 3 July 2012
- Mock AIME III April 1, 201014 KB (2,904 words) - 17:24, 16 May 2017
- ==Problem== ...atisfy <math>f(f(x)) = f(f(f(x)))</math> for all <math>x</math> in <math>\{1, 2, 3, 4, 5\}</math>.11 KB (1,796 words) - 13:39, 5 November 2022
- == Problem 1 == [[2013 Mock AIME I Problems/Problem 1|Solution]]7 KB (1,159 words) - 08:15, 30 July 2024
- == Problem == .../math> boxes. Because there are two such factors (<math>3</math> and <math>11</math>), together they have <math>8^2</math> possibilities. For each square2 KB (316 words) - 08:46, 2 August 2024