Search results

Jump to navigation Jump to search
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Normal [[hotel]]s have a set number of rooms. This number is [[finite]]. Once every room has been assigned to a guest, any new guest ...s already full, something that could not happen in any hotel with a finite number of rooms. ...
    5 KB (910 words) - 20:39, 8 September 2016
  • ...ne by the Babylonians; Ancient Greeks, like [[Ptolemy]] later extended the theory. The third number is the height, altitude, or depth. This is given with respect to some fixed ...
    2 KB (271 words) - 22:25, 4 November 2016
  • A '''square number''', sometimes also called a '''perfect square''', is the result of an [[int ...exponentiation]]), usually pronounced as "''n'' squared". The name square number comes from the name of the shape; see [[#Properties|below]]. ...
    7 KB (1,032 words) - 07:35, 22 June 2017
  • ...ord.</ref><sup>p160</sup> It is a central idea in [[evolution|evolutionary theory]]. Fitness is usually equal to the proportion of the individual's [[gene]]s ...or to help relatives with similar genes to reproduce, ''as long as similar number of copies of individual's genes get passed on to the next generation''. Sel ...
    5 KB (696 words) - 14:26, 23 June 2016
  • ...ers rolls a (fair) 6-sided die. For any pair of players who throw the same number, the group scores <math>1</math> point. Find the mean and variance of the t == Problem 3 (Probability meets graph theory) == ...
    6 KB (968 words) - 13:18, 5 May 2024
  • ...on]] within a hydrogen atom can only be [[integer]] multiples of a certain number. ...ful because it explains the cause of [[light]]. Bohr agreed with classical theory that light has a wave-particle duality (meaning that it is made of both [[e ...
    2 KB (275 words) - 19:55, 3 September 2016
  • The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one ...\mathbb{R}</math> is a function that maps each event to a nonnegative real number, satisfying ...
    16 KB (2,701 words) - 02:51, 18 August 2011
  • :''This article is about the basic notions. For advanced topics, see [[Group theory]].'' The number of elements in a group is called the group's ''order''. ...
    6 KB (1,063 words) - 03:41, 3 March 2017
  • ...the positive [[divisor]]s of the number (except itself), the result is the number itself. 6 is the first perfect number. Its divisors (other than the number itself: 6) are 1, 2, and 3 and 1 + 2 + 3 equals 6. Other perfect numbers in ...
    12 KB (1,697 words) - 23:40, 1 August 2016
  • ...ow that a [[mathematics|math]] [[theorem]] is true. One must show that the theory is true in all cases. ...lways true, precisely because it's true for whatever comes after any given number. ...
    4 KB (758 words) - 05:51, 9 March 2015
  • Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</ ...
    18 KB (3,527 words) - 09:38, 14 May 2024
  • Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</ ...
    18 KB (3,527 words) - 05:10, 9 November 2016
  • Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</ ...
    18 KB (3,527 words) - 08:55, 4 May 2023
  • Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</ ...
    18 KB (3,527 words) - 05:55, 12 November 2019
  • Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</ ...
    18 KB (3,527 words) - 06:10, 22 November 2017
  • == Extremal Graph Theory == Extremal grap theory studies the problems like "how many edges that a graph <math>G</math> can ...
    21 KB (3,921 words) - 08:23, 13 November 2010
  • ...th> players rolls a (fair) die. For any pair of players who throw the same number, the group scores <math>1</math> point. Find the mean and variance of the t == Problem 3 (Probability meets graph theory) == ...
    7 KB (1,107 words) - 07:46, 25 April 2023
  • Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</ ...
    19 KB (3,541 words) - 07:47, 25 December 2015
  • The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one ...\mathbb{R}</math> is a function that maps each event to a nonnegative real number, satisfying ...
    15 KB (2,672 words) - 09:10, 22 September 2016
  • <li>[<strong>Random number of random variables</strong>] Let <math>\{X_n\}_{n \ge 1}</math> be identic ...rom the <strong>second</strong> round of tosses, and <math>Y</math> be the number of heads resulting from <strong>all</strong> tosses, which includes the fir ...
    14 KB (2,403 words) - 10:41, 7 April 2023
View ( | ) (20 | 50 | 100 | 250 | 500)