Search results

Page title matches

  • A '''partially ordered set''' <math>P</math> is a pair, <math>(S, \leq)</math> of a [[set]] <math> The name "partially ordered set" is often abbreviated ''poset''.
    4 KB (717 words) - 19:01, 25 April 2009
  • ...in which we have <math>\{2, 3\} = \{3, 2\}</math>. In general, we say two ordered pairs, <math>(x, y)</math> and <math>(a, b)</math> are the same if and only ...notion of an ordered pair can be naturally extended to that of an [[tuple|ordered tuple]].
    2 KB (303 words) - 17:15, 29 August 2024
  • A '''totally ordered set''' is a [[partially ordered set]] in which every two [[element]]s are [[comparable]]. Thus, the standa
    1 KB (174 words) - 11:52, 25 November 2007
  • A ordered tuple is a tuple that is ordered.
    43 bytes (9 words) - 23:55, 12 May 2020
  • #REDIRECT [[Ordered pair]]
    26 bytes (3 words) - 06:10, 3 October 2023
  • ...he ordered tuple <math>(a, b, c, \dots )</math> can be though of as nested ordered pairs: <math>(a, (b, (c, (\dots))))</math>.
    138 bytes (24 words) - 17:12, 29 August 2024

Page text matches

  • ...competitions. However, they are generally difficult to find. Some can be ordered [http://www.arml2.com/arml_2018/page/index.php?page_type=public&page=books
    16 KB (2,192 words) - 22:06, 19 July 2024
  • ...of the area of the entire floor. How many possibilities are there for the ordered pair <math>(a,b)</math>? *The integer <math>N</math> is positive. There are exactly <math>2005</math> ordered pairs <math>(x, y)</math> of positive integers satisfying:
    4 KB (682 words) - 12:13, 8 December 2024
  • ...<math>D</math> be the event that the fourth, fifth and sixth people are in ordered height. By a combination of complementary counting and PIE, we have that ou
    9 KB (1,703 words) - 00:20, 7 December 2024
  • ...ordered in decreasing order and the set <math>\{a_1, a_2, \ldots\}</math>, ordered in increasing order, then the maximum sum is just <math>-a_1b_k - a_2b_{k-1
    5 KB (804 words) - 12:54, 26 January 2023
  • ...set of Real numbers is a [[Least upper bound|complete]], [[Order relation|ordered]] [[field]] under addition and multiplication.
    3 KB (496 words) - 22:22, 5 January 2022
  • ...ber. Because <math>n</math> has ten distinct digits, its digits must be an ordered arrangement of <math>0</math> to <math>9</math> used exactly once. From her
    12 KB (1,898 words) - 07:42, 19 August 2024
  • ...(a,c)\in f</math> then <math>b=c</math>. (Here <math>(a,b)</math> is an [[ordered pair]].)
    10 KB (1,761 words) - 02:16, 12 May 2023
  • A '''partition''' <math>\mathcal{P}</math> is defined as the ordered <math>n</math>-[[tuple]] of real numbers <math>\mathcal{P}=(x_0,x_1,\ldots, ...agged partition''' <math>\mathcal{\dot{P}}</math> is defined as the set of ordered pairs <math>\mathcal{\dot{P}}=\{([x_{i-1},x_i],t_i)\}_{i=1}^n</math>.
    1 KB (178 words) - 19:34, 6 March 2022
  • Past sets may be ordered from the US Math Kangaroo website. The Canadian and International (primari
    6 KB (949 words) - 21:33, 17 November 2024
  • ...is well-orderable, and since the class of well-orderable cardinals is well-ordered, we can reasonably talk about the least cardinal in bijection with a set <m
    2 KB (263 words) - 23:54, 16 November 2019
  • In their most general form, polygons are an ordered [[set]] of [[vertex|vertices]], <math>\{A_1, A_2, \ldots, A_n\}</math>, <ma
    2 KB (372 words) - 18:04, 30 May 2015
  • ...n</math>-dimensional vector can be described in this coordinate form as an ordered <math>n</math>-tuple of numbers within angle brackets or parentheses, <math
    11 KB (1,876 words) - 18:01, 29 August 2024
  • ...log_8 a_2+\cdots+\log_8 a_{12} = 2006, </math> find the number of possible ordered pairs <math> (a,r). </math>
    4 KB (680 words) - 11:54, 16 October 2023
  • A '''sequence''' is an ordered list of terms. Sequences may be either [[finite]] or [[infinite]].
    2 KB (413 words) - 20:18, 13 November 2022
  • ...<math>n</math>, where <math>n</math> is a positive integer. For how many ordered 4-tuples <math>(k_1, k_2, k_3, k_4)</math> of nonnegative integers can we ...h>. And so on, until <math>m=2n</math>, where there is one choice for each ordered pair, <math>(n,n)</math>.
    7 KB (1,276 words) - 19:51, 6 January 2024
  • ...these sets (denoted <math>\mathcal{X}\times \mathcal{Y}</math>) gives all ordered pairs <math>(x,y)</math> with <math>x \in \mathcal{X}</math> and <math>y \i ...ial time of relation where for every <math>y \in \mathcal{Y}</math> in the ordered pair <math>(x,y)</math>, there exists a unique <math>x \in \mathcal{X}</mat
    4 KB (743 words) - 23:28, 17 November 2024
  • ...ates that every set can be well-ordered. A well-ordered set is a [[totally ordered set]] <math>(S,\prec)</math> for which each set <math>A\subseteq S</math> h
    381 bytes (59 words) - 11:40, 2 June 2019
  • ==Picking Ordered Subsets of a Set==
    3 KB (422 words) - 10:01, 25 December 2020
  • ...log_8 a_2+\cdots+\log_8 a_{12} = 2006, </math> find the number of possible ordered pairs <math> (a,r). </math>
    7 KB (1,173 words) - 02:31, 4 January 2023
  • ...log_8 a_2+\cdots+\log_8 a_{12} = 2006, </math> find the number of possible ordered pairs <math> (a,r). </math> ...dd multiples are separated by a distance of <math>22</math>, the number of ordered pairs that work is <math>1 + \frac{1001-11}{22}=1 + \frac{990}{22}=46</math
    4 KB (651 words) - 17:27, 22 May 2021

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