CoprimeQ

利用可能

Tests if two integers are coprime.

形式

CoprimeQ[n1, n2]

CoprimeQ[n1, n2, …]

検証済みの例CoprimeQ[3, 5] → True CoprimeQ[6, 9] → False CoprimeQ[14, 15] → True CoprimeQ[1 + 2 I, 2 + I] → True

Qurakで実行リファレンスを検索

トピック

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

関連

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

全 6300 関数 · MCPクライアントから使う