Главная / Калькуляторы / Разложение на простые

Разложение на простые (с шагами пробного деления)

Введите целое n (|n| ≥ 2), чтобы увидеть все шаги деления, τ(n), σ(n), φ(n) и дерево разложения. Необязательное m сравнит показатели и даст gcd/lcm.

Другие языки: ja | en | zh-CN | es

Inputs

Integers are parsed exactly (BigInt). Use a second integer to compare exponents for gcd/lcm.

Digits with an optional leading minus sign. |n| must be at least 2.

If supplied, the tool factors m, builds an exponent table, and shows gcd(n, m) and lcm(n, m).

Factor tree

For education only. Trial division up to 6k ± 1 is fast for classroom-sized integers (≈10¹³).

FAQ

What integers can this tool factor?

Enter any integer with |n| ≥ 2. Very large values are supported, but the division steps may take longer to finish.

How is the factor tree drawn?

Each composite node splits by its smallest prime factor until every leaf is prime. The tree updates automatically after each calculation.

Похожие калькуляторы