CoprimeQ

Disponible

Tests if two integers are coprime.

Formes

CoprimeQ[n1, n2]

CoprimeQ[n1, n2, …]

Exemples vérifiésCoprimeQ[3, 5] → True CoprimeQ[6, 9] → False CoprimeQ[14, 15] → True CoprimeQ[1 + 2 I, 2 + I] → True

Exécuter sur Qurak Rechercher dans la référence

Thèmes

Integer Functions - Division-Related Functions
New In60 Alphabetical Listing - C
New In60 Mathematics And Algorithms - New in Number Theory & Integer Functions »
New In60 Number Theory And Integer Functions - New Divisibility-Related Functions
Number Theoretic Functions - Divisibility
Prime Numbers - Primality Testing

Connexes

GCD Divisible Mod PrimeQ CompositeQ FactorInteger EulerPhi Prime ChineseRemainder EvenQ KroneckerSymbol LCM

Les 6300 fonctions · Utiliser ceci depuis un client MCP