CoprimeQ

Verfügbar

Tests if two integers are coprime.

Formen

CoprimeQ[n1, n2]

CoprimeQ[n1, n2, …]

Verifizierte BeispieleCoprimeQ[3, 5] → True CoprimeQ[6, 9] → False CoprimeQ[14, 15] → True CoprimeQ[1 + 2 I, 2 + I] → True

Auf Qurak ausführen Referenz durchsuchen

Themen

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

Verwandt

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

Alle 6300 Funktionen · Dies aus einem MCP-Client verwenden