Search results

  • ...ehind The [[Art of Problem Solving]] as well as many [[math competitions]] is the use of creative methods to solve problems. In a way, students are disco An interesting example of this kind of thinking is the calculation of the sum of the [[series]] <math>\frac11 + \frac14 + \fra
    2 KB (314 words) - 06:45, 1 May 2014
  • ...principle'''. A common phrasing of the principle uses balls and boxes and is that if <math>n</math> balls are to be placed in <math>k</math> boxes and < An intuitive proof of the pigeonhole principle is as follows: suppose for contradiction that there exists a way to place <mat
    11 KB (1,985 words) - 21:03, 5 August 2023
  • ...+ 11x^2 + 3x + 31</math> is the square of an integer. Then <math>n</math> is: \textbf{(B) }\ 3 \qquad
    3 KB (571 words) - 00:42, 22 October 2021
  • ...while the geometric mean of the numbers <math>b</math> and <math>c</math> is the number <math>g</math> such that <math>g\cdot g = b\cdot c</math>. ...nd 2 is <math>\sqrt[4]{6\cdot 4\cdot 1 \cdot 2} = \sqrt[4]{48} = 2\sqrt[4]{3}</math>.
    2 KB (282 words) - 22:04, 11 July 2008
  • ...is counted once and only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. Here, we will illustrate how PIE is applied with various numbers of sets.
    9 KB (1,703 words) - 07:25, 24 March 2024
  • ...om a set of <math>n</math> where the order in which the objects are chosen is irrelevant. We are generally concerned with finding the number of combinat This video is a great introduction to permutations, combinations, and constructive counti
    4 KB (615 words) - 11:43, 21 May 2021
  • ...htarrow (a-1)(b-1)=2</math> from whence we have <math>(a,b,c)\in\{(2,3,1),(3,2,1)\}</math>. ...c|a+b</math>; hence <math>a+b</math> is a multiple of <math>c</math> which is no more than <math>2c+6</math>. It follows that <math>a+b\in\{c,2c,3c,4c,5c
    2 KB (332 words) - 09:37, 30 December 2021
  • ...Bunyakovsky–Schwarz Inequality''' or informally as '''Cauchy-Schwarz''', is an [[inequality]] with many ubiquitous formulations in abstract algebra, ca ...tion for inequality problems in intermediate and olympiad competitions. It is particularly crucial in proof-based contests.
    13 KB (2,048 words) - 15:28, 22 February 2024
  • The '''factorial''' is an important function in [[combinatorics]] and [[analysis]], used to determ ...h>. Alternatively, a [[recursion|recursive definition]] for the factorial is <math>n!=n \cdot (n-1)!</math>.
    10 KB (809 words) - 16:40, 17 March 2024
  • ...negative, the equation has two [[nonreal]] roots; and if the discriminant is 0, the equation has a real [[double root]]. We know that the discriminant of a polynomial is the product of the squares of the differences of the polynomial roots <math
    4 KB (734 words) - 19:19, 10 October 2023
  • It is named after Menelaus of Alexandria. ...gle ABC</math>, where <math>P</math> is on <math>BC</math>, <math>Q</math> is on the extension of <math>AC</math>, and <math>R</math> on the intersection
    5 KB (804 words) - 03:01, 12 June 2023
  • This is a list of historical results from the [[American Regions Mathematics League ...ards. One indvididual [need name] from Taiwan would have placed in the top 3 students overall on the individual round tiebreaker but was not considered
    19 KB (2,632 words) - 14:31, 12 June 2022
  • ...if they have a hard time following the rest of this article). This theorem is credited to [[Pierre de Fermat]]. ...n [[integer]], <math>{p}</math> is a [[prime number]] and <math>{a}</math> is not [[divisibility|divisible]] by <math>{p}</math>, then <math>a^{p-1}\equi
    16 KB (2,675 words) - 10:57, 7 March 2024
  • A '''parabola''' is a type of [[conic section]]. A parabola is a [[locus]] of points that are equidistant from a point (the [[focus]]) and ...: <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
  • '''Euler's Totient Theorem''' is a theorem closely related to his [[totient function]]. ...me to <math>n</math>. If <math>{a}</math> is an integer and <math>m</math> is a positive integer [[relatively prime]] to <math>a</math>, then <math>{a}^{
    3 KB (542 words) - 17:45, 21 March 2023
  • A '''geometric inequality''' is an [[inequality]] involving various measures ([[angle]]s, [[length]]s, [[ar ...e]] triangle is greater than the length of the third side. This inequality is particularly useful and shows up frequently on Intermediate level geometry
    7 KB (1,296 words) - 14:22, 22 October 2023
  • '''Brahmagupta's Formula''' is a [[formula]] for determining the [[area]] of a [[cyclic quadrilateral]] gi ...formula which Brahmagupta derived for the area of a general quadrilateral is
    3 KB (465 words) - 18:31, 3 July 2023
  • ...tween the side lengths and the diagonals of a [[cyclic quadrilateral]]; it is the [[equality condition | equality case]] of [[Ptolemy's Inequality]]. Pto ...\angle ABC+m\angle ADC=180^\circ .</math> However, <math>\angle ADP</math> is also supplementary to <math>\angle ADC,</math> so <math>\angle ADP=\angle A
    7 KB (1,198 words) - 20:39, 9 March 2024
  • An '''elementary symmetric sum''' is a type of [[summation]]. ...leq n</math>). 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
  • ...ory from the perspective of [[abstract algebra]]. In particular, heavy use is made of [[ring theory]] and [[Galois theory]]. Algebraic methods are partic ...erties of prime numbers. The most famous problem in analytic number theory is the [[Riemann Hypothesis]].
    5 KB (849 words) - 16:14, 18 May 2021

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