The calculator takes a single input, which is an integer value. It then calculates all possible pairs of factors of the input integer and displays them as a list of tuples. Each tuple contains two factors that, when multiplied together, equal the input integer. For example, the factors of 12 are (1, 12), (2, 6), and (3, 4), and the calculator would display them as 1*12, 2*6, 3*4.
If an entered integer is a prime number, there will be only one pair of factors, the one multiplied by an entered integer.
Since integer factorization is done with the trial division method, I've limited entered integers by 100000. Otherwise, it would take too long.
- • Integer factorization. Trial division
- • Combinatorics – combinations, arrangements and permutations
- • The Greatest Common Divisor (GCD) and the Least Common Multiple (LCM) of several numbers
- • Permutations calculator
- • Combinatorics. Permutation generator from N to M with repetitions.
- • Combinatorics section ( 27 calculators )