FactorInteger

利用可能

Returns the prime factorization as {prime, exponent} pairs.

形式

FactorInteger[n]

FactorInteger[n, k]

検証済みの例FactorInteger[60] → {{2, 2}, {3, 1}, {5, 1}}FactorInteger[100] → {{2, 2}, {5, 2}}FactorInteger[17] → {{17, 1}}FactorInteger[2^128 - 1] → {{3, 1}, {5, 1}, {17, 1}, {257, 1}, {641, 1}, {65537, 1}, {274177, 1}, {6700417, 1}, {67280421310721, 1}}

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

トピック

Algebraic Number Theory - Factorization
Cryptographic Number Theory - Cryptanalysis
Cryptography - Cryptographic Number Theory »
Integer Functions - Integer Decompositions
Mathematical Functions - Number Theoretic Functions »
New In60 Number Theory And Integer Functions - New in Primes & Factorization

関連

PrimeNu PrimeOmega IntegerExponent Prime PrimeQ PrimePowerQ SquareFreeQ CoprimeQ Divisors GCD Factor EulerPhi

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