Create the page "Power mean" on this wiki! See also the search results found.

Page title matches

• Power's of 2 in pascal's triangle
  2 KB (341 words) - 16:57, 16 June 2019
• Power
  ...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
• Talk:Power Mean Inequality
  #REDIRECT [[Talk:Power mean inequality]]
  40 bytes (5 words) - 17:11, 15 December 2007
• Power mean inequality
  #REDIRECT [[Power Mean Inequality]]
  35 bytes (4 words) - 21:24, 20 December 2007
• Talk:Reader's Digest National Word Power Challenge
  ...'m the only WP vet here, and I should've mentioned it beforehand, but Word Power isn't happening this year. :( --[[User:Solafidefarms|solafidefarms]] 21:44, .../>[[Gravity]]|curweek=[[Isomorphism]]<br />[[Reader's Digest National Word Power Challenge]]|nextweek=[[Pascal's Theorem]]<br />[[Michigan Mathematics Prize
  414 bytes (54 words) - 20:21, 28 March 2008
• Talk:Power of a Point Theorem
  55 bytes (8 words) - 19:58, 12 June 2008
• Besot Power Series
  Besot's Power Series Theorem states that
  725 bytes (145 words) - 15:51, 17 February 2016

• File:Power (1).png (512 × 512 (24 KB)) - 09:10, 26 July 2018

• Power of a Point
  #REDIRECT [[Power of a Point Theorem]]
  38 bytes (6 words) - 16:53, 15 April 2019
• Root-mean power
  ...Geometric Mean: 0 (theoretical, can't be solved using radicals), Harmonic Mean: -1
  539 bytes (92 words) - 01:01, 2 November 2023
• 2023 Power
  * [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
• 2022 Power
  * [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
• 2021 Power
  * [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
• 2020 Power
  * [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
• 2019 Power
  * [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
• 2018 Power
  * [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
• 2014 Power
  * [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
• 2013 Power
  * [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
• 2012 Power
  * [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
• 2011 Power
  * [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

Page text matches

• Prime number
  ...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
• User:Solafidefarms
  ...7th grade. I happened, for no reason at all :D, to go to the National Word Power Challenge. It so happened that I came in 4th. (Out of the 3 million partici 8th grade (2005) I went back to Word Power and came in 2nd, winning a <nowiki>$</nowiki>15,000 scholarship. This time
  4 KB (723 words) - 18:26, 8 October 2019
• Circle
  *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
• Talk:Base numbers
  Hmmm... What do you mean by '''base doesn't need to be an integer'''? Especially suspicious is the i ...1</math>, <math>i</math>, <math>-1</math>, and <math>-i</math>). Maybe you mean something here but, since even I cannot understand you, there is no hope th
  5 KB (903 words) - 11:26, 8 January 2012
• Divisor
  ...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
• Base numbers
  ...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
• National Online Math League
  ...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
• Least common multiple
  ...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
• Pi
  ...> 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
• Logarithm
  ...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
• Utah ARML
  ...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
• Vocabulary and spelling competitions
  * [[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
• Talk:Vocabulary and spelling competitions
  ...u know, that is the proper capitalization of Reader's Digest National Word Power Challenge, the Scripps Howard National Spelling Bee, and the National Senio Sooooo..... you mean copy the content of V&SC to Academic Comps? I already have this page linked
  1 KB (165 words) - 17:49, 22 June 2006
• User talk:Solafidefarms
  Why don't you go ahead and write an article on the Word Power Challenge?--[[User:MCrawford|MCrawford]] 17:29, 26 June 2006 (EDT) when are you going to make that word power prep website?--[[User:Anirudh|Anirudh]] 08:17, 1 January 2007 (EST)
  5 KB (722 words) - 14:29, 26 October 2007
• Vocabulary competitions
  * [[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
• Mathew Crawford
  * Headed up the grading of the Power Round for the Georgia ARML site (2010)
  2 KB (360 words) - 02:20, 2 December 2010
• User talk:Joml88
  Yeah, Joe rules. FYI, Joe, you accidentally named the [[Power of a Point Theorem]] introductory problems using different standards.--[[Us
  2 KB (320 words) - 21:11, 24 February 2007
• Fermat's Last Theorem
  ...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
• Diophantine equation
  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
• Pascal's triangle
  ...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

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