Asynchronous High Precision Numerical Evaluation This app is still a work in progress. Note that energy and memory consumption can grow rapidly. Please read instructions carefully. Numerical Evaluation with complete precision. Compute rational values with complete precision and irrational values with unlimited precision. NumEval lets you compute high precision values with no limits, except the power of your machine. Notable features include: -finding exact results for roots when they exists -computing high precision values for roots and then improving precision of values by using periodic continued fractions -logarithms with more precision -trigonometry functions with more precision -finding prime factors or determining primality of numbers -highly optimised binary modulo NumEval lets you set configuration for internal algorithms so you can configure to optimise precision or performance. These configurations can be imperative for feasible computation. Truncate fractions length must be greater than root fraction, otherwise infinite loops occur. function example $logarithm{64, 8} wil give the result 2 you can also type mathematical statements for example: (2+(1/2)) / 3 Numerical Evaluation functions: $larger_total term_a: numeric value, term_b: numeric value $trigonometry_radian value: nuermic value cot_precise: 0 or 1 crd_precise: 0 or 1 $sine $cosine $arctan $arccot $arccos $arcsin: value: numeric value $prime_factors_new $prime_factors_alt $list_divisors value: numeric integer $digit_sum value: numeric integer $bit_shift $bit_shift_right value: numeric value (base 10 or base 2) places: to shift (integer) change_base: $change_base: value: integer new_base: integer less than or equal to 10 old_base: integer less than or equal to 10 $execute_binary_modulus $binary_division $binary_and: $binary_or: value: base 2 integer divider: base 2 integer $modulus: value: integer modulus_value: integer $perfect_power: value: numeric value $gcd a: numeric integer b: numeric integer $shorten_value: value: numeric value $coprime: a: integer b: integer $modexp: $mod_add: $mod_mult: a: integer b: intger c: integer $prime value: integer closest_known_prime (optional): default is 0 weak: default value is 1 $power: value: numeric value power: numeric value (use fractions for roots) $root value: numeric integer root: numeric integer $root_fraction (for direct approximation of irration value without attempting to find rational root) value: numeric value root: numeric value $find_continued_fraction value: numeric integer power: numeric integer $detect_period_continued_fraction continued_fraction: array of integers $resolve_continued_fraction continued_fraction: array of integers value: numeric value (apprxoimate value of result) $is_binary_power: value: integer $binary_multiplication: value: integer in base 2 multiplier: integer in base 2 $binary_addition value: integer in base 2 multiplier: integer in base 2 $binary_subtraction value: integer in base 2 multiplier: integer in base 2 $execute_divide value: numeric value divider: numeric value $floor term_a: numeric value $ceil term_a: numeric value $round term_a: numeric value $permutations: for example: $permutations{1, 2, 3} terms $combinations terms $factorial term_a: numeric integer $logarithm term_a: numeric value base: numeric value (default value is 2.0) $natural_logarithm term_a: numeric value $next_rational_root term_a: numeric integer set_power: numeric integer $list_rational_roots from: integer index to: integer index set_power: numeric integer The application is fully asynchronous and uses concurrency for calculating numerical values of statements. To find high precision values for roots: -compute value with fractional power -find periodic continued fraction for root and value -if periodic continued fraction exists run resolve continued fraction function with approximate root value as input the result will be a highly precise value with negligible error