Big Integer Number Theory Tool

Tool for big integer calculations. Arbitrarily large integers can be used, and results can be arbitrarily large. Menu options allow initial limit of 5000 digits to be increased.

For example 2^11213-1 can be calculated by first calculating 2^11213, then subtracting 1.

Please note this is a tool for big number nerds. It is not a handy calculator for working out percents or solving quadratics, and it doesn't have trigonometric functions. This tool is mainly for extremely large numbers which may or may not have intriguing characteristics, such as being fake square roots of 1 to a certain modulus. Fake square roots of 1 are hard to check on a normal calculator, and that's where this tool has the edge.

Prime factors of an integer can be calculated. For example, 2^67 - 1 can be found by finding 2^67, then subtracting 1. Pressing the prime factor button will then search for factors of this number (in the case of this number, "Cole's number", the Pollards Rho depth will have to be increased using the menu, but the app can find the two factors).

Modular arithmetic is supported.

The calculator uses built-in java methods and calculations are fast.

All calculations performed are stored in a list so previous answers can be seen and used in further calculations. Calculations can be copied to the clipboard, or shared directly.

Brackets and multiple operation calculations are not supported at this stage.

</div> <div jsname="WJz9Hc" style="display:none">对于大整数计算工具。任意大的整数可以被使用，并且结果可以任意大。菜单选项允许增加5000位初始上限。

例如2 ^ 11213-1可以通过首先计算2 ^ 11213，然后减去1来计算。

请注意，这是大数目书呆子的工具。它不是一个方便的计算器，用于制定百分数或解决二次方程式，并且它不具有三角函数。这个工具主要是针对其可以或可以不具有令人感兴趣的特性，如被假冒平方根1到一定模量非常大的数字。假平方根1是很难检查正常的计算器，而这也正是该工具有优势。

的整数的素因子可以计算出来。例如，2 ^ 67 - 1可以通过寻找2 ^ 67，然后减去1.按质因数按钮然后搜索该多个因素（在这个数，“科尔的数目”，该Pollards的Rho的情况下找到深度将不得不使用菜单来增加，但该应用可以找到两个因素）。

支持模块化运算。

计算器使用内置的Java方法和计算速度快。

执行的所有计算都存储在一个列表中，这样以前的答案可以看到和在进一步的计算中使用。计算可以被复制到剪贴板，或者直接共享。

支架和多种业务的计算不支持在这个阶段。</div> <div class="show-more-end">