mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers...
29 KB (3,646 words) - 14:39, 17 May 2025
Arithmetic dynamics Arithmetic of abelian varieties Birch and Swinnerton-Dyer conjecture Moduli of algebraic curves Siegel modular variety Siegel's theorem...
15 KB (1,464 words) - 19:56, 6 May 2024
In mathematics, particularly in the area of arithmetic, a modular multiplicative inverse of an integer a is an integer x such that the product ax is congruent...
24 KB (3,652 words) - 12:22, 12 May 2025
In modular arithmetic computation, Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for performing...
31 KB (4,593 words) - 01:48, 12 May 2025
implement integer arithmetic operations using saturation arithmetic; instead, they use the easier-to-implement modular arithmetic, in which values exceeding...
8 KB (1,075 words) - 18:36, 19 February 2025
for intervals near a number x {\displaystyle x} ). Modular arithmetic modifies usual arithmetic by only using the numbers { 0 , 1 , 2 , … , n − 1 }...
117 KB (14,179 words) - 21:25, 8 June 2025
Number theory (redirect from Higher arithmetic)
methods in arithmetic. Its primary subjects of study are divisibility, factorization, and primality, as well as congruences in modular arithmetic. Other topics...
95 KB (12,176 words) - 16:05, 7 June 2025
Group (mathematics) (section Modular arithmetic)
operations of modular arithmetic modify normal arithmetic by replacing the result of any operation by its equivalent representative. Modular addition, defined...
102 KB (13,138 words) - 02:09, 9 June 2025
factors Formula for primes Factorization RSA number Fundamental theorem of arithmetic Square-free Square-free integer Square-free polynomial Square number Power...
10 KB (938 words) - 19:59, 21 December 2024
Universal hashing (section Avoiding modular arithmetic)
multiply-shift scheme described by Dietzfelbinger et al. in 1997. By avoiding modular arithmetic, this method is much easier to implement and also runs significantly...
29 KB (4,908 words) - 13:54, 20 May 2025
perform modular exponentiation The GNU Multiple Precision Arithmetic Library (GMP) library contains a mpz_powm() function [5] to perform modular exponentiation...
21 KB (2,759 words) - 07:00, 17 May 2025
arithmetic Floating-point arithmetic Interval arithmetic Arbitrary-precision arithmetic Modular arithmetic Multi-modular arithmetic p-adic arithmetic...
2 KB (192 words) - 00:47, 25 May 2025
Residue number system (redirect from Multi-modular arithmetic)
set of modular values. Using a residue numeral system for arithmetic operations is also called multi-modular arithmetic. Multi-modular arithmetic is widely...
14 KB (1,597 words) - 11:30, 25 May 2025
means 10 ≡ 1 ( mod 3 ) {\displaystyle 10\equiv 1{\pmod {3}}} (see modular arithmetic). The same for all the higher powers of 10: 10 n ≡ 1 n ≡ 1 ( mod 3...
54 KB (6,801 words) - 07:22, 22 May 2025
Pai gow (section Modular arithmetic)
the total number of pips on both tiles in a hand are added using modular arithmetic (modulo 10), equivalent to how a hand in baccarat is scored. The name...
22 KB (2,022 words) - 13:02, 28 December 2024
group" comes from the relation to moduli spaces, and not from modular arithmetic. The modular group Γ is the group of fractional linear transformations of...
25 KB (3,438 words) - 07:09, 25 May 2025
Morra (game) (section Modular arithmetic)
The game can be expanded for a larger number of players by using modular arithmetic. For n players, each player is assigned a number from zero to n−1...
15 KB (2,184 words) - 09:08, 22 October 2024
signals to perform calculations. There are many other types of arithmetic. Modular arithmetic operates on a finite set of numbers. If an operation would result...
165 KB (16,396 words) - 04:14, 2 June 2025
1)\\&=0+27+0+42+24+0+24+3+10+2\\&=132=12\times 11.\end{aligned}}} Formally, using modular arithmetic, this is rendered ( 10 x 1 + 9 x 2 + 8 x 3 + 7 x 4 + 6 x 5 + 5 x 6...
62 KB (6,674 words) - 12:56, 29 May 2025
Quotient group (section Integer modular arithmetic)
\mathbb {Z} } ) Free group Modular groups PSL(2, Z {\displaystyle \mathbb {Z} } ) SL(2, Z {\displaystyle \mathbb {Z} } ) Arithmetic group Lattice Hyperbolic...
20 KB (3,753 words) - 01:02, 12 December 2024
Proofs of Fermat's little theorem (category Modular arithmetic)
a^{p}\equiv a{\pmod {p}}} for every prime number p and every integer a (see modular arithmetic). Some of the proofs of Fermat's little theorem given below depend...
36 KB (4,822 words) - 17:09, 19 February 2025
Unit fraction (category Elementary arithmetic)
produces another unit fraction, but other arithmetic operations do not preserve unit fractions. In modular arithmetic, unit fractions can be converted into...
24 KB (2,984 words) - 20:51, 30 April 2025
Wilson's theorem (category Modular arithmetic)
is one less than a multiple of n. That is (using the notations of modular arithmetic), the factorial ( n − 1 ) ! = 1 × 2 × 3 × ⋯ × ( n − 1 ) {\displaystyle...
17 KB (2,308 words) - 09:19, 5 June 2025
algorithm for finding the greatest common divisor of two integers, and modular arithmetic, for which only remainders are considered. The operation consisting...
16 KB (2,261 words) - 19:20, 5 March 2025
factor. It was initially introduced into mathematics in the context of modular arithmetic by Carl Friedrich Gauss in 1801. Since then, the term has gained many...
6 KB (807 words) - 13:43, 4 December 2024
Modulo (redirect from Modular operation)
Carl F. Gauss' approach to modular arithmetic in 1801. Modulo (mathematics), general use of the term in mathematics Modular exponentiation Turn (angle)...
46 KB (3,354 words) - 15:54, 31 May 2025
Euler's theorem (category Modular arithmetic)
arithmetica nova methodo demonstrata" (Proof of a new method in the theory of arithmetic), Novi Commentarii academiae scientiarum Petropolitanae, 8 : 74–104. Euler's...
9 KB (1,149 words) - 18:09, 9 June 2024
Discrete logarithm (category Modular arithmetic)
integer k {\displaystyle k} such that b k = a {\displaystyle b^{k}=a} . In arithmetic modulo an integer m {\displaystyle m} , the more commonly used term is...
17 KB (2,506 words) - 02:19, 27 April 2025
reducing fractions to their simplest form and for performing division in modular arithmetic. Computations using this algorithm form part of the cryptographic...
126 KB (15,349 words) - 16:35, 30 April 2025
possible and with 2+8=10+U, U=0. The use of modular arithmetic often helps. For example, use of mod-10 arithmetic allows the columns of an addition problem...
10 KB (1,444 words) - 23:51, 25 February 2025