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

• 2016 AMC 10A Problems/Problem 10
  size(6cm);
  2 KB (337 words) - 14:56, 25 June 2023
• 2016 AMC 10A Problems/Problem 11
  size(6cm); size(6cm);
  8 KB (1,016 words) - 00:17, 31 December 2023
• MATHCOUNTS
  ...w states don't need to host chapter competitions due to a small population size.
  10 KB (1,497 words) - 11:42, 10 March 2024
• California MathCounts
  Due to the size and population of the state of [[California]], '''California MathCounts'''
  644 bytes (87 words) - 02:05, 25 March 2015
• Pigeonhole Principle
  Consider the <math>n</math> intervals from <math>[0, 1)</math> of size <math>\frac{1}{n}</math>. We have <math>n+1</math> total <math>b_0, b_1, \l
  11 KB (1,985 words) - 21:03, 5 August 2023
• Geometric mean
  size(150);
  2 KB (282 words) - 22:04, 11 July 2008
• Principle of Inclusion-Exclusion
  ...the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible [[intersection]]s among the sets. ...ze of their intersection, <math>|A_1\cap A_2|</math>. We wish to find the size of their union, <math>|A_1\cup A_2|</math>.
  9 KB (1,703 words) - 07:25, 24 March 2024
• Combination
  ...the number of combinations of size <math>r</math> from an original set of size <math>n</math>
  4 KB (615 words) - 11:43, 21 May 2021
• Fermat's Little Theorem
  ...al proof, this splits the non-main diagonal unit hypercubes into groups of size <math>p</math>, from which it follows that <math>a^p \equiv a \pmod{p}</mat ...a single orbit which we can denote as <math>\mathcal{O}</math> (since the size of the orbit is a factor of <math>p</math>). Hence, if <math>g\ne e</math>
  16 KB (2,675 words) - 10:57, 7 March 2024
• Parabola
  size(300); size(300);
  3 KB (551 words) - 16:22, 13 September 2023
• Geometric inequality
  size(400);
  7 KB (1,296 words) - 14:22, 22 October 2023
• Geometric probability
  ...l outcomes and the number of total outcomes. Instead, we have to find the size of each set. This is where we turn to '''geometric probability'''. We can
  1 KB (175 words) - 23:50, 18 November 2023
• Binomial Theorem
  ...math> is the number of ways to choose <math>m</math> objects from a set of size <math>n</math>, or <math>\binom{n}{m}</math>. Extending this to all possib
  5 KB (935 words) - 13:11, 20 February 2024
• Correspondence
  ...ly used in [[combinatorics]] in order to count the elements of a set whose size is unknown. Bijections are also very important in [[set theory]] when deal
  2 KB (289 words) - 17:17, 13 February 2009
• Bijection
  ...ly used in [[combinatorics]] in order to count the elements of a set whose size is unknown. Bijections are also very important in [[set theory]] when deal
  1,016 bytes (141 words) - 03:39, 29 November 2021
• Combinatorial identity
  We can form a committee of size <math>k+1</math> from a group of <math>n+1</math> people in <math>{{n+1}\ch
  12 KB (1,993 words) - 23:49, 19 April 2024
• Integer
  ...gned <math>32</math>-bit integers). Integers in Python can be of arbitrary size, theoretically limited only by computer memory.
  2 KB (296 words) - 15:04, 5 August 2022
• Ellipse
  size(200); size(200);
  5 KB (892 words) - 21:52, 1 May 2021
• Cardinality
  ...ts, the cardinality of is the number of [[element]]s in that set, i.e. the size of the set. The cardinality of <math>\{3, 4\}</math> is 2, the cardinality For [[infinite]] sets, cardinality also measures (in some sense) the "size" of the set, but an explicit formulation is more complicated: the cardinali
  2 KB (263 words) - 00:54, 17 November 2019
• Vector
  size(150);
  7 KB (1,265 words) - 13:22, 14 July 2021

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