- 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...
- 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...
- φ 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:...
- 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...
- 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...
- The
extended Euclidean algorithm is
particularly useful when a and b are
coprime. With that provision, x is the
modular multiplicative inverse of a modulo...
- = 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...
- triangle. A
primitive Pythagorean triple is one in
which a, b and c are
coprime (that is, they have no
common divisor larger than 1). For example, (3,...
- the
initial list only from
numbers coprime with the
first few
primes and not just from odds (i.e.,
numbers coprime with 2), and
counting in the correspondingly...
