- coprime
-
24 and 35 are coprime.
b) Having no positive integer factors, aside from 1, in common with one or more specified other positive integers.24 is coprime to 35.
Wikipedia foundation.
coprime
Look at other dictionaries:
Coprime — In number theory, a branch of mathematics, two integers a and b are said to be coprime (also spelled co prime) or relatively prime if the only positive integer that evenly divides both of them is 1. This is the same thing as their greatest common … Wikipedia
Pairwise coprime — In mathematics, especially number theory, a set of integers is said to be pairwise coprime (or pairwise relatively prime, also known as mutually coprime) if every pair of integers a and b in the set are coprime (that is, have no common divisors… … Wikipedia
Chinese remainder theorem — The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra. In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers.… … Wikipedia
Transposable integer — A summary of this article appears in Repeating decimal. The digits of some specific integers permute or shift cyclically when they are multiplied by a number n. Examples are: 142857 × 3 = 428571 (shifts cyclically one place left) 142857 × 5 =… … Wikipedia
Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal … Wikipedia
abc conjecture — The abc conjecture (also known as Oesterlé–Masser conjecture) is a conjecture in number theory, first proposed by Joseph Oesterlé and David Masser in 1985. The conjecture is stated in terms of three positive integers, a, b and c (whence comes the … Wikipedia
Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… … Wikipedia
Fermat's little theorem — (not to be confused with Fermat s last theorem) states that if p is a prime number, then for any integer a , a^p a will be evenly divisible by p . This can be expressed in the notation of modular arithmetic as follows::a^p equiv a pmod{p},!A… … Wikipedia
Euler's theorem — In number theory, Euler s theorem (also known as the Fermat Euler theorem or Euler s totient theorem) states that if n is a positive integer and a is coprime to n , then:a^{varphi (n)} equiv 1 pmod{n}where φ( n ) is Euler s totient function and … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
