- 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...
- 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...
- f(ab)=f(a)f(b)}
whenever a {\displaystyle a} and b {\displaystyle b} are
coprime. An
arithmetic function is said to be
completely multiplicative (or totally...
- φ 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:...
- square-free over any
field that
contains K,
which holds if and only if P(X) is
coprime to its
formal derivative D P(X). In an
older definition, P(X) was considered...
- 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...
-
other words, a
fraction a/b is
irreducible if and only if a and b are
coprime, that is, if a and b have a
greatest common divisor of 1. In
higher mathematics...
- (or, more commonly, an
Euler probable prime) to base a, if a and n are
coprime, and a ( n − 1 ) / 2 ≡ ( a n ) ( mod n ) {\displaystyle a^{(n-1)/2}\equiv...
