This browser-based utility rewrites an integer as a sum of several smaller integers and prints the additive decomposition in the output. You can specify the number of addends in the sum and the number of sums in the options. You can also change the order of the terms, customize the plus sign symbol, and the sum separator and surrounding characters. Created by math nerds from team Browserling.
This browser-based utility rewrites an integer as a sum of several smaller integers and prints the additive decomposition in the output. You can specify the number of addends in the sum and the number of sums in the options. You can also change the order of the terms, customize the plus sign symbol, and the sum separator and surrounding characters. Created by math nerds from team Browserling.
With this online application, you can express an integer as a sum of two or more other positive values. For example, the integer 10 can be written using two terms as 4 + 6, using three terms as 5 + 3 + 2, using four terms as 1 + 4 + 2 + 3, or more terms. The decomposition 4 + 6 is considered to be the same as 6 + 4 because addition is commutative. You can specify the number of addends that need to go in the sum, as well as choose if the integer 0 should be used as an addend. If the zero addend is disabled, then the integer n can be decomposed into a sum that has strictly from 1 to n addends (in case of n addends, they are all 1's). If you allow the use of the zero, then it can consist of any number of addends as you can add as many zeros to an integer as you want and it won't change its value. The larger the input integer, the more integer partitions there are. For example, the integer 12 can be rewritten as a sum of 3 summands in 19 different ways and the integer 120 can be represented as 1238 unique sums. To make sure you get quick results and the output isn't too long, we have limited the output to 100 sums. You can increase or decrease this count in the options. By default, the summands are displayed from the smallest to the largest (for example, 1 + 1 + 2 + 8) but you can change their order in the options and print them from the largest to the smallest (for example, 8 + 2 + 1 + 1) or even in random order (for example, 1 + 8 + 2 + 1). You can also change the "+" sign to any other symbol, print the sums one after another (and not in a column), separate them with custom symbols, and also surround the sums with custom open and close symbols so that the output could immediately be used in Python or JavaScript programming languages. For example, if the open and close symbols are "(" and ")", and the summands are separated by commas, you will get tuples such as "(1, 1, 2, 8)". Integerabulous!
With this online application, you can express an integer as a sum of two or more other positive values. For example, the integer 10 can be written using two terms as 4 + 6, using three terms as 5 + 3 + 2, using four terms as 1 + 4 + 2 + 3, or more terms. The decomposition 4 + 6 is considered to be the same as 6 + 4 because addition is commutative. You can specify the number of addends that need to go in the sum, as well as choose if the integer 0 should be used as an addend. If the zero addend is disabled, then the integer n can be decomposed into a sum that has strictly from 1 to n addends (in case of n addends, they are all 1's). If you allow the use of the zero, then it can consist of any number of addends as you can add as many zeros to an integer as you want and it won't change its value. The larger the input integer, the more integer partitions there are. For example, the integer 12 can be rewritten as a sum of 3 summands in 19 different ways and the integer 120 can be represented as 1238 unique sums. To make sure you get quick results and the output isn't too long, we have limited the output to 100 sums. You can increase or decrease this count in the options. By default, the summands are displayed from the smallest to the largest (for example, 1 + 1 + 2 + 8) but you can change their order in the options and print them from the largest to the smallest (for example, 8 + 2 + 1 + 1) or even in random order (for example, 1 + 8 + 2 + 1). You can also change the "+" sign to any other symbol, print the sums one after another (and not in a column), separate them with custom symbols, and also surround the sums with custom open and close symbols so that the output could immediately be used in Python or JavaScript programming languages. For example, if the open and close symbols are "(" and ")", and the summands are separated by commas, you will get tuples such as "(1, 1, 2, 8)". Integerabulous!
In this example, we expand the integer 9 into a sum of three other integers, including the zero integer. It turns out that for this input integer there are twelve unique three-term sums. We print them one per line and display the summands in increasing order and place the regular plus symbol "+" between them.
In this example, we disallow the use of zero-summand and generate all possible commutatively-unique sum combinations of the integer 12. Without using a zero, the number of partitions is 11, while using a zero, it would have reached 58. We replace the plus sign with the colon character and output all terms in decreasing order. We make the output comma-separated that prints all sums on the same line and enclose each sum in a pair of curly brackets.
In this example, we split the integer 100 into random sums with eight addends. There are more than one million partitions for this input specification and it's too large to compute. To quickly get usable results, we have limited the output to just 15 values. They are printed in a vertical column as the sum separator symbol is set to "\n".
In this example, we enter a huge integer equal to nine billion and decompose it into sums of four terms. We limit the number of sums in the output to six, as there are nearly infinitely many of them and it would take a very long time to calculate them all. The sums are randomly generated each time when you click on the example and in each case, adding all the terms together produces 9,000,000,000.
In this example, the number of addends is greater than the input integer. In order to produce 8 terms that add up to the integer 6, some of the addends must be equal to 0. To allow this condition, we have enabled the "Include Zero" option, which creates two or more redundant zero terms in the sums. We print the sums in parentheses, separate terms by the comma character, and place zeros at the beginning of sums.
You can pass input to this tool via ?input query argument and it will automatically compute output. Here's how to type it in your browser's address bar. Click to try!
Create a drawing that visualizes von Neumann hierarchy of sets.
Create a sudoku puzzle.
Create a list of neat-looking integers (called magic integers).
Generate a list of tuples of integers with n elements.
Quickly convert integers to base one.
Quickly convert base one to integers.
Quickly convert integers to base two.
Quickly convert base two to integers.
Quickly convert integers to base eight.
Quickly convert base eight to integers.
Quickly convert integers to base sixteen.
Quickly convert base sixteen to integers.
Quickly encode integers to base-64.
Quickly decode base-64 to integers.
Quickly convert integers to a custom base.
Quickly encode integers to HTML encoding.
Quickly decode HTML entities to integers.
Quickly encode integers to URL (percent) encoding.
Quickly decode URL-encoded integers.
Quickly convert a signed integer to an unsigned integer.
Quickly convert an unsigned integer to a signed integer.
Generate a list of random integers.
Check if the given integers are palindromes.
Create a matrix whose entries are all integers.
Create a vector with integer coefficients.
Quickly calculate the average value of integers.
Quickly calculate the average value of integer digits.
Quickly randomly select a digit from an integer.
Find which of the given integers is the biggest or smallest.
Limit integer values to a range.
Limit integer digit values to a range.
Create multiple copies of the input integers.
Create multiple copies of digits of input integers.
Rotate the digits of an integer to the left or right.
Move the digits of an integer to the left or right.
Quickly find the difference of a bunch of integers.
Quickly apply the bitwise AND operation to integers.
Quickly apply the bitwise OR operation to integers.
Quickly apply the bitwise XOR operation to integers.
Quickly apply the bitwise NOT operation to integers.
Quickly apply the bitwise NAND operation to integers.
Quickly apply the bitwise NOR operation to integers.
Quickly apply the bitwise NXOR operation to integers.
Quickly divide two or more integers.
Quickly divide the digits of an integer.
Add -st, -nd, -rd, -th suffixes to integers to make them ordinals.
Remove -st, -nd, -rd, -th suffixes from ordinals to make them ints.
Find integers that match a filter (greater, less, equal).
Add padding to integers on the left side.
Add padding to integers on the right side.
Position all integers so that they align on the right.
Position all integers so that they align in the middle.
Turn all integers into positive integers.
Turn all integers into negative integers.
Rewrite an integer in fractional form.
Extract the numerator and denominator from a fraction.
Search for all occurrences of an integer and replace it.
Create a regex that matches the given integers.
Create integers that match the given regular expression.
Create relatively tiny integers.
Create relatively huge integers.
Create a sequence of oscillating integers, such as 123212321.
Create multiple integer sequences at once.
Slightly change an integer so it has an error.
Slightly change integer digits so there are errors.
Apply fuzzing to integers and add perturbations.
Apply fuzzing to integer digits and add digit perturbations.
Add highlighting to certain integers.
Add highlighting to certain integer digits.
Add color to integers based on a condition.
Add color to individual digits in the given integers.
Quickly assign colors to integers and draw them as pixels.
Quickly assign integer values to pixel colors and print them.
Make the digits of an integer go in a spiral shape.
Make the digits of an integer go in a circle.
Make the digits of an integer go in a diamond shape.
Fill a box with certain width and height with digits.
Use ASCII art to convert integers to 2-dimensional drawings.
Use ASCII art to convert integers to 3-dimensional drawings.
Decompose an integer into ones, tens, hundreds, etc.
Generate an ordered list of increasing integers.
Generate an ordered list of decreasing integers.
Quickly find various information about the given integers.
Find hidden patterns of numbers in integers.
Find the Shannon entropy of an integer.
Subscribe to our updates. We'll let you know when we release new tools, features, and organize online workshops.
Enter your email here
We're Browserling — a friendly and fun cross-browser testing company powered by alien technology. At Browserling our mission is to make people's lives easier, so we created this collection of integer tools. Our tools have the simplest user interface that doesn't require advanced computer skills and they are used by millions of people every month. Our integer tools are actually powered by our programming tools that we created over the last couple of years. Check them out!
