System and method for faster division

A system for reducing central processing unit usage when dividing numbers, the system comprising:

• one or more processing devices and
• one or more storage devices storing instructions that, when executed by the one or more processing devices, cause the one or more processing devices to:
• receive at least two division operations to compute, consisting of at least four numbers, two numerators and two denominators;
• build a binary tree from the bottom up, the binary tree including parent and child nodes, a bottom level of the binary tree containing child nodes with values corresponding to the denominator numbers, other child nodes containing values of a product of a combination of the denominator numbers, and a root node, having a value of the product of all denominator numbers;
• invert the root node's value and assign the inverted value to the root node;
• traverse the binary tree, starting at one level below the root node, in the traversal for each node computing a new value for the node by multiplying the node's current value with the node's parent value and swapping node values to obtain node values at the bottom level of the binary tree corresponding to inverses of the denominator numbers;
• and
• multiple each bottom node value which is an inverse of one of the denominators with the denominator's corresponding numerator;
• output results for each multiplication as final quotients of the at least two division operations.

A non-transitory computer-readable medium having stored therein computer executable code that causes one or more processors to execute the steps of:

• receiving at least two division operations to compute, consisting of at least four numbers, two numerators and two denominators;
• building a binary tree from the bottom up, the binary tree including parent and child nodes, a bottom level of the binary tree containing child nodes with values corresponding to the denominator numbers, other child nodes containing values of a product of a combination of the denominator numbers, and a root node having a value of the product of all denominator numbers;
• inverting the root node's value and assigning the inverted value to the root node;
• traversing the binary tree starting at one level below the root node, in the traversal of each node, computing a new value for the node by multiplying the nod's current value with the node's parent value and swapping node values to obtain node values at the bottom level of the binary tree corresponding to inverses of the denominator numbers;
• and
• multiplying each bottom node value which is an inverse of one of the denominators with the denominator's corresponding numerator;
• outputting results for each multiplication as final quotients of the at least two division operations.