Divisors and Multiples Calculator

Introduction

The arithmetic structure of a positive integer $n$ can be examined by identifying its divisors, determining its prime factorisation, and evaluating related number-theoretic functions such as Euler's totient $φ (n)$ . These quantities describe the multiplicative behaviour of the integer and provide a basis for analysing its factor composition and associated numerical properties.

What this calculator does

Displays a comprehensive breakdown of a user-defined integer $n$ and a specified limit $k$ for multiples. It identifies all factors and proper divisors, determines prime factorisation, and calculates the abundancy index. The output includes classification as prime or composite, the radical of the number, the unitary divisors, and the initial terms of the aliquot sequence, providing a detailed numerical profile.

Formula used

Euler's totient function $φ (n)$ is determined using the product formula based on distinct prime factors $p$ . The abundancy index is the ratio of the sum of divisors $σ (n)$ to the value $n$ . Harmonic mean $H$ is calculated using the count of divisors $τ (n)$ and their sum.

φ (n) = n \prod (1 - \frac{1}{p})

H = \frac{n \times τ (n)}{σ (n)}

How to use this calculator

1. Enter a positive whole number $n$ up to 1,000,000.
2. Specify the number of multiples $k$ to be displayed.
3. Select the preferred number of decimal places for the output display.
4. Execute the calculation to view the divisors, factorisation, and number theory metrics.

Example calculation

Scenario: Analysing the divisor structure and abundancy of a small composite integer to determine its classification within a number theory research project.

Inputs: Number $n = 12$ ; Multiples $k = 1$ .

Working:

Step 1: $σ (12) = 1 + 2 + 3 + 4 + 6 + 12$

Step 2: $σ (12) = 28$

Step 3: $Proper Sum = 28 - 12$

Step 4: $16 > 12$

Result: Abundant Number.

Interpretation: Since the sum of proper divisors (16) exceeds the number itself (12), it is classified as abundant.

Summary: The integer 12 is a composite, abundant number with six total divisors.

Understanding the result

The results categorise the number based on its divisors. An abundancy index greater than 2 indicates an abundant number, while exactly 2 signifies a perfect number. The Euler's totient value reveals the count of integers up to $n$ that share no common factors with it other than 1.

Assumptions and limitations

The calculator assumes the input is a positive integer within the educational limit of 1,000,000. Calculations involving the aliquot sequence are limited to five iterations to maintain computational efficiency and prevent infinite loops in periodic sequences.

Common mistakes to avoid

A common error is confusing proper divisors, which exclude the number itself, with the total set of divisors. Users should also ensure that decimal place settings are appropriate for the required precision when viewing the harmonic mean or abundancy index values.

Sensitivity and robustness

The calculation is discrete and stable; however, the number of divisors $τ (n)$ is highly sensitive to the prime factorisation of $n$ . Highly composite numbers will produce significantly larger divisor sets and sum totals compared to prime numbers of a similar magnitude.

Troubleshooting

If an error appears, verify that the input is a whole number between 1 and 1,000,000. Results for the aliquot sequence may terminate early if the values exceed 2,000,000 or if a cycle is detected, which is standard behaviour to ensure stability.

Frequently asked questions

What is a unitary divisor?

It is a divisor $d$ of $n$ such that the greatest common divisor of $d$ and $n / d$ is 1.

How is the radical of a number defined?

The radical is the product of the distinct prime factors of the integer $n$ .

What defines an Ore number?

An Ore number, or harmonic divisor number, is an integer whose divisors have a harmonic mean that results in a whole number.

Where this calculation is used

This type of analysis is fundamental in number theory for studying the distribution of prime numbers and the properties of multiplicative functions. In algebraic studies, identifying divisors and prime factors is essential for simplifying expressions and understanding modular arithmetic. Academic research into perfect numbers and aliquot sequences relies on these basic integer properties to explore deeper conjectures. Mathematical modelling often uses Euler's totient function in the study of cyclic groups and encryption algorithms.

Results are based on standard mathematical and statistical methods and may involve rounding or approximation. If precise accuracy is required, please verify results independently. See full disclaimer.