Search results
Appearance
The page "Modulo:For loop" 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 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
- non-negative integers form a group under multiplication modulo n, called the multiplicative group of integers modulo n. Equivalently, the elements of this group can...26 KB (3,156 words) - 13:35, 6 May 2025
- topology, a branch of mathematics, the loop space ΩX of a pointed topological space X is the space of (based) loops in X, i.e. continuous pointed maps from...5 KB (597 words) - 15:47, 26 May 2025
- Fisher–Yates shuffle (section Modulo bias)cost of eliminating "modulo bias" when generating random integers for a Fisher-Yates shuffle depends on the approach (classic modulo, floating-point multiplication...42 KB (5,224 words) - 18:55, 24 May 2025
- not congruent to 1 modulo pi for each i. Is there a Moufang loop of odd order with trivial nucleus? Proposed: by Andrew Rajah at Loops '03, Prague 2003...30 KB (3,589 words) - 00:04, 25 February 2025
- overlapping loop iterations, from modulo scheduling, the currently most effective known compiler technique for generating software pipelined loops. Software...12 KB (1,991 words) - 12:34, 8 February 2023
- N) = 1. For computational purposes it is also necessary that division and reduction modulo R are inexpensive, and the modulus is not useful for modular...31 KB (4,593 words) - 01:48, 12 May 2025
- Novikov self-consistency principle (redirect from Time loop logic)self-consistent. It turns out that, at least formally (modulo such issues as the convergence of the sum), for every choice of the billiard ball's initial, nonrelativistic...27 KB (3,446 words) - 15:35, 24 May 2025
- PLL multibit (redirect from Multibit phase locked loop)(LSB), the frequency increases. For a binary counter, each next bit is at twice the frequency of the previous one. For modulo counters, the relationship is...9 KB (1,239 words) - 00:24, 13 May 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
- negative exponent e by finding the modular multiplicative inverse d of b modulo m using the extended Euclidean algorithm. That is: c = be mod m = d−e mod...21 KB (2,759 words) - 07:00, 17 May 2025
- as unoccupied j := i loop (note 2) j := (j + 1) modulo num_slots if slot[j] is unoccupied exit loop k := hash(slot[j].key) modulo num_slots // determine...8 KB (1,044 words) - 21:06, 1 March 2025
- Finite field (redirect from Integers modulo a prime)prime field of order p {\displaystyle p} may be constructed as the integers modulo p {\displaystyle p} , Z / p Z {\displaystyle \mathbb {Z} /p\mathbb {Z} }...45 KB (7,535 words) - 18:07, 22 April 2025
- instructions: SIMD VLIW Specialized instructions for modulo addressing in ring buffers and bit-reversed addressing mode for FFT cross-referencing DSPs sometimes use...26 KB (2,924 words) - 08:07, 4 March 2025
- result is reduced modulo 232. input: key, len, seed c1 ← 0xcc9e2d51 c2 ← 0x1b873593 r1 ← 15 r2 ← 13 m ← 5 n ← 0xe6546b64 hash ← seed for each fourByteChunk...17 KB (1,406 words) - 23:48, 6 March 2025
- is a way of manually implementing loop unrolling by interleaving two syntactic constructs of C: the do-while loop and a switch statement. Its discovery...15 KB (1,645 words) - 07:53, 28 April 2025
- followed by reduction modulo p. For instance, in GF(5), 4 + 3 = 7 is reduced to 2 modulo 5. Division is multiplication by the inverse modulo p, which may be...25 KB (2,865 words) - 02:35, 11 January 2025
- beginning of an Adler-32 run, A is initialized to 1, B to 0. The sums are done modulo 65521 (the largest prime number smaller than 216). The bytes are stored...10 KB (887 words) - 15:40, 25 August 2024
- Tail call (redirect from Tail recursion modulo cons)data-constructing operations, in general). This call would thus be a tail call save for ("modulo") the said cons operation. But prefixing a value at the start of a list...41 KB (4,248 words) - 02:20, 25 May 2025
- Iterative Stencil Loops (ISLs) or Stencil computations are a class of numerical data processing solution which update array elements according to some...13 KB (1,765 words) - 15:19, 2 March 2025
- operations for modulo and integer division and for conversion between values with different scales. All built-in and predefined operations for exact arithmetic
- result are stored; the result is said to wrap around the maximum (i.e. modulo power of two). An overflow condition may give results leading to unintended