- In
number theory, two
integers a and b are
coprime,
relatively prime or
mutually prime if the only
positive integer that is a
divisor of both of them...
- Fermat–Euler
theorem or Euler's
totient theorem)
states that, if n and a are
coprime positive integers, then a φ ( n ) {\displaystyle a^{\varphi (n)}} is congruent...
- of
these integers,
under the
condition that the
divisors are
pairwise coprime (no two
divisors share a
common factor other than 1). The
theorem is sometimes...
- = f ( a ) f ( b ) {\displaystyle f(ab)=f(a)f(b)}
whenever a and b are
coprime. An
arithmetic function f(n) is said to be
completely multiplicative (or...
- an
integer multiple of 7. If a is not
divisible by p, that is, if a is
coprime to p, then Fermat's
little theorem is
equivalent to the
statement that...
- φ is Euler's
totient function, then ac ≡ ad (mod m)—provided that a is
coprime with m. For
cancellation of
common terms, we have the
following rules:...
- this case, by
analogy with the
integer case, one says that p and q are
coprime polynomials. As
stated above, the GCD of two
polynomials exists if the...
- In
modular arithmetic, the
integers coprime (relatively prime) to n from the set { 0 , 1 , … , n − 1 } {\displaystyle \{0,1,\dots ,n-1\}} of n non-negative...
- ( x ) = { 1 q if x = p q ( x is rational), with p ∈ Z and q ∈ N
coprime 0 if x is irrational. {\displaystyle f(x)={\begin{cases}{\frac {1}{q}}&{\text{if...
- ab of two integers, and is
coprime with a, then n
divides b. This is a
generalization because a
prime number p is
coprime with an
integer a if and only...
