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

Page title matches

• The positive three-digit integer N has a ones digit of 0. What is the probability that N is divisible by 4? Express your answer as a common fraction.
  ...as odd digits, there is a <math>\boxed{1/2}</math> probability that <math>N</math> is divisible by 4.
  427 bytes (71 words) - 17:35, 12 June 2022

Page text matches

• Pythagorean Theorem
  ...n [[geometry]], and is one of the many tools in a good geometer's arsenal. A very large number of geometry problems can be solved by building right tria In these proofs, we will let <math>ABC </math> be any right triangle with a right angle at <math>{} C </math>.
  5 KB (886 words) - 13:51, 15 May 2024
• 2016 AMC 10A Problems/Problem 9
  ...coins in the <math>N</math>th row. What is the sum of the digits of <math>N</math>? <math>\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\t
  2 KB (315 words) - 15:34, 18 June 2022
• Physics
  <strong>Physics</strong> is a branch of [[science]] that studies the properties of matter, energy, and ma Modern Physics is also a group of different subjects in physics:
  9 KB (1,355 words) - 07:29, 29 September 2021
• 2005 Alabama ARML TST Problems/Problem 7
  ...e series: <center><math>3+\frac{11}4+\frac 94 + \cdots + \frac{n^2+2n+3}{2^n}+\cdots</math>.</center> ...^{\infty} \left(\frac{2n}{2^n}\right)+\sum_{n=1}^{\infty} \left(\frac{3}{2^n}\right)</math>
  1 KB (193 words) - 21:13, 18 May 2021
• Newton
  A '''Newton''' (abbreviated N) is the [[Système international|metric]] measure of [[force]], named for [ ...[[kilogram]] times one [[meter]] per [[second]] squared, or <math>\mathrm{N}=\mathrm{kg}\times \frac{\mathrm{m}}{\mathrm{s}^2}</math>. This is because
  665 bytes (96 words) - 23:17, 2 February 2021
• 1954 AHSME Problems/Problem 46
  In the diagram, if points <math>A, B</math> and <math>C</math> are points of tangency, then <math>x</math> eq pair A=(-3*sqrt(3)/32,9/32), B=(3*sqrt(3)/32, 9/32), C=(0,9/16);
  3 KB (415 words) - 18:01, 24 May 2020
• 2015 IMO Problems
  We say that a finite set <math>\mathcal{S}</math> in the plane is <i> balanced </i> if, for any two different points <math>A</math>, <math>B</math> in <math>\mathcal{S}</math>, there is
  4 KB (692 words) - 22:33, 15 February 2021
• Power Mean Inequality
  The '''Power Mean Inequality''' is a generalized form of the multi-variable [[Arithmetic Mean-Geometric Mean]] I ...>n</math> positive real weights <math>w_i</math> with sum <math>\sum_{i=1}^n w_i=1</math>, the power mean with exponent <math>t</math>, where <math>t\in
  3 KB (606 words) - 23:59, 1 July 2022
• Wilson's Theorem
  Suppose first that <math>p</math> is composite. Then <math>p</math> has a factor <math>d > 1</math> that is less than or equal to <math>p-1</math>. ...ique, and each number is the inverse of its inverse. If one integer <math>a</math> is its own inverse, then
  4 KB (639 words) - 01:53, 2 February 2023
• Trivial Inequality
  <cmath>ax^2+bx+c = a(x^2+\frac{b}{a}x+\frac{b^2}{4a^2})+c-\frac{b^2}{4a} = a(x+\frac{b}{2a})^2+c-\frac{b^2}{4a}.</cmath> .../math> is positive and <math>ax^2+bx+c\le c-\frac{b^2}{4a}</math> if <math>a</math> is negative.
  3 KB (560 words) - 22:51, 13 January 2024
• Arithmetic mean
  The '''arithmetic mean''' of a [[set]] of numbers (or variables) is the sum of all the numbers, divided by <center><math>AM=\frac{x_1+x_2+\cdots+x_n}{n}</math></center>
  699 bytes (110 words) - 12:44, 20 September 2015
• Polynomial
  ...algebra]] often an arbitrary [[field]]). Note that a [[constant]] is also a polynomial. ===A More Precise Definition===
  6 KB (1,100 words) - 01:44, 17 January 2024
• Simon's Favorite Factoring Trick
  ...of the equation and a product of variables with each of those variables in a linear term on the other side. An example would be: <cmath>xy+66x-88y=23333 ...Factoring Trick, this equation can be transformed into: <cmath>(x+k)(y+j)=a+jk</cmath>
  7 KB (1,107 words) - 07:35, 26 March 2024
• Factoring
  ...rs, is to write the expression (often an [[integer]] or [[polynomial]]) as a product of different terms. This often allows one to find information abou Using the formula for the sum of a [[geometric sequence]], it's easy to derive the general formula for differe
  3 KB (532 words) - 22:00, 13 January 2024
• Proof by contradiction
  ...fs look better --> This technique usually works well on problems where not a lot of information is known, and thus we can create some using proof by con ...d as a rational fraction of the form <math>\frac{b}{a}</math>, where <math>a</math> and <math>b</math> are two [[relatively prime]] integers. Now, sinc
  2 KB (374 words) - 14:01, 21 August 2022
• Mathematical problem solving
  ...ng]] involves using all the tools at one's disposal to attack a problem in a new way. == A Historical Example ==
  2 KB (314 words) - 06:45, 1 May 2014
• Pigeonhole Principle
  ...e''' states that if <math>n+1</math> or more pigeons are placed into <math>n</math> holes, one hole must contain two or more pigeons. This seemingly tri ...if <math>n</math> balls are to be placed in <math>k</math> boxes and <math>n>k</math>, then at least one box must contain more than one ball.
  11 KB (1,985 words) - 21:03, 5 August 2023
• Relatively prime
  ...ath> and <math>n</math> are relatively prime if and only if <math>\frac{m}{n}</math> is in lowest terms. ...th> and <math>n+1</math>, then it must divide their difference <math>(n+1)-n = 1</math>, which is impossible since <math>p > 1</math>.
  2 KB (245 words) - 15:51, 25 February 2020
• 1965 AHSME Problems/Problem 40
  ...^4 + 6x^3 + 11x^2 + 3x + 31</math> is the square of an integer. Then <math>n</math> is: <math>\textbf{(A)}\ 4 \qquad
  3 KB (571 words) - 00:42, 22 October 2021
• Geometric mean
  .../math> and <math>c</math> is the number <math>a</math> such that <math>a + a = b + c</math>, while the geometric mean of the numbers <math>b</math> and ...length of [[line segment]] <math>AM</math> is the geometric mean of <math>a</math> and <math>b</math>.
  2 KB (282 words) - 22:04, 11 July 2008
• Principle of Inclusion-Exclusion
  ...ized method/formula to find the number of [[element]]s in the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible ...counted once and only once. In particular, memorizing a formula for PIE is a bad idea for problem solving.
  9 KB (1,703 words) - 07:25, 24 March 2024
• Mill's Constant
  ...\lfloor\theta^{3^n}\rfloor</math> is always a prime number for all natural n. ...>\lfloor\theta^{3^n}\rfloor</math> is the prime number theorem where <math>n</math> can be any number and <math>\theta</math> is an element from an set
  794 bytes (105 words) - 01:59, 15 January 2022
• Combination
  ...of combinations of size <math>r</math> from an original set of size <math>n</math> ...ons are, their various types, and how to calculate each type! It serves as a great introductory video to combinations, permutations, and counting proble
  4 KB (615 words) - 11:43, 21 May 2021
• Cauchy-Schwarz Inequality
  ...th>t</math> such that <math>a_i = t b_i</math> for all <math>1 \leq i \leq n</math>, or if one list consists of only zeroes. Along with the [[AM-GM Ineq ...cdot \overrightarrow{w}|</cmath> with equality if and only if there exists a scalar <math>t</math> such that <math>\overrightarrow{v} = t \overrightarro
  13 KB (2,048 words) - 15:28, 22 February 2024
• Factorial
  ...[[recursion|recursive definition]] for the factorial is <math>n!=n \cdot (n-1)!</math>. ...</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
• Discriminant
  ...has two [[nonreal]] roots; and if the discriminant is 0, the equation has a real [[double root]]. ==Discriminant of polynomials of degree n==
  4 KB (734 words) - 19:19, 10 October 2023
• 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 ...}</math> is not [[divisibility|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
• Chebyshev's Inequality
  ..._{i=1}^{n}a_ib_i\right)\geq\left(\sum_{i=1}^{n}a_i\right)\left(\sum_{i=1}^{n}b_i\right)</math>. <math> b_n\geq b_{n-1}\geq ... \geq b_1 </math> then:
  1 KB (214 words) - 20:32, 13 March 2022
• Euler's Totient Theorem
  '''Euler's Totient Theorem''' is a theorem closely related to his [[totient function]]. ...is a positive integer [[relatively prime]] to <math>a</math>, then <math>{a}^{\phi (m)}\equiv 1 \pmod {m}</math>.
  3 KB (542 words) - 17:45, 21 March 2023
• Brute forcing
  ...e, through bashing calculations, and can actually sometimes be faster than a more creative approach, and is thus an important tool to have. ...te force would be to list all 91 possibilities (although this would not be a smart time to use brute force).
  1 KB (190 words) - 13:22, 5 May 2023
• Geometric inequality
  A '''geometric inequality''' is an [[inequality]] involving various measures ...level geometry problems. It also provides the basis for the definition of a [[metric space]] in [[analysis]].
  7 KB (1,296 words) - 14:22, 22 October 2023
• Elementary symmetric sum
  An '''elementary symmetric sum''' is a type of [[summation]]. ...>). For example, if <math>n = 4</math>, and our set of numbers is <math>\{a, b, c, d\}</math>, then:
  2 KB (275 words) - 12:51, 26 July 2023
• Number theory/Advanced
  ...in some subfield (like the reals or the rationals). One also needs to add a limit point, called the point at infinity. As <math>x\to \infty</math>, the ...points. This means that given 2 points on the curve, they can be added in a way that satisfies the normal laws of addition, like associativity, commuta
  5 KB (849 words) - 16:14, 18 May 2021
• Harmonic mean
  ...al number]]s <math> x_1, x_2... x_n </math> is defined to be: <math> \frac{n} {\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}}</math>. ...\frac{x_1+x_2+\ldots+x_n}{n}\ge \sqrt[n]{x_1\cdot x_2 \cdots x_n}\ge \frac{n} {\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}} </math>
  1 KB (196 words) - 00:49, 6 January 2021
• Euler's totient function
  ...elatively prime]] to <math>n</math>. <math>\phi(n)</math> is read "phi of n." ...h>, one can compute <math>\phi(n)</math> using the formula <cmath>\phi(n)= n\left(1-\frac{1}{p_1} \right) \left(1-\frac{1}{p_2} \right)\cdots \left(1-\f
  5 KB (898 words) - 19:12, 28 January 2024
• Divisibility
  In [[number theory]], '''divisibility''' is the ability of a number to evenly divide another number. The study of divisibility resides a ...that <math>a</math> is a '''multiple''' of <math>b</math>, and that <math>a</math> is '''divisible''' or '''evenly divisible''' by <math>b</math>.
  2 KB (277 words) - 16:21, 29 April 2023
• Rearrangement Inequality
  ...ss than or equal to exactly <math>{i}</math> of the other members of <math>A</math>, then <math>{b_k}</math> is also greater than or equal to exactly <m ...re more pennies than nickels, more nickels than dimes, and so on. This is a simple application of the rearrangement inequality. It is also an applicat
  5 KB (804 words) - 13:54, 26 January 2023
• Real number
  A '''real number''' is a number that falls on the real number line. It can have any value. Some exam ...[[integer]]s (<math>\mathbb{Z}</math>), [[natural number]]s (<math>\mathbb{N}</math>) and [[irrational number]]s (sometimes, but not universally, denote
  3 KB (496 words) - 23:22, 5 January 2022
• 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
• Induction
  ...it works for <math>n=1+1=2</math>, which in turn means it works for <math>n=2+1=3</math>, and so on. ...nd show that if <math>{n=k}</math> gives the desired result, so does <math>n=k+2</math>. If you wish, you can similarly induct over the powers of 2.
  5 KB (768 words) - 20:45, 1 September 2022
• Greatest common divisor
  ...mon factor''')) of two or more [[integer]]s is the largest integer that is a [[divisor]] of all the given numbers. A very useful property of the GCD is that it can be represented as a sum of the given numbers with integer coefficients. From here it immediatel
  2 KB (288 words) - 22:40, 26 January 2021
• Overcounting
  ...ea of strategic overcounting is fundamental to [[combinatorics]] and plays a role in incredibly important counting tools such as [[combinations]] and th An example of a classic problem is as follows:
  4 KB (635 words) - 12:19, 2 January 2022
• Constructive counting
  ...s a [[counting]] technique that involves constructing an item belonging to a set. Along with the construction, one counts the total possibilities of eac '''Solution''': We can construct a four-digit by picking the first digit, then the second, and so on until the
  12 KB (1,896 words) - 23:55, 27 December 2023
• Jensen's Inequality
  Let <math>{F}</math> be a [[convex function]] of one real variable. Let <math>x_1,\dots,x_n\in\mathbb If <math>{F}</math> is a concave function, we have:
  3 KB (623 words) - 13:10, 20 February 2024
• Euclidean algorithm
  ...orithm that finds the [[greatest common divisor]] (GCD) of two elements of a [[Euclidean domain]], the most common of which is the [[nonnegative]] [[int ...c idea is to repeatedly use the fact that <math>\gcd({a,b}) \equiv \gcd({b,a - b})</math>
  6 KB (924 words) - 21:50, 8 May 2022
• Generating function
  ...se [[coefficient]]s, <math>c_0, c_1, c_2, \ldots</math>, give the terms of a [[sequence]] which is of interest. Therefore the power series (i.e. the gen ...se 0}+{n \choose 1}x + {n \choose 2}x^2+\cdots+</math><math>{n \choose n}x^n</math>.
  4 KB (659 words) - 12:54, 7 March 2022
• Binomial Theorem
  ...x]] <math>a</math>, <math>b</math>, and [[non-negative]] [[integer]] <math>n</math>, <center><math>(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k</math></center>
  5 KB (935 words) - 13:11, 20 February 2024
• Prime number
  A '''prime number''' (or simply '''prime''') is a [[positive integer]] <math>p>1</math> whose only positive [[divisor | divis ...</math> must [[#Importance of Primes|have]] a prime factor, which leads to a direct contradiction.
  6 KB (985 words) - 12:38, 25 February 2024
• Recursion
  ...ely by the relations <math>F_0 = F_1 = 1</math> and <math>F_{n+1}=F_{n}+F_{n-1}</math>. (That is, each term is the sum of the previous two terms.) The ...> for <math>n > 0</math> also has the closed-form definition <math>a_n = 2^n</math>.
  2 KB (316 words) - 16:03, 1 January 2024
• Function
  A '''function''' is a rule that maps one set of values to another set of values, assigning to eac ...is a ''function from <math>A</math> to <math>B</math>'' (written <math>f: A \to B</math>) if and only if
  10 KB (1,761 words) - 03:16, 12 May 2023
• 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
  <math>{n \choose k}={n-1\choose k-1}+{n-1\choose k}</math> ...}{k}</math> is the binomial coefficient <math>\binom{n}{k} = {}_nC_k = C_k^n</math>.
  12 KB (1,996 words) - 12:01, 18 May 2024
• Prime factorization
  ...ental Theorem of Arithmetic]] tells us that every [[positive integer]] has a unique prime factorization, up to changing the order of the terms. The form of a prime factorization is
  3 KB (496 words) - 22:14, 5 January 2024
• Composite number
  A comprehensive video explaining composite numbers: https://youtu.be/SMOGYNYD A '''composite number''' is a [[positive integer]] with at least one [[divisor]] different from 1 and its
  6 KB (350 words) - 12:58, 26 September 2023
• Natural number
  ...tegers (sometimes called [[whole number]]s). In particular, <math>\mathbb{N}</math> usually includes zero in the contexts of [[set theory]] and [[abstr
  1 KB (162 words) - 21:44, 13 March 2022
• Circle
  A '''circle''' is a geometric figure commonly used in Euclidean [[geometry]]. {{asy image|<asy>unitsize(2cm);draw(unitcircle,blue);</asy>|right|A basic circle.}}
  9 KB (1,581 words) - 18:59, 9 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
• Divisor
  ...\frac nd</math> is also a natural number (i.e <math>d</math> divides <math>n</math>). See [[Divisibility]] for more information. ...number is a divisor of another is <math>n|k</math>. This means that <math>n</math> divides <math>k</math>.
  1 KB (274 words) - 19:50, 29 August 2023
• Base numbers
  ...each number in 2746 is actually just a placeholder which shows how many of a certain power of 10 there are. The first digit to the left of the decimal ...digits 0-9. Usually, the base, or '''radix''', of a number is denoted as a subscript written at the right end of the number (e.g. in our example above
  4 KB (547 words) - 17:23, 30 December 2020
• Partition of an interval
  A '''partition of an interval''' is a division of an [[interval]] into several disjoint sub-intervals. Partition Let <math>[a,b]</math> be an interval of [[real number]]s.
  1 KB (178 words) - 20:34, 6 March 2022
• Henstock-Kurzweil integral
  ...ble generalizations of the [[Integral|Riemann integral]], but it also uses a strikingly simple and elegant idea. It was developed independently by [[Ral Let <math>f:[a,b]\rightarrow\mathbb{R}</math>
  2 KB (401 words) - 09:46, 31 January 2018
• 2001 AMC 12 Problems/Problem 2
  Let <math>P(n)</math> and <math>S(n)</math> denote the product and the sum, respectively, of the digits ...ath>P(23) = 6</math> and <math>S(23) = 5</math>. Suppose <math>N</math> is a
  1,007 bytes (165 words) - 00:28, 30 December 2023
• Multiple
  ...</math> are integers. (In this case, <math>k</math> is a multiple of <math>n</math>, as well). An equivalent phrasing is that <math>k</math> is a multiple of <math>m</math> exactly when <math>k</math> is [[divisibility |
  860 bytes (142 words) - 22:51, 26 January 2021
• Common factorizations
  \text{\textbullet}&&x^{n}-y^{n}&=(x-y)(x^{n-1}+x^{n-2}y+\cdots +xy^{n-2}+y^{n-1}) ...e be solved by [[Newton sums]] or problems that give a polynomial, and ask a question about the roots. Combined with [[Vieta's formulas]], these are ex
  2 KB (327 words) - 02:06, 28 April 2024
• Ptolemy's Inequality
  '''Ptolemy's Inequality''' is a famous inequality attributed to the Greek mathematician Ptolemy. The inequality states that in for four points <math>A, B, C, D </math> in the plane,
  3 KB (602 words) - 09:01, 7 June 2023
• Cevian
  ...(or the extension of that side). In the below diagram, <math>AD</math> is a cevian. label("$A$",(10,50),N);
  1 KB (194 words) - 01:35, 19 June 2018
• Median of a triangle
  A '''median''' of a [[triangle]] is a [[cevian]] of the triangle that joins one [[vertex]] to the [[midpoint]] of In the following figure, <math>AM</math> is a median of triangle <math>ABC</math>.
  1 KB (185 words) - 20:24, 6 March 2024
• Pi
  ...ost surprising places, such as in the sum <math>\sum_{n=1}^\infty \frac{1}{n^2}=\frac{\pi^2}{6}</math>. Some common [[fraction]]al approximations for p ...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
• Phi
  <math>\phi</math> appears in a variety of different mathematical contexts: it is the limit of the ratio of .../math>^th term, the result approaches <math>\phi</math> as <math>n</math> increases.
  2 KB (302 words) - 14:04, 1 January 2024
• Fibonacci sequence
  The '''Fibonacci sequence''' is a [[sequence]] of [[integer]]s in which the first and second terms are both e ...th> for <math>n \geq 3</math>. This is the simplest nontrivial example of a [[linear recursion]] with constant coefficients. There is also an explicit
  6 KB (957 words) - 23:49, 7 March 2024
• Chain Rule
  ...<math>h'(x_0)</math>,<math>f'(g(x_0))</math>, and <math>g'(x_0)</math> is a matrix.) ...as <math>\Delta x</math> approaches <math>0</math>. This can be made into a rigorous proof. (But we do have to worry about the possibility that <math>
  12 KB (2,377 words) - 11:48, 22 July 2009
• Muirhead's Inequality
  ...>p</math> [[Majorization|majorizes]] a sequence <math>q</math>, then given a set of positive reals <math>x_1,x_2,\cdots,x_n</math>: A common [[Brute forcing|bruteforce]] technique with inequalities is to clear
  8 KB (1,346 words) - 12:53, 8 October 2023
• Cardinality
  '''Cardinality''' is a property of [[set]]s. For [[finite]] sets, the cardinality of is the numbe ...4\}| = 2</math>. Sometimes, the notations <math>n(A)</math> and <math>\# (A)</math> are used.
  2 KB (263 words) - 00:54, 17 November 2019
• Fundamental Theorem of Calculus
  The '''Fundamental Theorem of Calculus''' establishes a link between the two central operations of [[calculus]]: [[derivative|diffe ...imes <math>t=1</math> and <math>t=2</math> geometrically, as an area under a curve.
  11 KB (2,082 words) - 15:23, 2 January 2022
• Polygon
  A '''polygon''' is a closed [[planar figure]] consisting of straight [[line segment]]s. There ar A polygon can be [[regular polygon| regular]] or irregular. A polygon is regular if all sides are the same length and all angles are [[co
  2 KB (372 words) - 19:04, 30 May 2015
• 2011 AMC 10B Problems/Problem 22
  ...ength <math>1</math> and has lateral faces that are equilateral triangles. A cube is placed within the pyramid so that one face is on the base of the py <math> \textbf{(A)}\ 5\sqrt{2} - 7 \qquad\textbf{(B)}\ 7 - 4\sqrt{3} \qquad\textbf{(C)}\ \fra
  4 KB (691 words) - 18:38, 19 September 2021
• Vector
  ...y, but also most abstractly, a vector is any object which is an element of a given vector space. ...(x\,\,y\,\,z\,\,...)</math>. The set of vectors over a [[field]] is called a [[vector space]].
  7 KB (1,265 words) - 13:22, 14 July 2021
• Logarithm
  ...would be a pain to have to calculate any time you wanted to use it (say in a comparison of large numbers). Its natural logarithm though (partly due to ...ly 7 digits before the decimal point. Comparing the logs of the numbers to a given precision can allow easier comparison than computing and comparing th
  4 KB (680 words) - 12:54, 16 October 2023
• Law of Cosines
  ...sines''' is a theorem which relates the side-[[length]]s and [[angle]]s of a [[triangle]]. It can be derived in several different ways, the most common ...h>, <math>b</math> and <math>c</math> opposite [[angle]]s of measure <math>A</math>, <math>B</math> and <math>C</math>, respectively, the Law of Cosines
  6 KB (1,003 words) - 09:11, 7 June 2023
• Roots of unity
  ...ne the [[complex number|complex]] [[root]]s of the [[polynomial]] <math> x^n=1 </math>. ...e note that since we have an '''n'''th degree polynomial, there will be '''n''' complex roots.
  3 KB (558 words) - 21:36, 11 December 2011
• Angle bisector
  ...internal) angle bisector of <math>\angle BAC</math> is the line from <math>A</math> such that the angle between this line and <math>\overline{AB}</math> pair A,B,C,D,E,F;
  3 KB (575 words) - 15:27, 19 March 2023
• Law of Sines
  The '''Law of Sines''' is a useful identity in a [[triangle]], which, along with the [[law of cosines]] and the [[law of tan ...h>\triangle ABC</math>, where <math>a</math> is the side opposite to <math>A</math>, <math>b</math> opposite to <math>B</math>, <math>c</math> opposite
  4 KB (658 words) - 16:19, 28 April 2024
• Sequence
  A '''sequence''' is an ordered list of terms. Sequences may be either [[fini ...or instance, the function <math>f(x) = x^2</math> defined on <math>\mathbb{N}</math> corresponds to the sequence <math>X = (x_n) = (0, 1, 4, 9, 16, \ldo
  2 KB (413 words) - 21:18, 13 November 2022
• Geometric sequence
  ...'geometric sequence''', sometimes called a '''geometric progression''', is a [[sequence]] of numbers such that the ratio between any two consecutive ter ...e with common ratio <math>2</math> and <math>100, -50, 25, -25/2</math> is a geometric sequence with common ratio <math>-1/2</math>; however, <math>1, 3
  4 KB (644 words) - 12:55, 7 March 2022
• Arithmetic sequence
  ...ithmetic sequence''', sometimes called an '''arithmetic progression''', is a [[sequence]] of numbers such that the difference between any two consecutiv ...and <math>c</math> are in arithmetic progression if and only if <math>b - a = c - b</math>.
  4 KB (736 words) - 02:00, 7 March 2024
• Fermat's Last Theorem
  ...\geq 3</math>, there are no solutions to the equation <math>a^n + b^n = c^n</math>. ...ater than the second to be the sum of two like powers. ''I have discovered a truly marvelous demonstration of this proposition that this margin is too n
  3 KB (453 words) - 11:13, 9 June 2023
• Homothety
  ...ath> and factor <math>k</math> sends point <math>A</math> to a point <math>A' \ni HA'=k\cdot HA</math> This is denoted by <math>\mathcal{H}(H, k)</math> ...is <math>\frac{OD'}{OD}</math>. Additionally, <math>ABCD</math> and <math>A'B'C'D'</math> are homothetic with respect to <math>O</math>.
  3 KB (532 words) - 01:11, 11 January 2021
• 2005 USAMO Problems/Problem 4
  ...math> from the end of leg <math>L_i \; (i = 1,2,3,4)</math> and still have a stable table? ...can be placed so that all four of the leg ends touch the floor. Note that a cut leg of length 0 is permitted.)
  7 KB (1,276 words) - 20:51, 6 January 2024
• Geometry
  '''Geometry''' is the field of [[mathematics]] dealing with figures in a given [[space]]. It is one of the two oldest branches of mathematics, along :''“Through any line and a point not on the line, there is exactly one line passing through that point
  3 KB (393 words) - 07:59, 25 September 2020
• Diophantine equation
  A '''Diophantine equation''' is an [[equation]] relating [[integer]] (or some ...closely tied to [[modular arithmetic]] and [[number theory]]. Often, when a Diophantine equation has infinitely many solutions, [[parametric form]] is
  9 KB (1,434 words) - 13:10, 20 February 2024
• Area
  ...size of the region that a two-[[dimension]]al figure occupies. The size of a region in higher dimensions is referred to as [[volume]]. It is often possible to find the area of a region bounded by parts of [[circle]]s and [[line segment]]s through elemen
  6 KB (1,181 words) - 22:37, 22 January 2023
• Floor function
  ...]</math>. The action of this function is the same as "rounding down." On a [[positive]] argument, this function is the same as "dropping everything af ...+b\rfloor\ge \lfloor a\rfloor+\lfloor b \rfloor</math> for all real <math>(a,b)</math>.
  3 KB (508 words) - 21:05, 26 February 2024
• Pascal's triangle
  ...ns the values from the [[binomial expansion]]; its various properties play a large role in [[combinatorics]]. ...he sum of the values on row <math>n</math> of Pascal's Triangle is <math>2^n</math>.
  5 KB (838 words) - 17:20, 3 January 2023
• Newton's Sums
  ...ficient way of finding the sums of [[root]]s of a [[polynomial]] raised to a power. They can also be used to derive several [[factoring]] [[identity|id Consider a polynomial <math>P(x)</math> of degree <math>n</math>,
  4 KB (690 words) - 13:11, 20 February 2024
• 1985 IMO Problems/Problem 5
  ...ath> and <math>BC</math> again at distinct points <math>K</math> and <math>N</math> respectively. Let <math>M</math> be the point of intersection of the .../math> is the Miquel Point of quadrilateral <math>ACNK</math>, so there is a spiral similarity centered at <math>M</math> that takes <math>KN</math> to
  3 KB (496 words) - 13:35, 18 January 2023
• Rational approximation
  The main theme of this article is the question how well a given [[real number]] <math>x</math> can be approximated by [[rational numb ...th> can be approximated by a rational number <math>\frac{p}{q}</math> with a given denominator <math>q\ge 1</math> with an error not exceeding <math>\fr
  7 KB (1,290 words) - 12:18, 30 May 2019
• Trigonometry
  ...s and angles of triangles through the '''trigonometric functions'''. It is a fundamental branch of mathematics, and its discovery paved the way towards ...definition of trigonometry is preferred in order to extend trigonometry to a complex domain.
  8 KB (1,217 words) - 20:15, 7 September 2023
• Euler's number
  '''Euler's number''' is a [[constant]] that appears in a variety of mathematical contexts. It is defined as the positive real number The <math>\ln</math> (natural logarithm) function is equivalent to a [[logarithm]] with base <math>e</math>. In addition, the function <math>\ex
  4 KB (764 words) - 21:09, 13 March 2022
• Complex analysis
  ...ctions of a real variable that cannot occur in complex variables. Here are a few spectacular results in complex analysis. ...ly connected]] [[domain]] ''D'', and let <math>\Gamma\subseteq D</math> be a [[simple closed Jordan curve]]. Then for any <math>z_0</math> in the interi
  2 KB (271 words) - 22:06, 12 April 2022
• Root-Mean Square-Arithmetic Mean-Geometric Mean-Harmonic mean Inequality
  ...power]], [[arithmetic mean]], [[geometric mean]], and [[harmonic mean]] of a set of [[positive]] [[real number]]s <math>x_1,\ldots,x_n</math> that says ...</cmath> where <math>n_1>1,~~0<n_2<1,~~-1<n_3<0,~~n_4<-1</math>, and <math>n</math> is the root mean power.
  5 KB (912 words) - 20:06, 14 March 2023
• Goldbach Conjecture
  The '''Goldbach Conjecture''' is a yet unproven [[conjecture]] stating that every [[even integer]] greater tha In 1742, the Prussian mathematician Christian Goldbach wrote a letter to [[Leonhard Euler]] in which he proposed the following conjecture:
  7 KB (1,201 words) - 16:59, 19 February 2024
• Twin Prime Conjecture
  The '''Twin Prime Conjecture''' is a [[conjecture]] (i.e., not a [[theorem]]) that states that there are [[infinite]]ly many pairs of [[twin ...twin primes. Unfortunately, it has been shown that this sum converges to a constant <math>B</math>, known as [[Brun's constant]]. This could mean eit
  2 KB (308 words) - 02:27, 1 May 2024
• Riemann Hypothesis
  The '''Riemann Hypothesis''' is a famous [[conjecture]] in [[analytic number theory]] that states that all no ...uld hold. The Riemann Hypothesis would also follow if <math>M(n)\le C\sqrt{n}</math> for any constant <math>C</math>.
  2 KB (425 words) - 12:01, 20 October 2016
• Quadratic residues
  ...] <math>m</math> if there is some integer <math>n</math> so that <math>n^2-a</math> is [[divisibility | divisible]] by <math>m</math>. ...lo\ }\ p, \\ -1 & \mathrm{if }\ p\nmid a\ \mathrm{ and }\ a\ \mathrm{\ is\ a\ quadratic\ nonresidue\ modulo\ }\ p. \end{cases}</math>
  5 KB (778 words) - 13:10, 29 November 2017
• Power of a Point Theorem
  ...e lengths of the [[line segment]]s formed when two [[line]]s [[intersect]] a [[circle]] and each other. ...of the lines is [[tangent line|tangent]] to the circle while the other is a [[secant line|secant]] (middle figure). In this case, we have <math> AB^2 =
  5 KB (827 words) - 17:30, 21 February 2024
• Fundamental Theorem of Algebra
  ...tant]] [[polynomial]] with [[complex number|complex]] [[coefficient]]s has a complex [[root]]. In fact, every known proof of this theorem involves some ...gorithm]] that every complex polynomial of degree <math>n</math> has <math>n</math> complex roots, counting multiplicities. In other words, every polyn
  5 KB (832 words) - 14:22, 11 January 2024
• Collatz Problem
  ...sitive integer]] <math>n</math>, the sequence <math>\{n,f(n),f(f(n)),f(f(f(n))),\ldots\}</math> contains 1. This conjecture is still open. Some people h ==Properties of <math>f(n)</math> ==
  1 KB (231 words) - 19:45, 24 February 2020
• Triangle Inequality
  The '''Triangle Inequality''' says that in a [[nondegenerate]] [[triangle]] <math>ABC</math>: ..._n = \left(\sum_{j=1}^n a_j\right) - a_i</math> for <math>i = 1, 2 \ldots, n</math>. Expressing the inequality in this form leads to <math>2a_i < P</ma
  2 KB (268 words) - 03:02, 3 January 2021
• Majorization
  ...m_{i=1}^{k}a_i \ge \sum_{i=1}^{k}b_i </math>, with equality when <math>k = n </math>. If <math>\{a_i\} </math> and <math>\{b_i\} </math> are not necess ...for all <math> 1\le k \le n </math>, <math>\sum_{i=k}^n a_i \le \sum_{i=k}^n b_i</math>, with equality when <math>k=1 </math>. An interesting consequen
  2 KB (288 words) - 22:48, 5 July 2023
• Surjection
  ..., the range is a subset of the codomain.) In adjectival form, we say that a function is ''surjective'' or ''onto''. ...defined by <math>f(x) = x+1</math> is not surjective because there exists a [[natural number]] which is not one more than any other natural number.
  794 bytes (131 words) - 22:39, 13 May 2020
• Algebraic geometry
  ...> be a [[prime ideal]] of <math>R</math>. Then <math>V(I)=\{p\in\mathbb{A}^n\mid f(p)=0\mathrm{\ for\ all\ } f\in I\}</math> is called an '''affine alge ...s are algebraic varieties. A projective space <math>\mathbb{P}^n</math> is a quotient set with an equivalence class satisfying
  2 KB (361 words) - 01:59, 24 January 2020
• Prime Number Theorem
  constants <math>A</math> and <math>B</math>, <cmath> \pi(x) \sim \frac{x}{A \log x - B} . </cmath>
  10 KB (1,729 words) - 19:52, 21 October 2023
• Note that with two sequences <math>\mathbf{a}</math> and <math>\mathbf{b}</math>, and <math>\lambda_a = \lambda_b = 1/2< ...nces of nonnegative reals, and let <math>\{ \lambda_i \}_{i=1}^n</math> be a sequence of nonnegative reals such that <math>\sum \lambda = 1</math>. The
  4 KB (774 words) - 12:12, 29 October 2016
• Infinite
  A [[set]] <math>S</math> is said to be '''infinite''' if there is a [[surjection]] <math>f:S\to\mathbb{Z}</math>. If this is not the case, <mat In simplified language, a set is infinite if it doesn't end, i.e. you can always find another element
  1 KB (186 words) - 23:19, 16 August 2013
• 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
• Commutative property
  An [[operation]] (especially a [[binary operation]]) is said to have the '''commutative property''' or to ...eal number]]s, [[integer]]s, etc.) because <math>\displaystyle a + b = b + a</math>. However, the operation of [[division]] is not commutative over the
  2 KB (301 words) - 17:46, 16 March 2012
• Permutation
  ...are <math>r!</math> (the [[factorial]] of <math>r</math>) permutations of a set with <math>r</math> distinct objects. ...ite]] sets. In this case, a permutation of a set <math>S</math> is simply a [[bijection]] between <math>S</math> and itself.
  3 KB (422 words) - 11:01, 25 December 2020
• Bertrand's Postulate
  ...em. A more widely known version states that there is a prime between <math>n</math> and <math>2n</math>. ...closer look at the [[combinations|binomial coefficient]] <math>\binom{2n}{n}</math>. Assuming that the reader is familiar with that proof, the Bertrand
  2 KB (309 words) - 21:43, 11 January 2010
• Riemann zeta function
  The '''Riemann zeta function''' is a function very important in [[number theory]]. In particular, the [[Riemann Hypothesis]] is a conjecture
  9 KB (1,547 words) - 03:04, 13 January 2021
• Modular arithmetic/Introduction
  ...is article is to explain the basics of modular arithmetic while presenting a progression of more difficult and more interesting problems that are easily ...ple, except let's replace the <math>12</math> at the top of the clock with a <math>0</math>.
  15 KB (2,396 words) - 20:24, 21 February 2024
• Perfect square
  ...'perfect square''' if there is an integer <math>m</math> so that <math>m^2=n</math>. The first few perfect squares are <math>0, 1, 4, 9, 16, 25, 36</mat ...th>n</math> square numbers (starting with <math>1</math>) is <math>\frac{n(n+1)(2n+1)}{6}</math>
  954 bytes (155 words) - 01:14, 29 November 2023
• Uncountable
  ...d to be '''uncountable''' if there is no [[injection]] <math>f:S\to\mathbb{N}</math>. Assuming the [[Axiom of choice]], every set that is ''not'' uncoun ...f <math>A</math> (in other words, take an injection <math>f: A \to \mathbb{N}</math>, and denote <math>\omega_i = f(i)</math>).
  2 KB (403 words) - 20:53, 13 October 2019
• Gamma function
  The '''Gamma function''' is a generalization of the notion of a [[factorial]] to [[complex number|complex numbers]]. ...plex numbers. We can then use the identity to extend the Gamma function to a [[meromorphic]] function on the full [[complex plane]], with simple poles a
  840 bytes (137 words) - 22:26, 22 June 2009
• Modular arithmetic/Intermediate
  ...th>n</math>), if the difference <math>{a - b}</math> is divisible by <math>n</math>. ...Z}_n</math> for short). This structure gives us a useful tool for solving a wide range of number-theoretic problems, including finding solutions to [[D
  14 KB (2,317 words) - 19:01, 29 October 2021
• Subset
  ...r than <math>B</math> itself. In the latter case, <math>A</math> is called a ''proper subset''. The following is a true statement:
  1 KB (217 words) - 09:32, 13 August 2011
• 2006 AIME I Problems
  {{AIME Problems|year=2006|n=I}} In quadrilateral <math> ABCD , \angle B </math> is a right angle, diagonal <math> \overline{AC} </math> is perpendicular to <mat
  7 KB (1,173 words) - 03:31, 4 January 2023
• 2006 AIME I Problems/Problem 15
  Given that a sequence satisfies <math> x_0=0 </math> and <math> |x_k|=|x_{k-1}+3| </math ...the numbers in this list up in the following way: Whenever a positive and a negative number are adjacent in this progression, pair them up and remove t
  6 KB (910 words) - 19:31, 24 October 2023
• 2006 AIME I Problems/Problem 14
  ...> is not divisible by the square of any prime. Find <math> \lfloor m+\sqrt{n}\rfloor. </math> (The notation <math> \lfloor x\rfloor </math> denotes the triple O=(0,0,0),T=(0,0,5),C=(0,3,0),A=(-3*3^.5/2,-3/2,0),B=(3*3^.5/2,-3/2,0);
  6 KB (980 words) - 21:45, 31 March 2020
• 2006 AIME I Problems/Problem 13
  ...st integer <math> n </math> less than 1000 such that <math> S_n </math> is a [[perfect square]]. .../math> but not by <math>2^n, \ldots,</math> and <math>2^{n-1}-2^{n-2} = 2^{n-2}</math> elements of <math>S</math> that are divisible by <math>2^1</math>
  10 KB (1,702 words) - 00:45, 16 November 2023
• 2006 AIME I Problems/Problem 12
  ...e have <math>a^3 + b^3 = (a+b)^3 \rightarrow ab(a+b) = 0</math>. But <math>a+b = 2\cos 4x\cos x</math>, so we require <math>\cos x = 0</math>, <math>\co ...A = \{150, 126, 162, 198, 112.5, 157.5\}</math> and thus <math>\sum_{x \in A} x = \boxed{906}</math>.
  911 bytes (147 words) - 18:54, 13 December 2017
• LaTeX:Symbols
  This article provides a short list of commonly used LaTeX symbols. .../math> on the web, (technically an AJAX library simulating it.)) maintains a [http://docs.mathjax.org/en/latest/tex.html#supported-latex-commands list o
  16 KB (2,324 words) - 16:50, 19 February 2024
• 2006 AIME I Problems/Problem 11
  ...h]] <math> k </math> for each [[integer]] <math> k, 1 \le k \le 8. </math> A tower is to be built using all 8 cubes according to the rules: * The cube immediately on top of a cube with edge-length <math> k </math> must have edge-length at most <math>
  3 KB (436 words) - 05:40, 4 November 2022
• 2006 AIME I Problems/Problem 10
  ...are positive integers whose [[greatest common divisor]] is 1. Find <math> a^2+b^2+c^2. </math> ...h>, which can be easily solved to be <math>6x = 2y + 5</math>. Thus, <math>a^2 + b^2 + c^2 = \boxed{065}</math>.
  4 KB (731 words) - 17:59, 4 January 2022
• 2006 AIME I Problems/Problem 9
  ...8 a_{12} = 2006, </math> find the number of possible ordered pairs <math> (a,r). </math> <cmath>\log_8 a_1+\log_8 a_2+\ldots+\log_8 a_{12}= \log_8 a+\log_8 (ar)+\ldots+\log_8 (ar^{11}) \\
  4 KB (651 words) - 18:27, 22 May 2021
• 2006 AIME I Problems/Problem 8
  ...area of rhombus <math> \mathcal{T}</math>. Given that <math> K </math> is a [[positive integer]], find the number of possible values for <math> K</math pair A=(0,0), B=(4.2,0), C=(5.85,-1.6), D=(4.2,-3.2), EE=(0,-3.2), F=(-1.65,-1.6),
  5 KB (730 words) - 15:05, 15 January 2024
• 2006 AIME I Problems/Problem 7
  ...atio of shaded region <math> D </math> to the area of shaded region <math> A. </math> pair A=(1/3,4), B=A+7.5*dir(-17), C=A+7*dir(10);
  4 KB (709 words) - 01:50, 10 January 2022
• 2006 AIME I Problems/Problem 6
  ...cimal| decimals]] of the form <math> 0.\overline{abc} </math> where <math> a, b, c </math> are distinct [[digit]]s. Find the sum of the elements of <mat Another method, albeit a little risky, that can be used is to note that the numbers between 1 and 99
  2 KB (237 words) - 19:14, 20 November 2023
• 2006 AIME I Problems/Problem 5
  ...n be written as <math> a\sqrt{2}+b\sqrt{3}+c\sqrt{5}, </math> where <math> a, b, </math> and <math> c </math> are [[positive]] [[integer]]s. Find <math> <cmath> a\sqrt{2}+b\sqrt{3}+c\sqrt{5} = \sqrt{104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2
  3 KB (439 words) - 18:24, 10 March 2015
• 2006 AIME I Problems/Problem 4
  ...oduct <math> 1!2!3!4!\cdots99!100!. </math> Find the remainder when <math> N </math> is divided by <math>1000</math>. A number in decimal notation ends in a zero for each power of ten which divides it. Thus, we need to count both t
  2 KB (278 words) - 08:33, 4 November 2022
• 2006 AIME I Problems/Problem 3
  ...math> so we take <math>N_0 = 25</math> and <math>n = 2.</math> Then <cmath>N = 7 \cdot 10^2 + 25 = \boxed{725},</cmath> and indeed, <math>725 = 29 \cdot ...ow that <math>N<1000</math> (because this is an AIME problem). Thus, <math>N</math> has <math>1,</math> <math>2</math> or <math>3</math> digits. Checkin
  4 KB (622 words) - 03:53, 10 December 2022
• 2006 AIME I Problems/Problem 2
  ...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> Alternatively, for ease of calculation, let set <math>\mathcal{B}</math> be a 10-element subset of <math>\{1,2,3,\ldots,100\}</math>, and let <math>T</ma
  1 KB (189 words) - 20:05, 4 July 2013
• 2006 AIME I Problems/Problem 1
  In [[quadrilateral]] <math> ABCD</math>, <math>\angle B </math> is a [[right angle]], [[diagonal]] <math>\overline{AC}</math> is [[perpendicular pair C=(0,0), D=(0,-14),A=(-(961-196)^.5,0),B=IP(circle(C,21),circle(A,18));
  2 KB (217 words) - 21:43, 2 February 2014
• 2022 AIME I Problems/Problem 1
  .../math> and <math>Q(x)</math> cancel, we conclude that <math>R(x)</math> is a linear polynomial. for some constants <math>a,b,c</math> and <math>d.</math>
  4 KB (670 words) - 13:03, 13 November 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
• 2006 AMC 12A Problems
  {{AMC12 Problems|year=2006|ab=A}} <math> \mathrm{(A) \ } 31\qquad \mathrm{(B) \ } 32\qquad \mathrm{(C) \ } 33\qquad \mathrm{(D)
  15 KB (2,223 words) - 13:43, 28 December 2020
• 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, respectively, of the digits
  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
• 2004 AMC 12B Problems
  <math>(\mathrm {A}) 3\qquad (\mathrm {B}) 6 \qquad (\mathrm {C}) 9 \qquad (\mathrm {D}) 12 \q In the expression <math>c\cdot a^b-d</math>, the values of <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> are 0, 1, 2, and
  13 KB (2,049 words) - 13:03, 19 February 2020
• 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 1
  \text {(A) } - 2006 \qquad \text {(B) } - 1 \qquad \text {(C) } 0 \qquad \text {(D) } <math>(-1)^n=1</math> if n is even and <math>-1</math> if n is odd. So we have
  468 bytes (70 words) - 10:40, 15 September 2017
• 2006 AMC 12B Problems/Problem 14
  ...h>, <math>J</math> and <math>N</math> are all positive integers with <math>N>1</math>. What is the cost of the jam Elmo uses to make the sandwiches? \mathrm{(A)}\ 1.05
  1 KB (227 words) - 17:21, 8 December 2013
• 2006 AMC 12B Problems/Problem 18
  ...ne unit up, or one unit down. If the object starts at the origin and takes a ten-step path, how many different points could be the final point? \mathrm{(A)}\ 120
  2 KB (354 words) - 16:57, 28 December 2020
• 2006 AMC 12B Problems/Problem 20
  \mathrm{(A)}\ \frac 18 For a fixed <math>k</math> the length of the interval <math>\left[ 10^k, \frac{10
  3 KB (485 words) - 14:09, 21 May 2021
• 2006 AMC 12B Problems/Problem 22
  ...divisible by <math>10</math>. What is the smallest possible value of <math>n</math>? \mathrm{(A)}\ 489
  5 KB (881 words) - 15:52, 23 June 2021
• 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
• 2006 AMC 12B Problems/Problem 25
  ...tegers is defined by the rule <math>a_{n+2}=|a_{n+1}-a_n|</math> for <math>n\geq 1</math>. If <math>a_1=999</math>, <math>a_2<999</math> and <math>a_{20 \mathrm{(A)}\ 165
  5 KB (924 words) - 12:02, 15 June 2022
• 2006 AMC 12A Problems/Problem 15
  <math> \mathrm{(A) \ } \frac{\pi}{6}\qquad \mathrm{(B) \ } \frac{\pi}{3}\qquad \mathrm{(C) \ ..., x must be in the form of <math>\frac{\pi}{2} + \pi n</math>, where <math>n</math> denotes any [[integer]].
  919 bytes (138 words) - 12:45, 4 August 2017
• 2006 AMC 12A Problems/Problem 17
  ...ies on the circle, on the same side of <math>\overline{BE}</math> as <math>A</math>. Segment <math>AF</math> is tangent to the circle, and <math>AF=\sqr label("A", (-s,0), W);
  6 KB (958 words) - 23:29, 28 September 2023
• 2006 AMC 12A Problems/Problem 23
  ...h>S=(a_1,a_2,\ldots ,a_n)</math> of <math>n</math> real numbers, let <math>A(S)</math> be the sequence <math>\left(\frac{a_1+a_2}{2},\frac{a_2+a_3}{2},\ldots ,\frac{a_{n-1}+a_n}{2}\right)</math>
  3 KB (466 words) - 22:40, 29 September 2023
• 2006 AMC 12A Problems/Problem 24
  <math> \mathrm{(A) \ } 6018\qquad \mathrm{(B) \ } 671,676\qquad \mathrm{(C) \ } 1,007,514\qqu <cmath>\sum_{a+b+c=2006}{\frac{2006!}{a!b!c!}x^ay^bz^c}</cmath>
  8 KB (1,332 words) - 17:37, 17 September 2023
• 2006 AMC 12A Problems/Problem 25
  <math> \mathrm{(A) \ } 277\qquad \mathrm{(B) \ } 311\qquad \mathrm{(C) \ } 376\qquad \mathrm{ ...on can be solved fairly directly by casework and pattern-finding. We give a somewhat more general attack, based on the solution to the following proble
  8 KB (1,405 words) - 11:52, 27 September 2022
• 2005 AMC 12A Problems/Problem 20
  ...h>, and <math>f^{[n + 1]}(x) = f^{[n]}(f(x))</math> for each integer <math>n \geq 2</math>. For how many values of <math>x</math> in <math>[0,1]</math> (\text {A}) \ 0 \qquad (\text {B}) \ 2005 \qquad (\text {C})\ 4010 \qquad (\text {D})
  3 KB (437 words) - 23:49, 28 September 2022
• 2005 AMC 12B Problems/Problem 12
  ...f <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
• 2005 AMC 12B Problems/Problem 21
  ...e greatest integer <math>k</math> such that <math>7^k</math> divides <math>n</math>? <math>\mathrm{(A)}\ {{{0}}} \qquad \mathrm{(B)}\ {{{1}}} \qquad \mathrm{(C)}\ {{{2}}} \qquad
  888 bytes (140 words) - 20:04, 24 December 2020
• 2005 AMC 12B Problems/Problem 22
  A sequence of complex numbers <math>z_{0}, z_{1}, z_{2}, ...</math> is define <cmath>z_{n+1} = \frac {iz_{n}}{\overline {z_{n}}},</cmath>
  4 KB (660 words) - 17:40, 24 January 2021
• 2005 AMC 12B Problems/Problem 24
  ...th> are relatively prime positive integers. What is the value of <math>m + n</math>? <math> \mathrm{(A)}\ {{{14}}}\qquad\mathrm{(B)}\ {{{15}}}\qquad\mathrm{(C)}\ {{{16}}}\qquad\m
  4 KB (761 words) - 09:10, 1 August 2023
• 2005 AMC 12B Problems/Problem 25
  ...the six [[vertex|vertices]] of a regular [[octahedron]], with each ant at a different vertex. Simultaneously and independently, each ant moves from its <math>\mathrm{(A)}\ \frac {5}{256}
  10 KB (1,840 words) - 21:35, 7 September 2023
• Power of a Point Theorem/Introductory Problem 4
  ...</math> of a given circle are perpendicular to each other and intersect at a right angle at <math>E</math> . Given that <math> BE = 16, DE = 4, </math> pair A = (3,0);
  1 KB (177 words) - 02:14, 26 November 2020
• Root (polynomial)
  ...<math>a</math> in the [[domain]] of the function such that <math>f(a) = (x-a) = 0</math>. ...wice, triple roots three times, and so on, there are in fact exactly <math>n</math> complex roots of <math>P(x)</math>.
  8 KB (1,427 words) - 21:37, 13 March 2022
• 2006 AMC 10A Problems
  {{AMC10 Problems|year=2006|ab=A}} <math>\mathrm{(A)}\ 31\qquad\mathrm{(B)}\ 32\qquad\mathrm{(C)}\ 33\qquad\mathrm{(D)}\ 34\qqu
  13 KB (2,028 words) - 16:32, 22 March 2022
• 2006 AMC 10A Problems/Problem 12
  Rolly wishes to secure his dog with an 8-foot rope to a [[square (geometry) | square]] shed that is 16 feet on each side. His prel MP('8', (20,-8), N);
  3 KB (424 words) - 10:14, 17 December 2021
• 2006 AMC 10A Problems/Problem 16
  A circle of radius <math>1</math> is [[tangent]] to a circle of radius <math>2</math>. The sides of <math>\triangle ABC</math> ar D('B', (0,0),SW); D('C',(4*t,0), SE); D('A', (2*t, 8), N);
  5 KB (732 words) - 23:19, 19 September 2023
• 2006 AMC 10A Problems/Problem 17
  pair A,B,C,D,E,F,G,H,W,X,Y,Z; A=(0,2); B=(1,2); C=(2,2); D=(3,2);
  6 KB (1,066 words) - 00:21, 2 February 2023
• 2006 AMC 10A Problems/Problem 19
  <math>\textbf{(A) } 0\qquad\textbf{(B) } 1\qquad\textbf{(C) } 59\qquad\textbf{(D) } 89\qquad The sum of the angles of a triangle is <math>180</math> degrees. For an arithmetic progression with an
  2 KB (259 words) - 03:10, 22 June 2023
• 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
• Newman's Tauberian Theorem
  '''Newman's Tauberian Theorem''' is a [[tauberian theorem]] Let <math>f:(0,+\infty)\to\mathbb C</math> be a bounded function. Assume that
  6 KB (1,034 words) - 07:55, 12 August 2019
• 2006 USAMO Problems
  ...that there exist integers <math>m</math> and <math>n</math> with <math>0<m<n<p</math> and if and only if <math>s</math> is not a divisor of <math>p-1</math>.
  3 KB (520 words) - 09:24, 14 May 2021
• 1991 AJHSME Problems
  <math>\text{(A)}\ 222,222,222,222 \qquad <math>\text{(A)}\ 4 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 12 \qquad \text{(D)}\ 16 \qqua
  17 KB (2,246 words) - 13:37, 19 February 2020
• 2022 USAJMO Problems/Problem 1
  ...<math>a_n-g_n</math> is divisible by <math>m</math> for all integers <math>n>1</math>; ...\nmid d</math> and <math>m|a+(n-1)d-gr^{n-1}</math> for all integers <math>n>1</math>.
  4 KB (792 words) - 00:29, 13 April 2024
• 2006 AIME II Problems/Problem 2
  .../math> is a positive integer. Find the number of possible values for <math>n</math>. ...equality]] and applying the well-known logarithmic property <math>\log_{c} a + \log_{c} b = \log_{c} ab</math>, we have that
  1 KB (164 words) - 14:58, 14 April 2020
• 2005 AIME II Problems/Problem 1
  ...imes the number of possible sets of 3 cards that can be drawn. Find <math> n. </math> ...<math>{n \choose 6} = \frac{n\cdot(n-1)\cdot(n-2)\cdot(n-3)\cdot(n-4)\cdot(n-5)}{6\cdot5\cdot4\cdot3\cdot2\cdot1}</math>.
  1 KB (239 words) - 11:54, 31 July 2023
• 2005 AIME II Problems/Problem 2
  ...and <math> n </math> are [[relatively prime]] [[integer]]s, find <math> m+n. </math> ...We need only calculate the probability the first and second person all get a roll of each type, since then the rolls for the third person are determined
  4 KB (628 words) - 11:28, 14 April 2024
• 2005 AIME II Problems/Problem 3
  ...and <math> n </math> are [[relatively prime]] [[integer]]s. Find <math> m+n. </math> ...>10 = \frac a{1 + r}</math>. Then <math>a = 2005 - 2005r</math> and <math>a = 10 + 10r</math> so <math>2005 - 2005r = 10 + 10r</math>, <math>1995 = 201
  3 KB (581 words) - 07:54, 4 November 2022
• 2005 AIME II Problems/Problem 4
  ...(a positive integer) is a divisor of one of the numbers. Therefore, <math>n</math> can be expressed as <math>{p_1}^{e_1}</math> or as <math>{p_2}^{e_2} ...to <math>5^{10}</math>) for <math>p_1=5</math>, and 1 possibility if <math>n=1</math>. From this case, there are <math>11+22+10+1=44</math> possibilitie
  3 KB (377 words) - 18:36, 1 January 2024
• 2005 AIME II Problems/Problem 13
  ...math> P(17)=10 </math> and <math> P(24)=17. </math> Given that <math> P(n)=n+3 </math> has two distinct integer solutions <math> n_1 </math> and <math> ...it has roots at <math>17</math> and <math>24</math>. Hence <math>P(x)-x+7=A(x-17)(x-24)</math>. In particular, this means that
  4 KB (642 words) - 14:55, 12 August 2019
• 2005 AIME II Problems/Problem 5
  ...b) </math> of [[integer]]s such that <math> \log_a b + 6\log_b a=5, 2 \leq a \leq 2005, </math> and <math> 2 \leq b \leq 2005. </math> ...r <math>\log b=2\log a </math>, so either <math> b=a^3 </math> or <math> b=a^2 </math>.
  3 KB (547 words) - 19:15, 4 April 2024
• 2005 AIME II Problems/Problem 6
  ...original stack, the stack is named magical. For example, eight cards form a magical stack because cards number 3 and number 6 retain their original pos ...rds from each of piles A, B in front of card 131. This suggests that <math>n = 131 + 65 = 196</math>; the total number of cards is <math>196 \cdot 2 = \
  2 KB (384 words) - 00:31, 26 July 2018
• 2005 AIME II Problems
  {{AIME Problems|year=2005|n=II}} ...imes the number of possible sets of 3 cards that can be drawn. Find <math> n. </math>
  7 KB (1,119 words) - 21:12, 28 February 2020
• 2005 AIME II Problems/Problem 7
  ...\sqrt[2^n]{5} + 1)(\sqrt[2^n]{5} - 1) = (\sqrt[2^n]{5})^2 - 1^2 = \sqrt[2^{n-1}]{5} - 1 </math>. {{AIME box|year=2005|n=II|num-b=6|num-a=8}}
  2 KB (279 words) - 12:33, 27 October 2019
• 2005 AIME II Problems/Problem 8
  ...> n </math> is not divisible by the square of any [[prime]], find <math> m+n+p. </math> pair A = OP(cir3, t), B = IP(cir3, t), T1 = IP(cir1, t), T2 = IP(cir2, t);
  4 KB (693 words) - 13:03, 28 December 2021
• 2005 AIME II Problems/Problem 9
  ...ath> less than or equal to <math>1000</math> is <math> (\sin t + i \cos t)^n = \sin nt + i \cos nt </math> true for all real <math> t </math>? ...math>n</math>. So, we'd like to somehow convert our given expression into a form from which we can apply De Moivre's Theorem.
  6 KB (1,154 words) - 03:30, 11 January 2024
• 2005 AIME II Problems/Problem 12
  ...> AB </math> with <math> AE<BF </math> and <math> E </math> between <math> A </math> and <math> F, m\angle EOF =45^\circ, </math> and <math> EF=400. </m ...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 II Problems/Problem 10
  ...</math> and <math> n </math> are relatively prime integers, find <math> m+n. </math> ...ertices]] of the octahedron be <math>A, B, C, D, E, F</math> so that <math>A</math> and <math>F</math> are opposite each other and <math>AF = s\sqrt2</m
  3 KB (436 words) - 03:10, 23 September 2020
• 2005 AIME II Problems/Problem 11
  ...math> be a positive integer, and let <math> a_0, a_1,\ldots,a_m </math> be a sequence of reals such that <math>a_0 = 37, a_1 = 72, a_m = 0, </math> and Thus the product <math>a_{k}a_{k+1}</math> is a [[monovariant]]: it decreases by 3 each time <math>k</math> increases by 1.
  3 KB (499 words) - 18:52, 21 November 2022
• Euler's identity
  ...ers]] and/or [[trigonometry]]. Euler's formula replaces "[[cis]]", and is a superior notation, as it encapsulates several nice properties: ...states that for any [[real number]] <math>\theta</math> and integer <math>n</math>,
  3 KB (452 words) - 23:17, 4 January 2021
• 2005 AIME I Problems
  {{AIME Problems|year=2005|n=I}} ...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
  6 KB (983 words) - 05:06, 20 February 2019
• 2005 AIME I Problems/Problem 1
  ...] 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 are ...f the triangle plus <math>r</math>. Thus, the radius of <math>C</math> has a length of <math>3r = 30</math>, and so <math>r = 10</math>. <math>K = 30^2\
  1 KB (213 words) - 13:17, 22 July 2017
• 2005 AIME I Problems/Problem 2
  ..., <math>(1002,2)</math> and <math>(2004,1)</math>, and each of these gives a possible value of <math>k</math>. Thus the requested number of values is <m {{AIME box|year=2005|n=I|num-b=1|num-a=3}}
  2 KB (303 words) - 01:31, 5 December 2022
• 2005 AIME I Problems/Problem 3
  ...s,, so <math>n</math> must be in the form <math>n=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 4
  ...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 ...<math>n \leq 14</math>. In fact, when <math>n = 14</math> we have <math>n(n + 7) = 14\cdot 21 = 294 = 17^2 + 5</math>, so this number works and no larg
  8 KB (1,248 words) - 11:43, 16 August 2022
• 2005 AIME I Problems/Problem 5
  ...e, but not on the other. He wants to stack the eight coins on a table into a single stack so that no two adjacent coins are face to face. Find the numbe ...since after the first H no more tails can appear. The first H can occur in a maximum of eight times different positions, and then there is also the poss
  5 KB (830 words) - 01:51, 1 March 2023
• 2005 AIME I Problems/Problem 6
  ...n the roots of the above equation are <math>x = 1 + i^n r</math> for <math>n = 0, 1, 2, 3</math>. The two non-real members of this set are <math>1 + ir If you think of each part of the product as a quadratic, then <math>((x-1)^2+\sqrt{2006})</math> is bound to hold the two
  4 KB (686 words) - 01:55, 5 December 2022
• 2005 AIME I Problems/Problem 7
  ...rilateral]] <math> ABCD,\ BC=8,\ CD=12,\ AD=10, </math> and <math> m\angle A= m\angle B = 60^\circ. </math> Given that <math> AB = p + \sqrt{q}, </math> label("$A$",(0,0),SW);
  4 KB (567 words) - 20:20, 3 March 2020
• 2005 AIME I Problems/Problem 8
  ...h> n </math> are [[relatively prime]] [[positive integer]]s, find <math> m+n. </math> ...atement says that <math>2^{111\cdot(x_1 + x_2 + x_3)} = 4</math> so taking a [[logarithm]] of that gives <math>111(x_1 + x_2 + x_3) = 2</math> and <math
  1 KB (161 words) - 19:50, 2 January 2022
• 2005 AIME I Problems/Problem 9
  ...> a,b, </math> and <math> c </math> are [[positive integer]]s, find <math> a+b+c+p+q+r. </math> ...}{6} = \frac{2}{3}</math> of all orientations, so from these cubes we gain a factor of <math>\left(\frac{2}{3}\right)^6</math>.
  4 KB (600 words) - 21:44, 20 November 2023
• 2005 AIME I Problems/Problem 10
  ...</math> are <math> (p,q). </math> The [[line]] containing the [[median of a triangle | median]] to side <math> BC </math> has [[slope]] <math> -5. </ma 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
• 2005 AIME I Problems/Problem 11
  ...mum value of <math> d </math> is <math> m - \sqrt{n},</math> find <math> m+n. </math> We note that aligning the base of the semicircle with a side of the square is certainly non-optimal. If the semicircle is tangent
  4 KB (707 words) - 11:11, 16 September 2021
• 2005 AIME I Problems/Problem 12
  ...005 </math> with <math> S(n) </math> [[even integer | even]]. Find <math> |a-b|. </math> ...if and only if there are an odd number of perfect squares less than <math>n</math>. So <math>S(1), S(2)</math> and <math>S(3)</math> are odd, while <m
  4 KB (647 words) - 02:29, 4 May 2021
• 2005 AIME I Problems/Problem 13
  A particle moves in the [[Cartesian plane]] according to the following rules: ...> the particle may only move to <math> (a+1,b), (a,b+1), </math> or <math>(a+1,b+1). </math>
  5 KB (897 words) - 00:21, 29 July 2022
• 2005 AIME I Problems/Problem 14
  ...unique [[square]] <math> S </math> such that each of the four points is on a different side of <math> S. </math> Let <math> K </math> be the area of <ma Consider a point <math>E</math> such that <math>AE</math> is [[perpendicular]] to <mat
  3 KB (561 words) - 14:11, 18 February 2018
• 2005 AIME I Problems/Problem 15
  ...| divisible]] by the [[perfect square | square]] of a prime, find <math> m+n. </math> pair A=(0,0),B=(26,0),C=IP(circle(A,10),circle(B,20)),D=(B+C)/2,I=incenter(A,B,C);
  5 KB (906 words) - 23:15, 6 January 2024
• 2005 AIME II Problems/Problem 15
  ...h> a </math> for which the line <math> y=ax </math> contains the center of a circle that is externally [[tangent (geometry)|tangent]] to <math> w_2 </ma pair A = (-5, 12), B = (5, 12), C = (0, 0);
  12 KB (2,000 words) - 13:17, 28 December 2020
• 2005 AIME II Problems/Problem 14
  pair A = origin; pair C = rotate(15,A)*(A+dir(-50));
  13 KB (2,129 words) - 18:56, 1 January 2024
• 2004 AIME I Problems/Problem 15
  ...itive integers <math>n</math>. Let <math>d(x)</math> be the smallest <math>n</math> such that <math>x_n=1</math>. (For example, <math>d(100)=3</math> an ...icting our assumption that <math>20</math> was the smallest value of <math>n</math>. Using [[complementary counting]], we see that there are only <math>
  9 KB (1,491 words) - 01:23, 26 December 2022
• 2004 AIME I Problems/Problem 14
  ...are [[positive]] [[integer]]s, and <math> c </math> is prime. Find <math> a+b+c. </math> triple Oxy = (0,0,0), A=(4*5^.5,-8,4), B=(0,-8,h), C=(Cxy.x,Cxy.y,0), D=(A.x,A.y,0), E=(B.x,B.y,0), O=(O.x,O.y,h);
  4 KB (729 words) - 01:00, 27 November 2022
• 2004 AIME I Problems/Problem 13
  ...and <math> n </math> are relatively prime positive integers, find <math> m+n. </math> ...he form <math>\frac m{19}</math> or <math>\frac n {17}</math> for <math>m, n > 0</math>.
  2 KB (298 words) - 20:02, 4 July 2013
• 2004 AIME I Problems/Problem 12
  ...and <math> n </math> are relatively prime positive integers, find <math> m+n. </math> The notation <math> [z] </math> denotes the [[floor function|great Graphing this yields a series of [[rectangle]]s which become smaller as you move toward the [[orig
  2 KB (303 words) - 22:28, 11 September 2020
• 2004 AIME I Problems/Problem 11
  ...h> n </math> are [[relatively prime]] [[positive integer]]s, find <math> m+n. </math> ...Using the [[Pythagorean Theorem]], we get <math>\ell = 5</math> and <math>A = 24\pi</math>.
  5 KB (839 words) - 22:12, 16 December 2015
• 2004 AIME I Problems/Problem 10
  ...d <math> n </math> are relatively prime positive integers. Find <math> m + n. </math> ...one unit away from <math>\overline{AC}</math>. Let this triangle be <math>A'B'C'</math>.
  5 KB (836 words) - 07:53, 15 October 2023
• 2004 AIME I Problems/Problem 9
  ...<math> n</math> are [[relatively prime]] positive integers. Find <math> m+n. </math> .../math> or <math>\overline{FG}</math>. <math>V_2</math> is a trapezoid with a right angle then, from which it follows that <math>V_1</math> contains one
  4 KB (618 words) - 20:01, 4 July 2013
• 2004 AIME I Problems/Problem 1
  ...from left to right. What is the sum of the possible remainders when <math> n </math> is divided by <math>37</math>? ...1000(n + 3) + 100(n + 2) + 10(n + 1) + n = 3210 + 1111n</math>, for <math>n \in \lbrace0, 1, 2, 3, 4, 5, 6\rbrace</math>.
  2 KB (374 words) - 14:53, 27 December 2019
• 2004 AIME I Problems/Problem 2
  ...The absolute value of the difference between the greatest element of <math>A</math> and the greatest element of <math>B</math> is <math>99</math>. Find ...e median) must be <math>2</math>. Therefore, the largest element in <math>A</math> is <math>2 + \frac{m-1}{2}</math>.
  8 KB (1,437 words) - 21:53, 19 May 2023
• 2004 AIME I Problems/Problem 3
  ...gular and <math>12</math> of which are quadrilaterals. A space diagonal is a line segment connecting two non-adjacent vertices that do not belong to the ...f the [[polyhedron]] determines either an [[edge]], a face [[diagonal]] or a space diagonal. We have <math>{26 \choose 2} = \frac{26\cdot25}2 = 325</ma
  1 KB (156 words) - 17:56, 1 January 2016
• 2004 AIME I Problems/Problem 4
  ...re. The [[midpoint]]s of the line segments in set <math> S </math> enclose a region whose [[area]] to the nearest hundredth is <math>k</math>. Find <ma ...midpoints lying on the sides determined by vertex <math>(0,0)</math> form a quarter-[[circle]] with [[radius]] 1.
  3 KB (532 words) - 09:22, 11 July 2023
• 2004 AIME I Problems/Problem 5
  ...<math> n </math> are relatively prime positive integers. What is <math> m+n </math>? Let <math>q</math> be the number of questions Beta takes on day 1 and <math>a</math> be the number he gets right. Let <math>b</math> be the number he get
  3 KB (436 words) - 18:31, 9 January 2024
• 2004 AIME I Problems/Problem 6
  ...h>x_2x_40x_3</math>, <math>x_3x_40x_2</math>. Because we know that zero is a digit, there are <math>3\cdot{9\choose 3}=252</math> snakelike numbers whic ...ays to permute to make the number snakelike, b-a-c, or c-a-b. And, we pick a,b,c from 1 to 9, since 0 has already been chosen as one of the digits. So,
  3 KB (562 words) - 18:12, 4 March 2022
• 2004 AIME I Problems/Problem 7
  <cmath>\begin{align*}\left(\sum_{i=1}^{n} S_i\right)^2 &= \left(\sum_{i=1}^{n} S_i^2\right) + 2\left(\sum_{1 \le i \neq j}^{15} S_iS_j\right)\\ (-8)^2 &= and the right-hand sum comes from the formula for the sum of the first <math>n</math> perfect squares. Therefore, <math>|C| = \left|\frac{64-1240}{2}\righ
  5 KB (833 words) - 19:43, 1 October 2023
• 2004 AIME I Problems/Problem 8
  Define a regular <math> n </math>-pointed star to be the union of <math> n </math> line segments <math> P_1P_2, P_2P_3,\ldots, P_nP_1 </math> such tha .../math> line segments intersects at least one of the other line segments at a point other than an endpoint,
  4 KB (620 words) - 21:26, 5 June 2021
• 2004 AIME I Problems
  {{AIME Problems|year=2004|n=I}} ...from left to right. What is the sum of the possible remainders when <math> n </math> is divided by 37?
  9 KB (1,434 words) - 13:34, 29 December 2021
• 2004 AIME II Problems/Problem 15
  ...eated <math>8</math> more times. After the last fold, the strip has become a stack of <math>1024</math> unit squares. How many of these squares lie belo ...number of squares below the <math>n</math> square after the final fold in a strip of length <math>2^{k}</math>.
  6 KB (899 words) - 20:58, 12 May 2022
• 2004 AIME II Problems/Problem 14
  ...d from eight <math> 7 </math>'s in this way. For how many values of <math> n </math> is it possible to insert <math> + </math> signs so that the resulti ...</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 13
  ...and <math> n </math> are relatively prime positive integers, find <math> m+n. </math> ...parallel CE, BC \parallel AD, </math> it follows that <math>ABCF</math> is a [[parallelogram]], and so <math>\triangle ABC \cong \triangle CFA</math>. A
  3 KB (486 words) - 22:15, 7 April 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 11
  ...the cone is <math>125</math>, and crawls along the surface of the cone to a point on the exact opposite side of the cone whose distance from the vertex The easiest way is to unwrap the cone into a circular sector. Center the sector at the origin with one radius on the pos
  2 KB (268 words) - 22:20, 23 March 2023
• 2004 AIME II Problems/Problem 10
  ...{40} </math> whose binary expansions have exactly two <math>1</math>'s. If a number is chosen at random from <math> S, </math> the [[probability]] that ...and <math>y-x \equiv 3 \pmod 6 = 6n +3</math> for some whole number <math>n</math>.
  8 KB (1,283 words) - 19:19, 8 May 2024
• 2004 AIME II Problems/Problem 9
  ...est term in this sequence that is less than <math>1000</math>. Find <math> n+a_n. </math> ...(n-1)f(n)</math>, <math>a_{2n+1} = f(n)^2</math>, where <math>f(n) = nx - (n-1)</math>.{{ref|1}}
  3 KB (538 words) - 21:33, 30 December 2023
• 2004 AIME II Problems/Problem 8
  We can [[divisor function | count the number of divisors]] of a number by multiplying together one more than each of the [[exponentiation | ...math>2^a\cdot 3^b\cdot 167^c</math>. Thus we need to find how many <math>(a,b,c)</math> satisfy
  2 KB (353 words) - 18:08, 25 November 2023
• 2004 AIME II Problems/Problem 7
  ...and <math> n </math> are relatively prime positive integers. Find <math> m+n. </math> pair A=origin, B=(25,0), C=(25,70/3), D=(0,70/3), E=(8,0), F=(22,70/3), Bp=reflect
  9 KB (1,501 words) - 05:34, 30 October 2023
• 2004 AIME II Problems/Problem 6
  ...es the rest equally between the other two. Given that each monkey receives a [[whole number]] of bananas whenever the bananas are divided, and the numbe ...> is divisible by <math>72</math> (however, since the denominator contains a <math>27</math>, the factors of <math>3</math> cancel, and it only really n
  6 KB (950 words) - 14:18, 15 January 2024
• 2004 AIME II Problems/Problem 5
  In order to complete a large job, <math>1000</math> workers were hired, just enough to complete th A train is traveling at <math>1000</math> miles per hour and has one hour to
  4 KB (592 words) - 19:02, 26 September 2020
• 2004 AIME II Problems/Problem 4
  First, let's count numbers with only a single digit. We have nine of these for each length, and four lengths, so ...2^n - 2</math> ways to arrange them in an <math>n</math>-digit number, for a total of <math>(2^1 - 2) + (2^2 - 2) + (2^3 -2) + (2^4 - 2) = 22</math> suc
  3 KB (508 words) - 01:16, 19 January 2024
• 2004 AIME II Problems/Problem 3
  ...the 1-cm cubes cannot be seen. Find the smallest possible value of <math> N. </math> ...xtra layer makes the entire block <math>4\times8\times12</math>, and <math>N= \boxed{384}</math>.
  2 KB (377 words) - 11:53, 10 March 2014
• 2004 AIME II Problems/Problem 2
  ...h> n </math> are [[relatively prime]] [[positive integer]]s, find <math> m+n. </math> ...treated the choices as ordered; that is, Terry chose first one candy, then a second, and so on. We could also solve the problem using unordered choices
  2 KB (330 words) - 13:42, 1 January 2015

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