Create the page "Mock AIME 5 2006-2007 Problems/Problem 1" on this wiki! See also the search results found.

• Sophie Germain Identity
  == Problems == ...emainder when <math>2^{202} +202</math> is divided by <math>2^{101}+2^{51}+1</math>? (2020 AMC10 B)
  2 KB (222 words) - 15:04, 30 December 2023
• Characteristic polynomial
  In the context of problem-solving, the characteristic polynomial is often used to find closed forms f ...Indeed, if we define <math>T = \lambda I - A</math> and let <math>\bold{T}^1, \bold{T}^2, \ldots, \bold{T}^n</math> denote the column vectors of <math>T
  19 KB (3,412 words) - 14:57, 21 September 2022
• Mock AIME 5 2006-2007
  ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME 5 2006-2007 was written by Art of Problem Solving community member Altheman.
  1 KB (172 words) - 14:37, 3 July 2012
• Mock AIME 6 2006-2007
  ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME 6 2006-2007 was written by Art of Problem Solving community member paladin8.
  1 KB (172 words) - 14:39, 3 July 2012
• Mock AIME 7 2006-2007
  ...contains the full set of test problems. The rest contain each individual problem and its solution. The Mock AIME 7 2006-2007 was written by Art of Problem Solving community member Altheman.
  1 KB (160 words) - 14:44, 3 July 2012
• Mock AIME 6 2006-2007 Problems
  ==Problem 1== [[Mock AIME 6 2006-2007 Problems/Problem 1|Solution]]
  7 KB (1,173 words) - 21:04, 7 December 2018
• Mock AIME 5 2005-2006 Problems/Problem 2
  == Problem == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=1|num-a=3}}
  752 bytes (117 words) - 21:16, 8 October 2014
• Mock AIME 5 2005-2006 Problems/Problem 3
  == Problem == ...even and <math>d_m > d_{m-1}</math> if <math>m</math> is odd for <math>m = 1,2,\ldots,k</math> (and <math>d_0 = 0</math>). Let <math>a</math> be the num
  795 bytes (133 words) - 08:14, 19 July 2016
• Mock AIME 5 2005-2006 Problems/Problem 4
  == Problem == Let <math>m</math> and <math>n</math> be integers such that <math>1 < m \le 10</math> and <math>m < n \le 100</math>. Given that <math>x = \log
  645 bytes (109 words) - 20:41, 22 March 2016
• Mock AIME 5 2005-2006 Problems/Problem 6
  == Problem == : <math>P_1(x) = 1+x+x^3+x^4+\cdots+x^{96}+x^{97}+x^{99}+x^{100}</math>
  522 bytes (77 words) - 21:17, 8 October 2014
• Mock AIME 5 2005-2006 Problems/Problem 7
  == Problem == A coin of radius <math>1</math> is flipped onto an <math>500 \times 500</math> square grid divided i
  853 bytes (134 words) - 21:18, 8 October 2014
• Mock AIME 5 2005-2006 Problems/Problem 11
  == Problem == ...Define <math>\mu(A) = \sum_{k \in A} \tau(k)</math>, where <math>\tau(k) = 1</math> if <math>k</math> has an odd number of divisors and <math>\tau(k) =
  786 bytes (131 words) - 21:19, 8 October 2014
• Mock AIME 5 2005-2006 Problems/Problem 14
  == Problem == So <math>Sin^2B=1-Cos^2B=\frac{85^2-13^2}{85^2}=\frac{84^2}{85^2}</math>
  2 KB (282 words) - 10:06, 9 August 2022

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