Search for a tool
Coprimes

Tool to test or find co-prime numbers. Integers are called coprimes if their GCD (greatest common divisor) is equal to 1.

Results

Coprimes -

Tag(s) : Arithmetics, Mathematics

dCode and you

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!
You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Coprimes tool. Thank you.

# Coprimes

## Find Coprime Number with

Tool to test or find co-prime numbers. Integers are called coprimes if their GCD (greatest common divisor) is equal to 1.

### How to calculate if numbers are coprimes?

Two numbers are said to be coprime if the GCD (greatest common divisor) of these numbers is equal to 1. This definition can be extended to N numbers.

Example: GCD(4,6) = 2, then 4 and 6 are not coprimes.

Example: GCD (4,5,6) = 1 then 4, 5 and 6 are coprimes (even if 4 and 6 are not).

Example: GCD (7,12) = 1 then 7 and 12 are coprimes.

### How to find a coprime number with another?

dCode tests numbers depending on the prime factor decomposition of the first number (and therefore its divisors) to find coprime numbers. Then simply check that GCD equals 1 to confirm the number.