FactorInteger

Tersedia

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

Bentuk

FactorInteger[n]

FactorInteger[n, k]

Contoh terverifikasiFactorInteger[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}}

Jalankan ini di Qurak Cari di referensi

Topik

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

Terkait

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

Semua 6300 fungsi · Pakai ini dari klien MCP