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

Page title matches

• Mock AIME 5 2005-2006 Problems/Problem 10
  == Problem == ...t <math>{2n \choose n}</math> is divisible by all the primes between <math>10</math> and <math>30</math>.
  328 bytes (45 words) - 14:15, 11 April 2018

Page text matches

• AMC 10
  The '''American Mathematics Contest 10''' ('''AMC 10'''), along with the [[AMC 12]], are the first exams in the series of exams ...are invited to take the [[American Invitational Mathematics Examination]] (AIME).
  4 KB (596 words) - 04:53, 3 February 2025
• Mock AMC
  ...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) - 21:41, 27 November 2024
• Mock AIME 1 2005-2006
  The '''Mock AIME 1 2005-2006''' was written by [[Art of Problem Solving]] community member paladin8. * [[Mock AIME 1 2005-2006/Answer Key|Answer Key]]
  1 KB (135 words) - 17:41, 21 January 2017
• Mock AIME 1 2006-2007
  The '''Mock AIME 1 2006-2007''' was written by [[Art of Problem Solving]] community member Altheman. * [[Mock AIME 1 2006-2007/Problems|Entire Exam]]
  1 KB (155 words) - 16:06, 3 April 2012
• Mock AIME 2 2006-2007
  The '''Mock AIME 2 2006-2007''' was written by [[Art of Problem Solving]] community member 4everwise. * [[Mock AIME 2 2006-2007 Problems|Entire Exam]]
  1 KB (145 words) - 10:55, 4 April 2012
• Mock AIME 1 2006-2007 Problems/Problem 2
  ...athcal{S}</math>, we have that <math>\star (n)=12</math> and <math>0\le n< 10^{7}</math>. If <math>m</math> is the number of elements in <math>\mathcal{S ...and 2 into a second. <math>7 \cdot \frac{6\cdot 5}{2} = 105</math> place 10 into one box and 1 into each of two others. Thus, this gives us <math>m =
  1 KB (188 words) - 15:53, 3 April 2012
• Mock AIME 1 2006-2007 Problems/Problem 4
  ...=x^{2}</math>. The slopes of <math>AB</math> and <math>BC</math> are <math>10</math> and <math>-9</math>, respectively. If the <math>x</math>-coordinate ...th>a + b + c = 3</math>. From the first [[slope]] condition we have <math>10 = \frac{b^2 - a^2}{b - a} = b + a</math> and from the second slope conditio
  1 KB (244 words) - 15:21, 5 November 2012
• Mock AIME 1 2006-2007 Problems/Problem 7
  ==Problem== ...3</math>. Point <math>E</math> is such that <math>CE=1</math> and <math>AE=5</math>. Construct point <math>F</math> on segment <math>BC</math> such that
  3 KB (518 words) - 16:54, 25 November 2015
• Mock AIME 1 2006-2007 Problems/Problem 9
  ==Problem== ...=1</math>, and let <math>S</math> denote the [[infinite]] sum <math>S = a_{10}+a_{11}+a_{12}+...</math>. If the sum of all possible [[distinct]] values o
  5 KB (744 words) - 19:46, 20 October 2020
• Mock AIME 1 2006-2007/Problems
  ==Problem 1== [[Mock AIME 1 2006-2007 Problems/Problem 1|Solution]]
  8 KB (1,355 words) - 14:54, 21 August 2020
• Sophie Germain Identity
  == Problems == ...ath> is divided by <math>2^{101}+2^{51}+1</math>? ([[2020 AMC 10B Problems/Problem 22|Source]])
  2 KB (210 words) - 17:05, 30 January 2025
• Characteristic polynomial
  In the context of problem-solving, the characteristic polynomial is often used to find closed forms f ...can be solved for each constant. Refer to the [[#Introductory|introductory problems]] below to see an example of how to do this. In particular, for the Fibonac
  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 3
  == Problem == ...here <math>d_i</math> denotes the <math>i</math>th digit in the base-<math>10</math> representation of <math>n</math> for <math>i = 1,2, \ldots,k</math>,
  795 bytes (133 words) - 08:14, 19 July 2016
• Mock AIME 5 2005-2006 Problems/Problem 9
  == Problem == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=8|num-a=10}}
  461 bytes (62 words) - 21:18, 8 October 2014
• Mock AIME 5 2005-2006 Problems/Problem 10
  == Problem == ...t <math>{2n \choose n}</math> is divisible by all the primes between <math>10</math> and <math>30</math>.
  328 bytes (45 words) - 14:15, 11 April 2018
• Mock AIME 5 2005-2006 Problems/Problem 11
  == Problem == {{Mock AIME box|year=2005-2006|n=5|source=76847|num-b=10|num-a=12}}
  786 bytes (131 words) - 21:19, 8 October 2014

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