Search results
Appearance
Did you mean: module documentation
The page "Modulo:Documentation" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
- In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the...46 KB (3,354 words) - 18:52, 20 May 2025
- In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable...46 KB (4,371 words) - 23:30, 22 May 2025
- order of a modulo n is the order of a in the multiplicative group of the units in the ring of the integers modulo n. The order of a modulo n is sometimes...5 KB (624 words) - 01:54, 24 August 2024
- advantage and efficiency advantage for computing modulo to one period. Computing modulo 1 turn or modulo 2 half-turns can be losslessly and efficiently...55 KB (7,025 words) - 07:16, 22 May 2025
- (11 minus the remainder of the sum of the products modulo 11) modulo 11. Taking the remainder modulo 11 a second time accounts for the possibility that...63 KB (6,748 words) - 11:32, 28 April 2025
- result are stored; the result is said to wrap around the maximum (i.e. modulo a power of the radix, usually two in modern computers, but sometimes ten...28 KB (3,206 words) - 15:35, 14 April 2025
- the polynomial "left over" after dividing one polynomial by another. The modulo operation is the operation that produces such a remainder when given a dividend...10 KB (1,315 words) - 09:50, 10 May 2025
- Tail call (redirect from Tail recursion modulo cons)argument (product in the above example) to the function. Tail recursion modulo cons is a generalization of tail-recursion optimization introduced by David...41 KB (4,248 words) - 02:20, 25 May 2025
- check digit method would be to take the sum of all digits (digital sum) modulo 10. This would catch any single-digit error, as such an error would always...19 KB (2,632 words) - 09:36, 18 May 2025
- + r0 is any nonzero polynomial modulo 2 with at most t nonzero coefficients, then R(x) is not a multiple of P(x) modulo 2. If follows that the corresponding...50 KB (7,455 words) - 13:52, 23 May 2025
- Instruction scheduling (redirect from Modulo scheduling)Global scheduling: instructions can move across basic block boundaries. Modulo scheduling: an algorithm for generating software pipelining, which is a...9 KB (1,189 words) - 15:01, 7 February 2025
- = k - n; // point to state n iterations before // if (k < 0) k += n; // modulo n circular indexing // the previous 2 lines actually do nothing // for illustration...32 KB (3,995 words) - 16:33, 14 May 2025
- this algorithm) Add up all these products The check digit is the sum modulo 11 modulo 10. Energy accounting software Meter operator Mains electricity Distribution...37 KB (2,421 words) - 14:35, 20 May 2025
- Bios typing an Alt code greater than 255 produced the same as that number modulo 256. Some applications retained this behavior, while others (in particular...24 KB (1,115 words) - 00:08, 3 April 2025
- arithmetic operators (+, -, *, /), the floor-division operator //, and the modulo operator %. (With the module operator, a remainder can be negative, e.g...175 KB (14,436 words) - 05:57, 22 May 2025
- a UTC time by taking the quotient and modulus of the Unix time number, modulo 86400. The quotient is the number of days since the epoch, and the modulus...51 KB (5,461 words) - 21:52, 3 May 2025
- the parameters m and a. For example, a = 1 and c = 1 produces a simple modulo-m counter, which has a long period, but is obviously non-random. Other values...43 KB (4,861 words) - 15:40, 14 March 2025
- name reflected the move to organise topological classes such as cycles-modulo-boundaries explicitly into abelian groups. This point of view is often attributed...5 KB (548 words) - 18:12, 21 February 2025
- built in stacks of 29 planes of 4,096 cores: 25 for the data word, two for "modulo-3 check" bits, and two for spares. Each memory cabinet held up to four stacks...7 KB (733 words) - 07:50, 19 June 2024
- specified. Per the official GS1 General Specification the check digit is a 'modulo 10 check digit' or Luhn algorithm check digit. GS1 also provides a check...5 KB (547 words) - 09:48, 23 May 2025
- this field are the integers modulo p, and the field arithmetic is implemented in terms of the arithmetic of integers modulo p. A binary field is the field
- The modulo function returns the remainder when the arguments are divided together, so a modulo b means the remainder when a is divided by b. %modulo remainder