Search results

  • ...https://artofproblemsolving.com/community/user/243060 cargeek9], currently a junior in high school. It covers the basics of algebra, geometry, combinato ...://www.amazon.com/exec/obidos/ASIN/0817636773/artofproblems-20 Algebra] by I.M. Gelfand and Alexander Shen.
    24 KB (3,177 words) - 12:53, 20 February 2024
  • ...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
  • The '''Power Mean Inequality''' is a generalized form of the multi-variable [[Arithmetic Mean-Geometric Mean]] I ...ath>, the power mean with exponent <math>t</math>, where <math>t\in\mathbb{R}</math>, is defined by
    3 KB (606 words) - 23:59, 1 July 2022
  • ...ts, the principle may be referred to as the '''Dirichlet box principle'''. A common phrasing of the principle uses balls and boxes and is that if <math> ...nhole principle is as follows: suppose for contradiction that there exists a way to place <math>n</math> balls into <math>k</math> boxes where <math>n>k
    11 KB (1,985 words) - 21:03, 5 August 2023
  • ...generally concerned with finding the number 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
  • ...ant <math>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- ...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
  • ...] (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
  • ...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
  • ...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
  • ...number is divisible by 2 if and only if its units digit is divisible by 2, i.e. if the number ends in 0, 2, 4, 6 or 8. 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
  • ...[convex function]] of one real variable. Let <math>x_1,\dots,x_n\in\mathbb R</math> and let <math>a_1,\dots, a_n\ge 0</math> satisfy <math>a_1+\dots+a_n If <math>{F}</math> is a concave function, we have:
    3 KB (623 words) - 13:10, 20 February 2024
  • ...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
  • ...ts from a group of <math>m+n</math> objects must have some <math>0\le k\le r</math> objects from group <math>m</math> and the remaining from group <math ...ing <math>k</math> men from the <math>m</math> total men and picking <math>r-k</math> women from the <math>n</math> total women. The left hand side and
    12 KB (1,993 words) - 23:49, 19 April 2024
  • 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
  • ...> such that <math>h(x) = f(g(x)) \forall x \in I</math>. If <math>x_0 \in I</math>, <math>g</math> is differentiable at <math>{x_0}</math>, and <math>{ ...<math>h'(x_0)</math>,<math>f'(g(x_0))</math>, and <math>g'(x_0)</math> is a matrix.)
    12 KB (2,377 words) - 11:48, 22 July 2009
  • ...>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
  • 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
  • ...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
  • ...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
  • ...ver, it is possible to define a number, <math> i </math>, such that <math> i = \sqrt{-1} </math>. If we add this new number to the reals, we will have ...s the set <math>\mathbb{R}</math> of the [[real number]]s, since <math>a = a + 0i</math>.
    5 KB (860 words) - 15:36, 10 December 2023

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