Search results
Jump to navigation
Jump to search
- :''For the book in the Bible, see [[Numbers (Bible)]]''. ...] or [[measurement|measure]]. Depending on the field of mathematics, where numbers are used, there are different definitions: ...14 KB (2,057 words) - 01:36, 21 August 2017
- | [[square root]] | square root ...8 KB (1,182 words) - 07:31, 3 November 2013
- It is a [[computation]] process that uses random numbers to produce an outcome(s). Instead of having fixed inputs, [[probability dis ...thematics)|π]]. A Monte Carlo algorithm would randomly place points in the square and use the percentage of points falling inside of the circle to estimate t ...2 KB (307 words) - 14:25, 25 June 2017
- ...is the name given by [[mathematics|mathematicians]] to a series of special numbers: 2, 1729 etc. A taxicab number is the smallest number that can be expresse ...y itself the answer is called a “square”, e.g. 3x3=9, so the number 9 is a square. ...3 KB (459 words) - 13:46, 26 April 2013
- ...</math>.<ref>Wells, D. ''The Penguin Dictionary of Curious and Interesting Numbers'' London: Penguin Group. (1987): 41–44</ref> An [[integer]] is ''[[even]]'' ...e]]. Two and three are the only prime numbers next to each other. The even numbers above two are not prime because they are divisible by 2. ...3 KB (374 words) - 20:08, 29 November 2016
- .... The difference is called <math>d</math>, and the number you get when you square <math>d</math> is called <math>d^2</math>.<ref name=CGP-book/> <math>\sum d^2</math> means that we take the total of all the numbers that were in the column <math>d^2</math>. This is because <math>\sum</math> ...5 KB (920 words) - 12:36, 6 January 2017
- ...h>, then the time taken to produce the output would take a time that would square in magnitude with change in size of the input - for e.g. if someone gave an ...not talking about how the time changes when we're given a set of 10 or 20 numbers (in fact the big O, due to its mathematical definition, may even give wrong ...4 KB (700 words) - 14:03, 20 September 2015
- ...re very close to the [[average]]. A high standard deviation means that the numbers are spread out.<ref>{{cite journal ...context. [[science|Scientists]] commonly report the standard deviation of numbers from the average number in experiments. They often decide that only differe ...12 KB (1,881 words) - 09:42, 29 May 2017
- ...With sample standard deviation|sample standard deviation]]) divided by the square root of the sample size. ...t time period when the whole group covers a longer time. In this case, the numbers in the sample are not independent. Then special equations are used to try t ...9 KB (1,463 words) - 03:47, 2 July 2016
- ...point out the dot that is sometimes used to separate the positions of the numbers in this [[system]]. Almost everyone uses this nowadays and prefers the conv ...han ten distinct values (0, 1, 2, 3, 4, 5, 6, 7, 8 and 9) to represent any numbers, no matter how large. These digits are often used with a [[decimal separato ...7 KB (903 words) - 08:27, 1 October 2016
- However, the value of K<sub>c</sub> will depend on the ionic strength. (The square brackets mean the concentration of A, B and so on.) ...ame place to react in the opposite direction. The ratio between those two numbers represents how popular each side of the reaction will be when equilibrium i ...2 KB (386 words) - 03:46, 18 October 2014
- ...he number itself: 6) are 1, 2, and 3 and 1 + 2 + 3 equals 6. Other perfect numbers include 28, 496 and 8128. ==Perfect numbers that are even== ...12 KB (1,697 words) - 23:40, 1 August 2016
- ...ites, called [http://en.wikipedia.org/wiki/Carmichael_number '''Carmichael numbers'''], that may fool the Fermat test. The Carmichael numbers are very rare. Let <math>c(n)</math> be the "Carmichael density" that ...21 KB (3,794 words) - 09:47, 10 September 2015
- ...to solve real problems because the rules of algebra work in real life and numbers can be used to represent the values of real things. [[Physics]], [[enginee ...ns involve [[exponent]]s, starting with [[square (algebra)|squares]] and [[square root]]s. Interestingly, many of these rules can also be used on the variabl ...13 KB (2,204 words) - 07:13, 30 July 2017
- ...utation <math>\pi</math> of <math>n</math> numbers, we want to reorder the numbers in <math>\pi</math> in increasing order. This is the problem of sorting, on ...l numbers in <math>\pi'</math> are smaller than <math>\pi_i</math> and all numbers in <math>\pi''</math> are larger than <math>\pi_i</math>; ...29 KB (4,994 words) - 01:21, 29 August 2011
- Adding the numbers on the left, subtracting <math>216.75</math> from both sides, and dividing Taking the square root of both sides gives us an answer of <math>v = \pm1.5</math>. ...4 KB (633 words) - 05:47, 14 February 2016
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...20 KB (3,444 words) - 04:53, 7 October 2010
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,298 words) - 06:51, 26 February 2014
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,298 words) - 05:54, 20 March 2013
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,338 words) - 09:04, 12 September 2017
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,338 words) - 13:15, 6 September 2019
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,338 words) - 12:04, 14 September 2015
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,338 words) - 12:57, 11 September 2016
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...24 KB (4,348 words) - 11:46, 6 March 2013
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...25 KB (4,460 words) - 11:41, 6 March 2024
- ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...25 KB (4,460 words) - 17:41, 23 March 2023
- ...n|exponential functions]], and are useful in multiplying or dividing large numbers. * If you have x²=3, then you use the (square) [[Root (mathematics)|root]] to find out x: You get the result x = <math di ...13 KB (1,977 words) - 14:34, 21 July 2017
- ...q i\leq n</math>, be independent, uniformly distributed points in the unit square <math>[0,1]^2</math>. A point <math>P_i</math> is called "peripheral" if, f :'''Input:''' real numbers <math>U < 1</math>; ...13 KB (2,150 words) - 08:49, 7 June 2023
- * [[Division (mathematics)|divide]] their weight by the [[exponentiation|square]] of their height ...to help decide whether people are too fat or too thin. The WHO uses these numbers for adults:<ref>{{cite web|url = http://www.who.int/bmi/index.jsp?introPage ...7 KB (1,048 words) - 14:58, 12 May 2015
- ||[[Square root]] of 5, [[Gauss]] sum ||<small>The ratio of a square and circumscribed or inscribed circles</small> ...41 KB (4,624 words) - 01:45, 25 December 2015
- ...of a real-valued argument ''x''. (This means both the input and output are numbers.) ...r, we can restrict both its domain and codomain to the set of non-negative numbers (0,+∞) to get an (invertible) bijection (see examples below). ...11 KB (1,621 words) - 07:51, 17 July 2016
- * Step 1: Numbers can be [[Primality test#Probabilistic tests|probabilistically tested]] for Since <math>p\,</math> and <math>q\,</math> are distinct prime numbers, applying the [[Chinese remainder theorem]] to these two congruences yields ...14 KB (2,168 words) - 11:19, 5 August 2017
- ...or fixed-point arithmetic; when computing mathematical functions such as [[square root]]s, [[logarithm]]s, and [[sine]]s; or when using a [[floating point]] ...t occurs when [[physical quantity|physical quantities]] must be encoded by numbers or [[digital signal]]s. ...46 KB (7,060 words) - 01:36, 21 August 2017
- <math>\square</math> ...to introduce the concepts of the <math>k</math>-cascade representation of numbers and the colex order of sets. ...25 KB (4,480 words) - 04:58, 17 November 2010
- <math>\square</math> ...to introduce the concepts of the <math>k</math>-cascade representation of numbers and the colex order of sets. ...25 KB (4,480 words) - 08:23, 16 August 2011
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,924 words) - 04:31, 17 February 2014
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,924 words) - 10:39, 27 February 2024
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,924 words) - 05:21, 16 September 2019
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,924 words) - 06:09, 31 August 2015
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,924 words) - 11:03, 6 March 2013
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,924 words) - 13:22, 16 February 2023
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,926 words) - 13:07, 1 September 2011
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,926 words) - 09:09, 30 December 2016
- :For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...39 KB (6,926 words) - 07:43, 1 August 2017
- ...input a set <math>S</math> of <math>n</math> numbers, we want to sort the numbers in <math>S</math> in increasing order. One of the most famous algorithm for ...re all numbers in <math>S_1</math> are smaller than <math>x</math> and all numbers in <math>S_2</math> are larger than <math>x</math>; ...26 KB (4,811 words) - 10:33, 11 March 2013
- ...v</sub> || E 2C<sub>4</sub> C<sub>2</sub> 2σ<sub>v</sub> 2σ<sub>d</sub> || square pyramidal || [[xenon oxytetrafluoride]] ...ub>'' ''i'' 2S<sub>4</sub> σ<sub>h</sub> 2σ<sub>v</sub> 2σ<sub>d</sub> || square planar || [[xenon tetrafluoride]] ...19 KB (2,913 words) - 21:36, 4 November 2015
- If there exists a '''[[square matrix]]''' called '''''A''''', a '''[[scalar]] ''λ''''', and a '''non-zero ...cation. For example, instead of [[real numbers]], scalars may be [[complex numbers]]; instead of arrows, vectors may be [[function (mathematics)|functions]] ...13 KB (1,723 words) - 07:13, 11 November 2016
- Sampling <math>t</math> mutually independent random numbers from <math>[p]</math> can be quite expensive since it requires <math>\Omega The error is reduced to <math>1/t</math> with only two random numbers. This scheme works as long as <math>t\le p</math>. ...37 KB (6,743 words) - 09:07, 13 November 2011
- Sampling <math>t</math> mutually independent random numbers from <math>[p]</math> can be quite expensive since it requires <math>\Omega The error is reduced to <math>1/t</math> with only two random numbers. This scheme works as long as <math>t\le p</math>. ...39 KB (7,106 words) - 09:54, 24 May 2013
- ...ximation ratio of 2 to being 2-universal. The proof uses the fact that odd numbers are relative prime to a power of 2. We exploit that C-multiplication (*) of unsigned u-bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing th ...31 KB (5,704 words) - 08:39, 5 May 2014
- ...ximation ratio of 2 to being 2-universal. The proof uses the fact that odd numbers are relative prime to a power of 2. We exploit that C-multiplication (*) of unsigned u-bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing th ...31 KB (5,704 words) - 05:36, 13 November 2015
- Sampling <math>t</math> mutually independent random numbers from <math>[p]</math> can be quite expensive since it requires <math>\Omega The error is reduced to <math>1/t</math> with only two random numbers. This scheme works as long as <math>t\le p</math>. ...42 KB (7,662 words) - 08:41, 7 June 2010
- ...ted as a diagram of dots (or squares), called a '''Ferrers diagram''' (the square version of Ferrers diagram is also called a '''Young diagram''', named afte |align=center|Ferrers diagram (''square version'') of (5,4,2,1) ...29 KB (5,077 words) - 04:54, 7 October 2010
- <math>\square</math> ...to introduce the concepts of the <math>k</math>-cascade representation of numbers and the colex order of sets. ...50 KB (8,991 words) - 12:23, 21 May 2023
- ...re related. For a vector '''a''', the dot product '''a''' · '''a''' is the square of the length of '''a''', or Unlike multiplication of ordinary numbers, where if ''ab'' = ''ac'', then ''b'' always equals ''c'' unless ''a'' is z ...17 KB (2,689 words) - 00:42, 2 June 2016
- ...ximation ratio of 2 to being 2-universal. The proof uses the fact that odd numbers are relative prime to a power of 2. We exploit that C-multiplication (*) of unsigned u-bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing th ...38 KB (6,912 words) - 15:45, 3 October 2022
- ...multiply amplitude by amplitude (or in other words he had to [[wikt:square|square]] the amplitude) to get the intensity he wanted. He had to figure out how t ...no problem. But they were both complicated equations, and how you got the numbers to plug into the equations turned out to be different depending on which wa ...42 KB (7,065 words) - 02:42, 24 August 2017
- ...nd therefore frequency). So the formula that Planck worked out to make the numbers all come out right was: Putting in different numbers for '''m''' and '''n''', it is easy to predict frequencies for many types o ...36 KB (5,991 words) - 08:00, 24 August 2017
- ...ximation ratio of 2 to being 2-universal. The proof uses the fact that odd numbers are relative prime to a power of 2. We exploit that C-multiplication (*) of unsigned u-bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing th ...48 KB (8,716 words) - 08:15, 15 October 2023