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

• 2016 AMC 10A Problems/Problem 12
  ...Which of the following is a correct statement about the probability <math>p</math> that the product of the three integers is odd? ...{1}{8}<p<\dfrac{1}{3}\qquad\textbf{(D)}\ p=\dfrac{1}{3}\qquad\textbf{(E)}\ p>\dfrac{1}{3}</math>
  2 KB (297 words) - 14:54, 25 June 2023
• Math books
  ...https://artofproblemsolving.com/community/user/243060 cargeek9], currently a junior in high school. It covers the basics of algebra, geometry, combinato ...3265/ref=sr_1_1?ie=UTF8&s=books&qid=1204029652&sr=1-1 Complex Numbers from A to... Z] by [[Titu Andreescu]]
  24 KB (3,177 words) - 12:53, 20 February 2024
• Joining an ARML team
  The SD team is entering just its third year of participation, so a permanent process of selecting team members has yet to be decided upon. The A student who wishes to attend practice should try to take the SDMO. If a student wishes to speak with one of the coaches for the team, they may do s
  21 KB (3,500 words) - 18:41, 23 April 2024
• Factorial
  ...!=n \cdot (n-1) \cdots 2 \cdot 1 = \prod_{i=1}^n i</math>. Alternatively, a [[recursion|recursive definition]] for the factorial is <math>n!=n \cdot (n ...</math> (remember! this is 1, not 0! (the '!' was an exclamation mark, not a factorial sign))
  10 KB (809 words) - 16:40, 17 March 2024
• Fermat's Little Theorem
  ...] (which students should study more at the introductory level if they have a hard time following the rest of this article). This theorem is credited to ...ibility|divisible]] by <math>{p}</math>, then <math>a^{p-1}\equiv 1 \pmod {p}</math>.
  16 KB (2,658 words) - 16:02, 8 May 2024
• Parabola
  ...[[locus]] of points that are equidistant from a point (the [[focus]]) and a line (the [[directrix]]). ...la. The first is [[polynomial]] form: <math>y = a{x}^2+b{x}+c</math> where a, b, and c are [[constant]]s. This is useful for manipulating the polynomial
  3 KB (551 words) - 16:22, 13 September 2023
• Ptolemy's theorem
  ...orem''' gives a relationship between the side lengths and the diagonals of a [[cyclic quadrilateral]]; it is the [[equality condition | equality case]] Given a [[cyclic quadrilateral]] <math>ABCD</math> with side lengths <math>{a},{b},{c},{d}</math> and [[diagonal]]s <math>{e},{f}</math>:
  7 KB (1,198 words) - 20:39, 9 March 2024
• Divisibility rules
  ...its of the number are divisible by <math>2^n</math>. Thus, in particular, a number is divisible by 2 if and only if its units digit is divisible by 2, A number is divisible by 3 or 9 if and only if the sum of its digits is divis
  8 KB (1,315 words) - 18:18, 2 March 2024
• Prime number
  A '''prime number''' (or simply '''prime''') is a [[positive integer]] <math>p>1</math> whose only positive [[divisor | divisors]] are 1 and itself. ...</math> must [[#Importance of Primes|have]] a prime factor, which leads to a direct contradiction.
  6 KB (985 words) - 12:38, 25 February 2024
• Complementary counting
  ...ting may lead to a quick solution is the phrase "not" or "at least" within a problem statement. ...is the [[complement]] of <math>B</math>. In most instances, though, <math>A</math> is obvious from context and is committed from mention.
  8 KB (1,192 words) - 17:20, 16 June 2023
• Combinatorial identity
  ...binatorially by noting that any combination of <math>r</math> objects from a group of <math>m+n</math> objects must have some <math>0\le k\le r</math> o if(n==8){label(string(chew(n,i)),(11+n/2-i,-n),p=red+2.5);}
  12 KB (1,996 words) - 12:01, 18 May 2024
• Ellipse
  An '''ellipse''' is a type of [[conic section]]. An ellipse is formed by cutting through a [[cone]] at an [[angle]].
  5 KB (892 words) - 21:52, 1 May 2021
• Pi
  Pi is the [[ratio]] of the [[circumference]] ([[perimeter]]) of a given [[circle]] to its [[diameter]]. It is approximately equal to 3.14159 ...i</math> is to inscribe a unit circle in a square of side length 2. Using a computer, random points are placed inside the square. Because the area of
  8 KB (1,469 words) - 21:11, 16 September 2022
• Goldbach Conjecture
  The '''Goldbach Conjecture''' is a yet unproven [[conjecture]] stating that every [[even integer]] greater tha <math>14 = 3 + 11 = 7 + 7</math>
  7 KB (1,201 words) - 16:59, 19 February 2024
• Mock AMC
  ...an actual [[AMC]] (American Mathematics Competitions 8, 10, or 12) exam. A number of '''Mock AMC''' competitions have been hosted on the [[Art of Prob == Tips for Writing a Mock AMC ==
  51 KB (6,175 words) - 20:58, 6 December 2023
• 2006 AIME I Problems
  In quadrilateral <math> ABCD , \angle B </math> is a right angle, diagonal <math> \overline{AC} </math> is perpendicular to <mat ...th> and let <math> S </math> be the sum of the elements of <math> \mathcal{A}. </math> Find the number of possible values of <math> S. </math>
  7 KB (1,173 words) - 03:31, 4 January 2023
• 2021 JMC 10
  <math>\textbf{(A) } 3 \qquad\textbf{(B) } 7 \qquad\textbf{(C) } 8 \qquad\textbf{(D) } 9 \qqu <math>\textbf{(A) }\pi-e \qquad\textbf{(B) }2\pi-2e\qquad\textbf{(C) }2e\qquad\textbf{(D) }2
  12 KB (1,784 words) - 16:49, 1 April 2021
• 2006 AMC 12B Problems
  \text {(A) } - 2006 \qquad \text {(B) } - 1 \qquad \text {(C) } 0 \qquad \text {(D) } <math>\text {(A) } - 72 \qquad \text {(B) } - 27 \qquad \text {(C) } - 24 \qquad \text {(D)
  13 KB (2,058 words) - 12:36, 4 July 2023
• 2005 AMC 12A Problems
  {{AMC12 Problems|year=2005|ab=A}} (\mathrm {A}) \ 1 \qquad (\mathrm {B}) \ 2 \qquad (\mathrm {C})\ 5 \qquad (\mathrm {D})
  13 KB (1,971 words) - 13:03, 19 February 2020
• 2004 AMC 12A Problems
  {{AMC12 Problems|year=2004|ab=A}} <math>\text{(A) } 0.0029 \qquad \text{(B) } 0.029 \qquad \text{(C) } 0.29 \qquad \text{(D)
  13 KB (1,953 words) - 00:31, 26 January 2023
• 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
• 2004 AIME I Problems
  The digits of a positive integer <math> n </math> are four consecutive integers in decreasi ...he absolute value of the difference between the greatest element of <math> A </math> and the greatest element of <math> B </math> is 99. Find <math> m.
  9 KB (1,434 words) - 13:34, 29 December 2021
• 2004 AIME II Problems/Problem 14
  Consider a string of <math> n </math> <math> 7 </math>'s, <math> 7777\cdots77, </math> ...</math>. Then the question is asking for the number of values of <math>n = a + 2b + 3c</math>.
  11 KB (1,857 words) - 21:55, 19 June 2023
• 2004 AIME II Problems/Problem 12
  ...k </math> and <math> p </math> are [[relatively prime]]. Find <math> k+m+n+p. </math> pair A=(0,0), B=(6,0), D=(1, 24^.5), C=(5,D.y), O = (3,(r^2 + 6*r)^.5);
  3 KB (431 words) - 23:21, 4 July 2013
• 2004 AIME II Problems/Problem 10
  ...> and <math> q </math> are relatively prime positive integers. Find <math> p+q. </math> A positive integer <math>n</math> has exactly two 1s in its binary representa
  8 KB (1,283 words) - 19:19, 8 May 2024
• 2004 AIME II Problems
  ...a, b, c, d, e, </math> and <math> f </math> are positive integers, <math> a </math> and <math> e </math> are relatively prime, and neither <math> c </m A jar has 10 red candies and 10 blue candies. Terry picks two candies at rand
  9 KB (1,410 words) - 05:05, 20 February 2019
• 1983 AIME Problems
  ...th> and <math>z</math> all exceed <math>1</math> and let <math>w</math> be a positive number such that <math>\log_xw=24</math>, <math>\log_y w = 40</mat ...ue taken by <math>f(x)</math> for <math>x</math> in the [[interval]] <math>p \leq x\leq15</math>.
  7 KB (1,104 words) - 12:53, 6 July 2022
• 1984 AIME Problems
  ...of <math>\triangle ABC</math> such that when lines are drawn through <math>P</math> parallel to the sides of <math>\triangle ABC</math>, the resulting s pair A=(0,0),B=(12,0),C=(4,5);
  6 KB (933 words) - 01:15, 19 June 2022
• 1986 AIME Problems
  The pages of a book are numbered <math>1_{}^{}</math> through <math>n_{}^{}</math>. When t ...r point <math>P</math> is then drawn, and segments are drawn through <math>P</math> parallel to the sides of the triangle. If these three segments are o
  5 KB (847 words) - 15:48, 21 August 2023
• 1987 AIME Problems
  ...er we mean a positive integral divisor other than 1 and the number itself. A natural number greater than 1 will be called "nice" if it is equal to the p ...r which <math>[a,b] = 1000</math>, <math>[b,c] = 2000</math>, and <math>[c,a] = 2000</math>.
  6 KB (869 words) - 15:34, 22 August 2023
• 1988 AIME Problems
  ...</math>, let <math>f_n(k) = f_1(f_{n - 1}(k))</math>. Find <math>f_{1988}(11)</math>. Let <math>\frac{m}{n}</math>, in lowest terms, be the probability that a randomly chosen positive divisor of <math>10^{99}</math> is an integer mult
  6 KB (902 words) - 08:57, 19 June 2021

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