XICalc is an integer calculator program with the following features:
- Multiple precision integers with millions of digits
- Uses Fast Hartley Transform to speed-up long multiplies
- Uses Binary Splitting to speed-up computing factorials
- Separate input and output notation, base 2 to base 36
- Greatest Common Divisor function
- Modulo arithmetic options
- Bernoulli numbers, Euler Numbers
- Boolean functions
- Random number generator
- Prime factor algorithm using the Elliptic Curve Method
- Number theoretic functions Phi, Sigma and Tau
- Prime testing and searching using the Adleman function
- Algebraic notation (not reverse polish)
- If-then-else statement
- Goto statement
- Can run XICalc code from files
- Hot Help from F1 key
- Written in Microsoft Visual C# .NET 2005 for Windows

All of the source is included in the distributed file.
Please let me know what you think about this program.
-Harry hjsmithh@sbcglobal.net

• CFB Primes 2.0
  CFB Primes is an optimised PalmOS program which can find the prime factors and closest primes of any integer number up to one billion (US) in a few seconds or less. The standard...

• Prime Number Spiral 8.59
  The Prime Number Spiral (a

• MatheHP 2.46
  Program MatheHP contains calculators for integer, rational, real and complex numbers with high precision (up to 144 digits with point numbers, 616 with integer numbers). You can also solve algebraic equations with up to 8 th degree and linear...

• Prime Number Spiral 6.5
  The Prime Number Spiral (a

• Prime Integer Observatory 1.0
  This application illustrates the notion of an integer?s factors, and of the related property of integers called primeness, or primality. An integer is called prime if it is the product of only one distinct pair of integers. For example, 11 is prime because the only pair of integers whose product equals 11 is 1 and 11, as in 1*11 = 11 .

• Math Miscellanea 1.00
  Finds the prime factors of positive integers, solves triangles and circles problems, manipulates complex numbers, does base conversions

• Primes 1.4
  calculates the prime numbers 1..N, tells you if N is prime etc. Prints tables of primes. Computes the prime just below or above N. It is useful in computing optimal Hashtable sizes. Java source included.