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!

This page is using the new English version of dCode, please make comments !

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

Answers to Questions

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.

Ask a new question

Source code

dCode retains ownership of the source code of the script Coprimes. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, etc.) which dCode owns rights can be transferred after sales quote. So if you need to download the Coprimes script for offline use, for you, your company or association, see you on contact page !

dCode uses cookies to customize the site content, analyze user behavior and adapt dCode to your use. Some data is stored and collected for advertising purposes and may be shared with our partners. OK