Search results

Create the page "Algorithm Of" on this wiki! See also the search results found.

• Division algorithm
  * Move definition of [[integer division]] to own page [[User:Alec|Alec]] ([[User talk:Alec|talk] * Add algorithm - it's the crappy one that just subtracts until {{M|0\le r < b}} actually h
  3 KB (594 words) - 16:48, 7 December 2017
• Greatest common divisor
  ...quires knowledge of what it means for a number to be a [[Divisor|divisor]] of another. ...t common divisor'' of {{M|a}} and {{M|b}}<ref name="Crypt">The mathematics of ciphers, Number theory and RSA cryptography - S. C. Coutinho</ref> is the g
  1 KB (252 words) - 08:33, 21 May 2015
• Divisor
  ...or'' of {{M|a}}, or {{M|b}} is a ''factor'' of {{M|a}}<ref>The mathematics of ciphers, Number theory and RSA cryptography - S. C. Coutinho</ref> if there * Given {{M|a,b\in\mathbb{Z} }}, {{M|b}} is a ''divisor'' of, ''factor of'', or ''divides'' {{M|a}} if {{M|1=\exists c\in\mathbb{Z}[a=bc]}}
  783 B (141 words) - 08:20, 21 May 2015
• Euclidean algorithm
  '''Note:''' this is an algorithm for computing the [[GCD]] of two positive integers The algorithm is as follows<ref>The mathematics of ciphers, Number theory and RSA cryptography - S. C. Coutinho</ref>:
  1 KB (187 words) - 08:53, 21 May 2015
• Notes:Diff algorithm
  * Given a finite string formed of symbols from an infinite or finite alphabet, {{M|A}} and * another finite string of the same or different length, from the same alphabet, {{M|B}}
  12 KB (2,041 words) - 00:50, 27 June 2016
• Notes:Parsing
  * {{M|\alpha,\beta,\gamma,\ldots}} denote sequences (possibly empty) of terminals and nonTerminals {{Caution|Done from memory, still to do, check t Definition of {{M|\nullable{\alpha} }} (a [[predicate]]):
  2 KB (346 words) - 19:06, 24 September 2016
• Alec's c.d.f-sidestepping sampling method
  : See [[generating samples from a distribution]] for and overview of methods used ==Algorithm==
  3 KB (484 words) - 00:18, 1 October 2017
• Integer division
  ...gorithm]]'' - it needs to be moved here, although it's more like "division of natural numbers" unless I sorted out how to handle negative values}} ==See [[Division algorithm]] for what should be here==
  304 B (49 words) - 17:06, 7 January 2018
• Modulo operation
  ...{{link|function|Computer Science}} is the [[division remainder|remainder]] of [[integer division|dividing]] {{M|a}} by {{M|b}}. * [[Division algorithm]] and [[Integer division]]
  986 B (148 words) - 17:48, 7 January 2018