Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • [[File:Binary operations as black box.svg|thumb|A binary operation <math>\circ</math> is a rule for combining the arguments <math>x< ...e formally, a binary operation is an [[Operation (mathematics)|operation]] of [[arity]] two. ...
    9 KB (1,514 words) - 23:45, 29 May 2026
  • {{Short description|Property of a binary operation}} ...m+n}</math> for all positive integers <math>m, n</math>. It is a weak form of [[associativity]]. ...
    5 KB (719 words) - 13:02, 12 May 2026
  • {{Short description|Specific element of an algebraic structure}} ...is no possibility of confusion, but the identity implicitly depends on the binary operation it is associated with. ...
    11 KB (1,414 words) - 21:02, 22 April 2026
  • {{Short description|Mathematical set of all subsets of a set}} | image = Hasse diagram of powerset of 3.svg ...
    22 KB (3,239 words) - 16:22, 25 May 2026
  • .../csharp_color_image_to_binary.aspx |title=Conversion of a Color Image to a Binary Image |publisher=CoderSource.net |date=2005-04-18 |access-date=2008-06-11 | ...ge''' is a [[digital image]] that consists of [[pixels]] that can have one of exactly two colors, usually black and white. Each pixel is stored as a sing ...
    16 KB (2,348 words) - 23:38, 18 April 2026
  • {{short description|Set of elements in any of some sets}} [[File:Venn0111.svg|thumb|200px|Union of two sets:<br /><math>~A \cup B</math>]] ...
    15 KB (2,402 words) - 10:15, 2 April 2026
  • {{Short description|Set of the elements not in a given subset}} ...red inside a square. The area outside the circle is unfilled. The borders of both the circle and the square are black. ...
    12 KB (1,910 words) - 16:28, 22 May 2026
  • [[File:Venn 0000 0001.svg|220px|thumb|[[Venn diagram]] of <math>A \wedge B \land C</math>]] ...'''conjunction''' or '''logical conjunction'''. The [[logical connective]] of this operator is typically represented as <math>\wedge</math><ref name=":2" ...
    18 KB (2,679 words) - 05:59, 30 November 2025
  • {{Short description|Property involving two mathematical operations}} | image = [[File:Illustration of distributive property with rectangles.svg|300px|class=skin-invert-image]] ...
    20 KB (2,930 words) - 10:24, 20 March 2026
  • {{Short description|Property of a mathematical operation}} | image = [[File:Associativity of binary operations (without question marks).svg|300px|class=skin-invert-image]] ...
    26 KB (3,802 words) - 11:13, 16 May 2026
  • {{Short description|Rooted binary tree data structure}} |name=Binary search tree ...
    30 KB (4,401 words) - 17:01, 29 April 2026
  • {{Short description|Limited form of tree data structure}} {{Distinguish|Binary search tree|B-tree|B+ tree}} ...
    38 KB (6,061 words) - 17:05, 30 April 2026
  • ==Structures and operations== * [[Direct product of groups]] ...
    9 KB (984 words) - 19:24, 21 February 2026
  • ...s)|groups]]: A ''quasigroup'' is a [[magma (algebra)|magma]] with the type of [[Division (mathematics)#Abstract algebra|divisibility]] given by the [[Qua ...er from groups mainly in that the [[associative]] and [[identity element]] properties are optional. In fact, a [[Empty set|nonempty]] associative quasigroup is a ...
    33 KB (4,679 words) - 04:07, 18 November 2025
  • ...nal arrays of numbers), their outer product is a tensor. The outer product of tensors is also referred to as their [[tensor product]], and can be used to ...[dot product]] (a special case of "[[inner product]]"), which takes a pair of coordinate vectors as input and produces a [[scalar (mathematics)|scalar]] ...
    18 KB (2,805 words) - 07:00, 12 February 2026
  • ...bn=978-3-540-60275-0 }}</ref> It supports 'lookup', 'remove', and 'insert' operations. The '''dictionary problem''' is the classic problem of designing efficient [[data structure]]s that implement associative arrays.< ...
    25 KB (3,767 words) - 11:49, 28 May 2026
  • {{Short description|Variant of heap data structure}} | name = Binary (min) heap ...
    30 KB (4,714 words) - 13:54, 24 April 2026
  • {{short description|Concept that is not defined in terms of previously defined concepts}} ...eading. Formal theories cannot dispense with primitive notions, under pain of [[infinite regress]]. ...
    6 KB (907 words) - 19:51, 27 May 2026
  • ...its elements that is compatible with the field operations. Basic examples of ordered fields are the [[Rational number|rational numbers]] and the [[real ...is implies that the [[complex number]]s cannot be ordered since the square of the [[imaginary unit]] ''i'' is {{num|−1}} (which is negative in any ordere ...
    15 KB (2,291 words) - 00:23, 20 January 2026
  • {{Short description|Generalization of additive and multiplicative inverses}} ...ath|−''x''}}) and [[Multiplicative inverse|reciprocal]] ({{math|1/''x''}}) of numbers. ...
    30 KB (4,611 words) - 04:02, 2 April 2026
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)