- 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...
-
preceding 123. 122 is a
nontotient since there is no
integer with
exactly 122
coprimes below it. Nor is
there an
integer with
exactly 122
integers with common...
-
exactly 146
coprimes less than it, so 146 is a nontotient. It is also
never the
difference between an
integer and the
total of
coprimes below it, so...
- φ 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:...
- 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...
-
cannot be
expressed as the
difference between any
integer and the
total of
coprimes below it,
making it a noncototient. 100 has a
reduced totient of 20, and...
- = 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...
- 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...
- 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,...
- 182 182 is a
nontotient number, as
there is no
integer with
exactly 182
coprimes below it 182 is an
odious number 182 is a
pronic number,
oblong number...
