Search results

Jump to navigation Jump to search

Page title matches

  • ...are considered indistinguishable. When numbers are added or multiplied in modular arithmetic, one does not care about the whole numerical result, but rather only about ...ation for some kinds of modern [[cryptography]]. Within pure mathematics, modular arithmetic is of fundamental importance in [[abstract algebra]] and [[number theory]].
    2 KB (267 words) - 13:18, 6 December 2008
  • #Redirect [[Modular arithmetic]]
    32 bytes (3 words) - 09:49, 14 June 2008
  • 182 bytes (26 words) - 09:58, 4 September 2009
  • Auto-populated based on [[Special:WhatLinksHere/Modular arithmetic]]. Needs checking by a human.
    856 bytes (107 words) - 18:36, 11 January 2010

Page text matches

  • ...are considered indistinguishable. When numbers are added or multiplied in modular arithmetic, one does not care about the whole numerical result, but rather only about ...ation for some kinds of modern [[cryptography]]. Within pure mathematics, modular arithmetic is of fundamental importance in [[abstract algebra]] and [[number theory]].
    2 KB (267 words) - 13:18, 6 December 2008
  • #Redirect [[Modular arithmetic]]
    32 bytes (3 words) - 09:49, 14 June 2008
  • #Redirect [[Modular arithmetic]]
    32 bytes (3 words) - 09:50, 14 June 2008
  • #Redirect [[Modular arithmetic]]
    32 bytes (3 words) - 09:50, 14 June 2008
  • A generator of the multiplicative group in modular arithmetic when that group is cyclic.
    124 bytes (17 words) - 02:36, 5 December 2008
  • Various results connecting the solvability of two related cubic equations in modular arithmetic, generalising the concept of quadratic reciprocity.
    183 bytes (22 words) - 15:48, 27 October 2008
  • A group homomorphism on the multiplicative group in modular arithmetic extended to a multiplicative function on the positive integers.
    170 bytes (22 words) - 14:42, 2 January 2009
  • {{r|Modular arithmetic}}
    205 bytes (29 words) - 15:13, 10 January 2024
  • {{r|Modular arithmetic}}
    201 bytes (27 words) - 11:59, 15 June 2009
  • {{r|Modular arithmetic}}
    260 bytes (35 words) - 17:07, 26 July 2008
  • ...is that where the ring is the integers, in which case it is a theorem in [[modular arithmetic]] (see the main page for a discussion in this simpler context).
    394 bytes (62 words) - 13:04, 18 November 2008
  • ...p]] of the [[integer]]s, or to an additive group with respect to a fixed [[modular arithmetic|modulus]].
    362 bytes (57 words) - 20:28, 31 January 2009
  • {{r|Modular arithmetic}}
    398 bytes (43 words) - 20:00, 29 July 2010
  • {{r|Modular arithmetic}}
    441 bytes (56 words) - 19:50, 11 January 2010
  • * In [[modular arithmetic]], the property of integers having the same remainder on division by a give
    645 bytes (93 words) - 12:51, 31 May 2009
  • {{r|Modular arithmetic}}
    2 KB (262 words) - 19:07, 11 January 2010
  • Auto-populated based on [[Special:WhatLinksHere/Modular arithmetic]]. Needs checking by a human.
    856 bytes (107 words) - 18:36, 11 January 2010
  • # The group of order two, which f.i. can be represented by addition [[modular arithmetic|modulo]] 2 or the set {-1, 1} under multiplication. # The [[cyclic group]] of order 4, which can be represented by addition [[modular arithmetic|modulo]] 4.
    5 KB (819 words) - 10:52, 15 September 2009
  • {{r|Modular arithmetic}}
    2 KB (247 words) - 06:00, 7 November 2010
  • * On the integers more generally, [[modular arithmetic]] operates on the equivalence classes defined by remainder on division by a
    3 KB (477 words) - 17:43, 14 October 2009
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)