Search results

Jump to navigation Jump to search
  • {{r|Combinatorics}}
    2 KB (262 words) - 19:07, 11 January 2010
  • In [[combinatorics]], the '''Stirling numbers''' count certain arrangements of objects into a
    2 KB (240 words) - 13:34, 7 February 2009
  • ...the following mathematical disciplines: [[algebra]], [[number theory]], [[combinatorics]] and [[geometry]]. On each day, the problems are in increasing order of di ...rtlist'' with 6-10 problems each from algebra, number theory, geometry and combinatorics.
    7 KB (1,063 words) - 10:07, 28 February 2024
  • ...hor=Victor Bryant | coauthors=Hazel Perfect | title=Independence Theory in Combinatorics | publisher=Chapman and Hall | year=1980 | isbn=0-412-22430-5 }}
    2 KB (334 words) - 16:29, 7 February 2009
  • ...hor=Victor Bryant | coauthors=Hazel Perfect | title=Independence Theory in Combinatorics | publisher=Chapman and Hall | year=1980 | isbn=0-412-22430-5 }}
    2 KB (307 words) - 16:08, 7 February 2009
  • ...Chuan-Chong | coauthors=Koh Khee-Meng | title=Principles and Techniques of Combinatorics | publisher=[[World Scientific]] | year=1992 | isbn=981-02-1139-2 }}
    2 KB (336 words) - 07:17, 16 January 2009
  • The '''binomial coefficient''' is a part of [[combinatorics]]. The binomial coefficient represent the number of possible choices of ''k
    3 KB (438 words) - 15:03, 30 November 2009
  • ...r|author2-link=Peter Winkler | title=Three Thresholds for a Liar | journal=Combinatorics, Probability and Computing | year=1992 | volume=1 | pages=81–93 ([http://
    5 KB (793 words) - 05:49, 8 April 2024
  • It is sometimes said that probabilistic combinatorics uses the fact that whatever happens with probability greater than <math>0</ ====Arithmetic combinatorics====
    27 KB (4,383 words) - 08:05, 11 October 2011
  • In [[combinatorics]], the partial sums of the geometric series are essential for
    7 KB (1,134 words) - 16:18, 22 January 2010
  • * Combinatorics
    6 KB (1,015 words) - 16:13, 6 May 2008
  • ...Consolas">....I have two superheroes....One of them is metaphor, the other combinatorics. Metaphor would be the way in which we transfer and transform ways of think
    6 KB (1,033 words) - 17:25, 6 February 2010
  • ...s, most research was done within its descendants, like probabilities and [[combinatorics]]. In [[combinatorics]], the Pascal's triangle is simply defined by <math>\scriptstyle \binom{n}{
    32 KB (4,192 words) - 18:42, 3 March 2024
  • ...d is not too large. The size of a number or string key determines, due to combinatorics, the number of keys to be tried, so larger-sized keys generally take longer
    11 KB (1,819 words) - 05:48, 8 April 2024
  • ...ing factorials, and the numerators, called the "tangent numbers", have a [[combinatorics|combinatorial]] interpretation: they enumerate [[alternating permutation]]s ...sponding factorials, the numerators, called the "secant numbers", have a [[combinatorics|combinatorial]] interpretation: they enumerate [[alternating permutation]]s
    33 KB (5,179 words) - 08:26, 4 June 2010
  • ...ducts immediately leads to applications in many areas of mathematics; in [[combinatorics]], and by extension in areas such as [[probability theory]] and the calcula
    32 KB (5,024 words) - 12:05, 22 December 2008
  • | [[Combinatorics]] || [[Theory of computation]] || [[Cryptography]] || [[Graph theory]]
    30 KB (4,289 words) - 16:03, 20 January 2023
  • Chess is interesting from the mathematical point of view. Many [[combinatorics|combinatorical]] and [[topology|topological]] problems connected with it we
    64 KB (10,049 words) - 07:31, 20 April 2024
View ( | ) (20 | 50 | 100 | 250 | 500)