Create the page "A p 11" on this wiki! See also the search results found.

• 2003 AMC 12A Problems
  {{AMC12 Problems|year=2003|ab=A}} <math> \mathrm{(A) \ } 0\qquad \mathrm{(B) \ } 1\qquad \mathrm{(C) \ } 2\qquad \mathrm{(D) \
  13 KB (1,955 words) - 21:06, 19 August 2023
• 2002 AMC 12A Problems
  {{AMC12 Problems|year=2002|ab=A}} <math> \mathrm{(A) \ } \frac{7}{2}\qquad \mathrm{(B) \ } 4\qquad \mathrm{(C) \ } 5\qquad \mat
  12 KB (1,792 words) - 13:06, 19 February 2020
• 2000 AMC 12 Problems
  <math>\textbf{(A)}\ 23 \qquad \textbf{(B)}\ 55 \qquad \textbf{(C)}\ 99 \qquad \textbf{(D)}\ <math>\textbf{(A)}\ 2000^{2001} \qquad \textbf{(B)}\ 4000^{2000} \qquad \textbf{(C)}\ 2000^{
  13 KB (1,948 words) - 12:26, 1 April 2022
• 2001 AMC 12 Problems
  <math>\text{(A)}\ 2S + 3\qquad \text{(B)}\ 3S + 2\qquad \text{(C)}\ 3S + 6 \qquad\text{(D) Let <math>P(n)</math> and <math>S(n)</math> denote the product and the sum, respectivel
  13 KB (1,957 words) - 12:53, 24 January 2024
• 2002 AMC 12B Problems
  ...numbers in the set <math>\{9, 99, 999, 9999, \ldots, 999999999\}</math> is a <math>9</math>-digit number <math>M</math>, all of whose digits are distinc <math>\mathrm{(A)}\ 0
  10 KB (1,547 words) - 04:20, 9 October 2022
• 2003 AMC 12B Problems
  \text {(A) } -1 \qquad \text {(B) } -\frac{2}{3} \qquad \text {(C) } \frac{2}{3} \qqu ...ks. A green pill costs 1 dollar more than a pink pill, and Al's pills cost a total of 546 dollars for the two weeks. How much does one green pill cost?
  13 KB (1,987 words) - 18:53, 10 December 2022
• 2005 AMC 12B Problems
  A scout troop buys <math>1000</math> candy bars at a price of five for <math>2</math> dollars. They sell all the candy bars at t \mathrm{(A)}\ 100 \qquad
  12 KB (1,781 words) - 12:38, 14 July 2022
• 2006 AMC 12B Problems/Problem 12
  ...(p,p)</math> and <math>y</math>-intercept <math>(0,-p)</math>, where <math>p\ne 0</math>. What is <math>b</math>? ...t {(B) } 0 \qquad \text {(C) } 2 \qquad \text {(D) } 4 \qquad \text {(E) } p</math>
  1 KB (239 words) - 22:20, 17 October 2020
• 2006 AMC 12B Problems/Problem 13
  <asy> defaultpen(linewidth(0.7)+fontsize(11)); pair A=origin, B=(2,0), C=(3, sqrt(3)), D=(1, sqrt(3)), E=(1, 1/sqrt(3)), F=(2, 2/
  3 KB (447 words) - 03:49, 16 January 2021
• 2006 AMC 12B Problems/Problem 15
  ...s <math> C</math> and <math> D</math> are on the circle centered at <math> P</math>, such that <math> \overline{AD}</math> and <math> \overline{BC}</mat unitsize(0.4 cm); defaultpen(linewidth(0.7) + fontsize(11));
  3 KB (458 words) - 16:40, 6 October 2019
• 2006 AMC 12B Problems/Problem 23
  ...re <math>a</math> and <math>b</math> are positive integers. What is <math>a+b</math>? pair A = (B.y,0);
  7 KB (1,169 words) - 14:04, 10 June 2022
• 2005 AMC 12B Problems/Problem 11
  {{duplicate|[[2005 AMC 12B Problems|2005 AMC 12B #11]] and [[2005 AMC 10B Problems|2005 AMC 10B #15]]}} <math>\textbf{(A) }\ {{{\frac{1}{4}}}} \qquad \textbf{(B) }\ {{{\frac{2}{5}}}} \qquad \textb
  4 KB (607 words) - 21:01, 20 May 2023
• 2005 AMC 12B Problems/Problem 12
  ...<math>m,n,</math> and <math>p</math> is zero. What is the value of <math>n/p</math>? <math>\textbf{(A) }\ {{{1}}} \qquad \textbf{(B) }\ {{{2}}} \qquad \textbf{(C) }\ {{{4}}} \qq
  2 KB (317 words) - 12:27, 16 December 2021
• Set
  ...ms, see [[Zermelo-Fraenkel Axioms]]. In this article we shall present just a brief discussion of the most common properties of sets and operations relat ...g: <math>\{1,4,5,3,24,4,4,5,6,2\}</math> Such an entity is actually called a multiset.
  11 KB (2,021 words) - 00:00, 17 July 2011
• 2005 AIME II Problems
  A game uses a deck of <math> n </math> different cards, where <math> n </math> is an inte ...e indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one r
  7 KB (1,119 words) - 21:12, 28 February 2020
• 2005 AIME II Problems/Problem 12
  ...r </math> is not divisible by the [[square]] of any [[prime]], find <math> p+q+r. </math> ...D--A);draw(E--O--F);draw(G--O); dot(A^^B^^C^^D^^E^^F^^G^^O); label("\(A\)",A,(-1,1));label("\(B\)",B,(1,1));label("\(C\)",C,(1,-1));label("\(D\)",D,(-1,
  13 KB (2,080 words) - 21:20, 11 December 2022
• 2005 AIME I Problems
  ...ngent to two circles adjacent to it. All circles are internally tangent to a circle <math> C </math> with radius 30. Let <math> K </math> be the area of ...members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Fi
  6 KB (983 words) - 05:06, 20 February 2019
• 2005 AIME I Problems/Problem 3
  ...p\cdot q</math> or <math>n=p^3</math> for distinct [[prime number]]s <math>p</math> and <math>q</math>. ...h>47</math>) so there are <math> {15 \choose 2} =105</math> ways to choose a pair of primes from the list and thus <math>105</math> numbers of the first
  2 KB (249 words) - 09:37, 23 January 2024
• 2005 AIME I Problems/Problem 10
  ...has [[slope]] <math> -5. </math> Find the largest possible value of <math> p+q. </math> pair A=(15,32), B=(12,19), C=(23,20), M=B/2+C/2, P=(17,22);
  5 KB (852 words) - 21:23, 4 October 2023
• 2004 AIME I Problems/Problem 7
  Let our [[polynomial]] be <math>P(x)</math>. ...h>P(x)</math> is <math>-1 + 2 - 3 + \ldots + 14 - 15 = -8</math>, so <math>P(x) = 1 -8x + Cx^2 + Q(x)</math>, where <math>Q(x)</math> is some polynomial
  5 KB (833 words) - 19:43, 1 October 2023

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