Search results

Page title matches

  • ...'' is a generalized form of the multi-variable [[Arithmetic Mean-Geometric Mean]] Inequality. ...ights <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\mathbb{R}</math>, is defined
    3 KB (606 words) - 23:59, 1 July 2022
  • The '''Power of a Point Theorem''' is a relationship that holds between the lengths of t ...ugh <math>P</math> that intersects the circle. This constant is called the power of point <math>P</math>. For example, in the figure below
    5 KB (827 words) - 17:30, 21 February 2024
  • The '''Reader's Digest National Word Power Challenge''' is the first nationwide vocabulary competition for middle scho ...dependencies thereof, who have not previously won a scholarship from Word Power, can participate.
    2 KB (293 words) - 21:13, 20 March 2008
  • Applying the [[Power of a Point Theorem]], we get <math> 3\cdot(3+5) = x (x+10) \rightarrow x^2 ''Back to the [[Power of a Point Theorem]].''
    448 bytes (67 words) - 15:15, 23 March 2020
  • Applying the Power of a Point Theorem gives <math> 6\cdot x = 4\cdot 1 </math>, so <math> x = ''Back to the [[Power of a Point Theorem]].''
    289 bytes (45 words) - 13:14, 16 July 2017
  • From the Power of a Point Theorem, we have that ''Back to the [[Power of a Point Theorem]].''
    969 bytes (154 words) - 14:40, 3 July 2006
  • ...3 </math> (or by just knowing your [[Pythagorean Triple]]s). Applying the Power of a Point Theorem gives <math> AE\cdot BE = CE\cdot DE </math>, or <math> ''Back to the [[Power of a Point Theorem]].''
    1 KB (177 words) - 02:14, 26 November 2020
  • #REDIRECT [[Power of a Point Theorem]]
    38 bytes (6 words) - 23:18, 30 June 2006
  • #REDIRECT [[Power of a Point Theorem/Introductory Problem 3]]
    61 bytes (8 words) - 12:07, 10 July 2006
  • #REDIRECT [[Power of a Point Theorem/Introductory Problem 4]]
    61 bytes (8 words) - 18:49, 10 July 2006
  • #REDIRECT [[Power of a Point Theorem/Introductory Problem 1]]
    61 bytes (8 words) - 09:19, 1 July 2006
  • #REDIRECT [[Power of a Point Theorem/Introductory Problem 2]]
    61 bytes (8 words) - 09:25, 1 July 2006
  • #REDIRECT [[Power of a Point Theorem/Introductory Problem 3]]
    61 bytes (8 words) - 09:27, 1 July 2006
  • #REDIRECT [[Power of a Point Theorem/Introductory Problem 4]]
    61 bytes (8 words) - 09:27, 1 July 2006
  • The '''power set''' of a given [[set]] <math>S</math> is the set <math>\mathcal{P}(S)</m Similarly, for any [[finite]] set with <math>n</math> elements, the power set has <math>2^n</math> elements.
    4 KB (757 words) - 11:44, 8 March 2018
  • ...math> is a perfect <math>2</math>nd, <math>3</math>rd and <math>6</math>th power. ...h>st power" is a meaningless property: every integer is a <math>1</math>st power of itself.
    870 bytes (148 words) - 16:52, 18 August 2013
  • 2 KB (341 words) - 16:57, 16 June 2019
  • ...oosely defined as the speed something can do [[work]]. The [[SI]] unit for power is the [[Watt]]. ...d of [[time]]. It is also the [[derivative]] of work. If <math>P</math> is power, <math>W</math> is work, and <math>t</math> is time, then:
    467 bytes (77 words) - 23:26, 2 March 2008
  • #REDIRECT [[Power Mean Inequality]]
    35 bytes (4 words) - 21:24, 20 December 2007
  • Besot's Power Series Theorem states that
    725 bytes (145 words) - 15:51, 17 February 2016
  • #REDIRECT [[Power of a Point Theorem]]
    38 bytes (6 words) - 16:53, 15 April 2019
  • ...Geometric Mean: 0 (theoretical, can't be solved using radicals), Harmonic Mean: -1
    539 bytes (92 words) - 01:01, 2 November 2023
  • * [https://www.stanfordmathtournament.com/pdfs/smt2023/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2023/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 21:17, 20 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2022/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2022/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 21:30, 20 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2021/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2021/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 21:39, 20 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2020/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2020/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:28, 22 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2019/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2019/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:34, 22 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2018/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2018/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:20, 29 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2014/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2014/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:25, 29 January 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2013/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2013/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:20, 5 February 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2012/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2012/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:25, 5 February 2024
  • * [https://www.stanfordmathtournament.com/pdfs/smt2011/power-problems.pdf/ Problems] * [https://www.stanfordmathtournament.com/pdfs/smt2011/power-solutions.pdf/ Solutions]
    171 bytes (18 words) - 22:29, 5 February 2024
  • 6 KB (1,010 words) - 02:38, 7 May 2024

Page text matches

  • ...> and <math>AX = AB + BC </math>. By considering the [[Power of a Point | power of point]] <math>A </math> with respect to <math>\omega </math>, we see
    5 KB (886 words) - 21:12, 22 January 2024
  • ...the study of movement. [[Kinematics]], mechanical [[force]]s, [[work]], [[power]], [[energy]], and [[matter]] are all part of mechanics. ...defined as <math>P =\int^{v_f}_{v_i} F\,dv</math> where <math>P</math> is power delivered and <math>v</math> is velocity. [[Energy]] is the other basic int
    9 KB (1,355 words) - 07:29, 29 September 2021
  • * [[Arithmetic Mean-Geometric Mean | Arithmetic Mean-Geometric Mean Inequality]] * [[Power mean inequality]]
    12 KB (1,798 words) - 16:20, 14 March 2023
  • is a power of 2. (<i>A power of 2 is an integer of the form <math>2^n</math> where <math>n</math> is a n
    4 KB (692 words) - 22:33, 15 February 2021
  • *A power round, where the questions are proof-oriented and are in a theme
    2 KB (267 words) - 17:06, 7 March 2020
  • ...ractices which are usually composed of individual tests, team tests, and a power round test. ...n Individual Exam, Individual Short Answer Section, Team Questions, a Team Power Question, and 2 sets of relays of 5 each (there are 10 members in each team
    21 KB (3,500 words) - 18:41, 23 April 2024
  • ...ustification (referring to previous parts is allowed). Groups turn in the Power Round solutions the day of the event.
    2 KB (295 words) - 23:19, 5 January 2019
  • ...'' is a generalized form of the multi-variable [[Arithmetic Mean-Geometric Mean]] Inequality. ...ights <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\mathbb{R}</math>, is defined
    3 KB (606 words) - 23:59, 1 July 2022
  • ...mation that one can have about a polynomial of one variable is the highest power of the variable which appears in the polynomial. This number is known as t
    6 KB (1,100 words) - 01:44, 17 January 2024
  • ...n</math>, and not divisible by any prime <math>p>n</math>. But what is the power of a prime <math>p\le n</math> ...r of <math>p</math>. Those divisible by <math>p^3</math> give yet another power of <math>p</math>. Continuing in this manner gives
    10 KB (809 words) - 16:40, 17 March 2024
  • ** Power: 33 ** Power: 17
    2 KB (378 words) - 16:34, 5 January 2010
  • .../math> as a product of cyclic groups of prime order where the set of prime power orders is unique. We can do this because if any two prime powers are not c
    16 KB (2,658 words) - 16:02, 8 May 2024
  • ...d of mean (like [[arithmetic mean]] and [[geometric mean]]). The harmonic mean of a [[set]] of <math>n</math> [[positive]] [[real number]]s <math> x_1, x_ ...to avoid division by zero. For instance, if we tried to take the harmonic mean of the set <math>\{-2, 3, 6\}</math> we would be trying to calculate <math>
    1 KB (196 words) - 00:49, 6 January 2021
  • ...e to be [[positive]] or negative, unlike the [[Power mean inequality|power-mean]] family of inequalities. *[[Power Mean Inequality]]
    5 KB (804 words) - 13:54, 26 January 2023
  • .../math> if and only if the last <math>n</math> digits are divisible by that power of 5. ...zeros that should be at the end of a number for it to be divisible by that power of 10.
    8 KB (1,315 words) - 18:18, 2 March 2024
  • ...s an emphasis on proof. Induction problems can be found anywhere from the Power Round of the [[American Regions Math League | ARML]] up through the [[Unite ...number of odd binomial coefficients in any row of the Pascal triangle is a power of 2. (1956 Putnam Competition)
    5 KB (768 words) - 20:45, 1 September 2022
  • ...t examples of Jensen's inequality is the [[quadratic mean]] - [[arithmetic mean]] inequality. Taking <math>F(x)=x^2</math>, which is convex (because <math> Similarly, [[arithmetic mean]]-[[geometric mean]] inequality ([[AM-GM]]) can be obtained from Jensen's inequality by consid
    3 KB (623 words) - 13:10, 20 February 2024
  • ...ath>, give the terms of a [[sequence]] which is of interest. Therefore the power series (i.e. the generating function) is <math>c_0 + c_1 x + c_2 x^2 + \cdo ...the result is uninteresting (both the generating function and the desired power series are just <math>1</math>).
    4 KB (659 words) - 12:54, 7 March 2022
  • Since <math>e^{a+b} = e^ae^b</math>, and power series for the same function are termwise equal, the series at <math>x = a
    5 KB (935 words) - 13:11, 20 February 2024
  • ...prime, ''n'' must not have any odd divisor larger than 1 and so must be a power of 2. Therefore all Fermat primes have the form <math>2^{2^n}+1</math>. [[
    6 KB (985 words) - 12:38, 25 February 2024
  • *Lengths of chords can be calculated by using the [[Power of a point]] theorem. * [[Power of a point]]
    9 KB (1,581 words) - 18:59, 9 May 2024
  • ...s often useful to know that this expression grows slower than any positive power of <math>{n}</math> as <math>n\to\infty</math>.
    1 KB (274 words) - 19:50, 29 August 2023
  • ...r 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 place (recall
    4 KB (547 words) - 17:23, 30 December 2020
  • ...ilar to that used by the [[American Regions Math League]]: a Team test, a Power question, and several Relays. However, one match used an experimental form
    3 KB (452 words) - 11:21, 25 June 2006
  • ...me number]] which divides any of them, take the largest [[exponentiation | power]] with which it appears, and multiply the results together. For example, t ...; the largest power of 3 that appears is <math>3^1</math>; and the largest power of 5 that appears is <math>5^1</math>. Therefore the LCM, <math>LCM(8, 12,
    2 KB (383 words) - 10:49, 4 September 2022
  • ...> is Liouvillian, then so is any rational multiple of any positive integer power of <math>x</math> (this is a simple exercise we leave to the reader), so, i Since the largest possible power of a given [[prime number|prime]] <math>p\le n</math> that can divide one o
    8 KB (1,469 words) - 21:11, 16 September 2022
  • ...ogs also allow (with repetition) to turn left to right exponentiation into power towers (especially useful for tetration (exponentiation repetition with the ...to the usual logarithm by the fact that if <math>b</math> isn't an integer power of <math>a</math> then <math>\lceil \log_a(m)\rceil</math> is a lower bound
    4 KB (680 words) - 12:54, 16 October 2023
  • ...d in the B division, but was mislisted in the A division. However, on the Power Question, the Utah team got the 9th best score in the nation, which would h
    565 bytes (88 words) - 12:29, 11 December 2007
  • * [[Reader's Digest National Word Power Challenge | Word Power Challenge]] The premier vocabulary competition, for 6-8th grades. Over 3 mi
    786 bytes (99 words) - 17:53, 22 June 2006
  • * [[Reader's Digest National Word Power Challenge | Word Power Challenge]] The premier vocabulary competition, for 6-8th grades. Over 3 mi
    392 bytes (50 words) - 02:36, 29 November 2018
  • * Headed up the grading of the Power Round for the Georgia ARML site (2010)
    2 KB (360 words) - 02:20, 2 December 2010
  • ...to be the sum of two fourth powers, or in general for any number that is a power greater than the second to be the sum of two like powers. ''I have discover
    3 KB (453 words) - 11:13, 9 June 2023
  • Note that every square, and therefore every fourth power, is either <math>1</math> or <math>0\mod 4</math>. The proof of this is fai
    9 KB (1,434 words) - 13:10, 20 February 2024
  • ...s Theorem, which states that given a prime p and integers m,n, the highest power of p dividing <math>\binom{m}{n}</math> is the number of carries in adding
    5 KB (838 words) - 17:20, 3 January 2023
  • ...cient 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|identiti
    4 KB (690 words) - 13:11, 20 February 2024
  • ...ten in the form <math>a^b</math>, where <math>b</math> is the exponent (or power) and <math>a</math> is the [[base]]. ...times. The base is 3 (what is repeatedly multiplied) and the exponent (or power) is 5 (the number of times to repeat multiplication).
    5 KB (803 words) - 16:25, 10 August 2020
  • ...root-mean power]], [[arithmetic mean]], [[geometric mean]], and [[harmonic mean]] of a set of [[positive]] [[real number]]s <math>x_1,\ldots,x_n</math> th ...,~~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
  • The '''Power of a Point Theorem''' is a relationship that holds between the lengths of t ...ugh <math>P</math> that intersects the circle. This constant is called the power of point <math>P</math>. For example, in the figure below
    5 KB (827 words) - 17:30, 21 February 2024
  • ...><br>Cacti is a complete network graphing solution designed to harness the power of RRDTool's data storage and graphing functionality. Cacti provides a fast
    2 KB (329 words) - 17:25, 8 June 2008
  • ..., that <math>x</math> is not a [[Liouvillian number]], i.e., that for some power <math>M<+\infty</math>, the [[inequality]] <math>\left|x-\frac pq\right|\ge Since the largest possible power of a given prime <math>p\le n</math> that can divide one of the numbers <ma
    8 KB (1,431 words) - 13:48, 26 January 2008
  • The '''Reader's Digest National Word Power Challenge''' is the first nationwide vocabulary competition for middle scho ...dependencies thereof, who have not previously won a scholarship from Word Power, can participate.
    2 KB (293 words) - 21:13, 20 March 2008
  • Note that the power with which a prime <math>p</math> satisfying <math>\frac{2n}3<p\le n</math>
    2 KB (309 words) - 21:43, 11 January 2010
  • * [[Perfect power]]
    954 bytes (155 words) - 01:14, 29 November 2023
  • ...th>|S|<|\mathcal{P}(S)|</math>, where <math>\mathcal{P}(S)</math> is the [[power set]] of <math>S</math>. First, we note that the [[Cantor set]] <math>\math
    2 KB (403 words) - 20:53, 13 October 2019
  • The set of all subsets of a given set <math>S</math> is called the [[power set]] of <math>S</math> and is denoted <math>\mathcal{P}(S)</math> or <math
    1 KB (217 words) - 09:32, 13 August 2011
  • ...tive integer <math> x, </math> let <math> g(x) </math> denote the greatest power of 2 that divides <math> x. </math> For example, <math> g(20)=4 </math> and
    7 KB (1,173 words) - 03:31, 4 January 2023
  • ...ve integer]] <math> x </math>, let <math> g(x) </math> denote the greatest power of 2 that [[divisor | divides]] <math> x. </math> For example, <math> g(20) ...ath> that divides <math>n+1</math>. Thus by the above formula, the highest power of <math>2</math> that divides <math>S_n</math> is <math>2^{k+n-1}</math>.
    10 KB (1,702 words) - 00:45, 16 November 2023
  • The product of <math>a^2</math> and <math>r^{11}</math> is a power of 2. Since both numbers have to be integers, this means that <math>a</mat ...ly not possible. Thus the only restriction r has is that it must be an odd power of 2, so <math>2^{1}</math>, <math>2^{3}</math>, <math>2^{5}</math> .... al
    4 KB (651 words) - 18:27, 22 May 2021
  • A number in decimal notation ends in a zero for each power of ten which divides it. Thus, we need to count both the number of 5s and ...h> - every <math>n!</math> term for <math>n\geq25</math> has an additional power of <math>5</math> dividing it, for <math>76</math> extra; every n! for <mat
    2 KB (278 words) - 08:33, 4 November 2022
  • ...eq 0</math> is the lowest value such that <math>4x</math> becomes a higher power of 10.
    3 KB (485 words) - 14:09, 21 May 2021

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