Search results
Jump to navigation
Jump to search
- ...ity''' is a property of [[binary operation]]s. If <math>\star</math> is a binary operation then the associative property is the condition that2 KB (295 words) - 14:56, 12 December 2008
- {{r|Binary operation}}902 bytes (142 words) - 14:48, 23 December 2008
- In [[algebra]], '''distributivity''' is a property of two [[binary operation]]s which generalises the relationship between [[addition]] and [[multiplica2 KB (226 words) - 13:15, 18 November 2022
- In the common case of a [[binary operation]] <math>\star</math>, written now in [[operator notation]], we can write1,002 bytes (157 words) - 13:37, 8 March 2009
- {{r|Binary operation}}969 bytes (124 words) - 18:42, 11 January 2010
- {{r|Binary operation}}200 bytes (22 words) - 10:02, 12 November 2009
- {{r|Binary operation}}948 bytes (147 words) - 14:57, 6 December 2008
- ...that F is a commutative group with an [[identity element]] 0; and another binary operation ''*'' on F such that F\{0} is a commutative group with identity element 1. The first binary operation is usually called ''addition'' and the second one ''multiplication''.3 KB (496 words) - 22:16, 7 February 2010
- * [[Identity element]], or neutral element, with respect to a binary operation, an element which leaves the other operand unchanged.591 bytes (78 words) - 12:52, 31 May 2009
- '''Multiplication''' is the [[binary operation|binary]] [[operation (mathematics)|mathematical operation]] of scaling one Multiplication may also be used to describe more general [[binary operation]]s.5 KB (638 words) - 14:16, 17 December 2008
- An adder performs a binary operation (two operands) where the ''n'' of one power in integer ''A'' is added to th2 KB (368 words) - 05:19, 17 March 2024
- # There is a [[commutative operation|commutative]] binary operation, called ''addition'' (denoted by +) and the field ℝ is closed under this # There is a commutative binary operation, called ''multiplication'' (denoted by ×) and the field ℝ is closed4 KB (562 words) - 18:28, 5 January 2010
- Let ''M'' be a set with a [[binary operation]] <math>\circ</math> and ''R'' a [[ring (mathematics)|ring]]. Let ''f'' an2 KB (338 words) - 17:41, 23 December 2008
- In [[algebra]], '''absorption''' is a property of [[binary operation]]s which reflects an underlying [[order (relation)|order relation]].929 bytes (125 words) - 13:24, 18 November 2022
- {{r|Binary operation}}850 bytes (136 words) - 15:37, 8 December 2008
- {{r|Binary operation}}850 bytes (136 words) - 15:05, 12 December 2008
- {{r|Binary operation}}850 bytes (136 words) - 15:22, 21 December 2008
- {{r|Binary operation}}870 bytes (138 words) - 14:59, 12 December 2008
- ...\{\dots, -2, -1, 0, 1, 2, \dots\}</math> together with the constant 0, the binary operation <math>+</math> (addition), the unary function <math>-</math> (which maps ea2 KB (348 words) - 16:37, 10 March 2009
- ...e sequences, over the "alphabet" <math>X \cup \bar X</math> and take the [[binary operation]] of concatenation (juxtaposition) of words. The [[identity element]] for2 KB (436 words) - 02:56, 15 November 2008