# Difference between revisions of "Ordered pair"

m |
|||

Line 1: | Line 1: | ||

An '''ordered pair''' is a pair of two objects, usually denoted <math>(x, y)</math>, in which we consider the order of the two objects to be important. Thus, the ordered pair <math>(2, 3)</math> is different from the ordered pair <math>(3, 2)</math>. This should be contrasted with the notion of [[set]] (or [[multiset]]), 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 if <math>x = a</math> and <math>y = b</math>. | An '''ordered pair''' is a pair of two objects, usually denoted <math>(x, y)</math>, in which we consider the order of the two objects to be important. Thus, the ordered pair <math>(2, 3)</math> is different from the ordered pair <math>(3, 2)</math>. This should be contrasted with the notion of [[set]] (or [[multiset]]), 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 if <math>x = a</math> and <math>y = b</math>. | ||

− | The notion of an ordered pair can be naturally extended to that of an [[ordered tuple]]. | + | The notion of an ordered pair can be naturally extended to that of an [[tuple|ordered tuple]]. |

− | + | Order is necessary, when things aren't [[commutative property|commutative]]. Also assume we have a restriction in a problem, such that <math>a>b</math> at all times. In order to efficiently test possibilities, we should order <math>b</math> after <math>a</math> (to input its value into calculating the minimum b) in any programming or math. We don't waste time, to figure out already known impossible solutions, in this implementation. |

## Latest revision as of 19:40, 28 February 2020

An **ordered pair** is a pair of two objects, usually denoted , in which we consider the order of the two objects to be important. Thus, the ordered pair is different from the ordered pair . This should be contrasted with the notion of set (or multiset), in which we have . In general, we say two ordered pairs, and are the same if and only if and .

The notion of an ordered pair can be naturally extended to that of an ordered tuple.

Order is necessary, when things aren't commutative. Also assume we have a restriction in a problem, such that at all times. In order to efficiently test possibilities, we should order after (to input its value into calculating the minimum b) in any programming or math. We don't waste time, to figure out already known impossible solutions, in this implementation.