Search results

Page title matches

• Modular arithmetic
  ...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
• Modular Arithmetic
  #Redirect [[Modular arithmetic]]
  32 bytes (3 words) - 09:49, 14 June 2008
• Modular arithmetic/Definition
  182 bytes (26 words) - 09:58, 4 September 2009
• Modular arithmetic/Related Articles
  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

• Modular arithmetic
  ...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
• Modular Arithmetic
  #Redirect [[Modular arithmetic]]
  32 bytes (3 words) - 09:49, 14 June 2008
• Remainder arithmetic
  #Redirect [[Modular arithmetic]]
  32 bytes (3 words) - 09:50, 14 June 2008
• Remainder Arithmetic
  #Redirect [[Modular arithmetic]]
  32 bytes (3 words) - 09:50, 14 June 2008
• Primitive root/Definition
  A generator of the multiplicative group in modular arithmetic when that group is cyclic.
  124 bytes (17 words) - 02:36, 5 December 2008
• Cubic reciprocity/Definition
  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
• Dirichlet character/Definition
  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
• Modulus (disambiguation)
  {{r|Modular arithmetic}}
  205 bytes (29 words) - 15:13, 10 January 2024
• Cyclic group/Related Articles
  {{r|Modular arithmetic}}
  201 bytes (27 words) - 11:59, 15 June 2009
• Carmichael number/Related Articles
  {{r|Modular arithmetic}}
  260 bytes (35 words) - 17:07, 26 July 2008
• Chinese remainder theorem/Advanced
  ...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
• Cyclic group
  ...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
• Asymmetric key cryptography/Related Articles
  {{r|Modular arithmetic}}
  398 bytes (43 words) - 20:00, 29 July 2010
• Quadratic residue/Related Articles
  {{r|Modular arithmetic}}
  441 bytes (56 words) - 19:50, 11 January 2010
• Congruence (disambiguation)
  * 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
• Number theory/Related Articles
  {{r|Modular arithmetic}}
  2 KB (262 words) - 19:07, 11 January 2010
• Modular arithmetic/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Modular arithmetic]]. Needs checking by a human.
  856 bytes (107 words) - 18:36, 11 January 2010
• Group (mathematics)/Catalogs
  # 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
• Algebra/Related Articles
  {{r|Modular arithmetic}}
  2 KB (247 words) - 06:00, 7 November 2010
• Equivalence relation
  * 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
• Pseudo-Hadamard transform
  ...e structure but using a' = a+b, b' = a-b) does not have that property when modular arithmetic is involved, but the PHT variant does.
  2 KB (395 words) - 05:48, 8 April 2024
• Selberg sieve
  ...h satisfy a set of conditions which are expressed by [[Congruence relation#Modular arithmetic|congruence]]s. It was developed by [[Atle Selberg]] in the 1940s.
  3 KB (473 words) - 15:39, 9 December 2008
• Field (mathematics)
  ...ples are Z₂, the set {0,1} under addition and multiplication [[modular arithmetic|modulo]] 2. Other examples are Z₃ and Z₅, ... , Z<su
  3 KB (496 words) - 22:16, 7 February 2010
• Quadratic residue
  In [[modular arithmetic]], a '''quadratic residue''' for the [[modulus]] ''N'' is a number which ca
  2 KB (341 words) - 02:20, 28 October 2008
• Turan sieve
  ...h satisfy a set of conditions which are expressed by [[Congruence relation#Modular arithmetic|congruence]]s. It was developed by [[Pál Turán]] in 1934.
  3 KB (494 words) - 15:55, 29 October 2008
• Dirichlet character
  ...aracter (group theory)|character]] on the [[multiplicative group]] taken [[modular arithmetic|modulo]] a given integer.
  2 KB (335 words) - 06:03, 15 June 2009
• Cubic reciprocity
  ...results connecting the solvability of two related [[cubic equation]]s in [[modular arithmetic]]. It is a generalisation of the concept of [[quadratic reciprocity]].
  2 KB (319 words) - 15:45, 27 October 2008
• Chinese remainder theorem
  The '''Chinese remainder theorem''' is a mathematical result about [[modular arithmetic]]. It describes the solutions to a system of [[linear congruence]]s with d
  3 KB (535 words) - 15:02, 22 November 2008
• Polynomial
  ...ed to avoid loss or corruption of data, involve coefficients governed by [[modular arithmetic|arithmetic modulo 2]]. Polynomials with complex number coefficients or coe
  8 KB (1,242 words) - 02:01, 10 November 2009
• Carmichael number
  ...th>\scriptstyle a\ </math>. A Carmichael number ''c'' also satisfies the [[modular arithmetic|congruence]] <math>\scriptstyle a^{c-1} \equiv 1 \pmod c</math>, if <math>\
  4 KB (576 words) - 12:00, 1 January 2013
• Kendrick Analysis
  ...of CH₂ groups they contain. When measuring their masses with [[modular arithmetic]] using the mass m(CH₂) as the modulus, all homologous molecules Math has a tool called [[modular arithmetic]] that can reveal the same homologous relation using the [[modulo operation
  10 KB (1,572 words) - 15:08, 16 November 2010
• Asymmetric key cryptography
  ...derlying problems, most public-key algorithms involve operations such as [[modular arithmetic|modular]] multiplication and exponentiation, which are much more computatio
  8 KB (1,233 words) - 05:48, 8 April 2024
• Algebra
  ...te groups]] such as the [[cyclic group]]s that are the group of integers [[modular arithmetic|modulo]] ''n''. [[Set theory]] is a branch of [[logic]] and not technically
  18 KB (2,669 words) - 08:38, 17 April 2024
• Quadratic equation/Advanced
  For example, let <math>R</math> be the ring of integers [[modular arithmetic|modulo 15]],
  10 KB (1,580 words) - 08:52, 4 March 2009
• One-time pad
  ...[[random number]]s, which were added to the plaintext using the rules of [[modular arithmetic]]; each page was used only once, after which it was destroyed. Computer imp
  12 KB (1,878 words) - 05:48, 8 April 2024
• Mathematics
  Mathematics is not [[numerology]]. Numerology uses [[modular arithmetic]] to reduce names and dates down to numbers, but assigns emotions or traits
  30 KB (4,289 words) - 16:03, 20 January 2023