Files to Download

Implicates the function CSVD in C, C++ and C#:

void CSVD(complex a[][maxA], int m, int n, int p, int nu, int nv, float *s, complex u[][maxA], complex v[][maxA])

Singular Value Decomposition, a = u * s * Conj(Tran(v)), a is destroyed by CSVD. The diagonal matrix s is output as a vector, m must be >= n, if smaller, a should be filled with zero rows. This code is adapted from Collected Algorithms from ACM, Algorithm 358. The transformation Conj(Tran(u)) is applied to the p vectors given in columns n, n+1, ..., n+p-1 of matrix a.

See: http://www.scs.fsu.edu/~burkardt/f77_src/toms358/toms358.f
and: http://www.scs.fsu.edu/~burkardt/f77_src/toms358/toms358_prb.f

The source and object files are included.

Algo358 in Borland C++ 5.2 EasyWin version - Algo358Ea.zip 101 KB Download
Algo358 in MS Visual Studio 2005 Single precision C++ Console version - Algo358Cf.zip 55.4 KB Download
Algo358 in MS Visual Studio 2005 Double precision C++ Console version - Algo358Da.zip 55.3 KB Download
Algo358 in MS Visual Studio 2005 C++ Forms version - Algo358Ff.zip 204 KB Download
Algo358 in MS Visual Studio 2005 C# Console version - Algo358Tc.zip 37.4 KB Download
Algo358 in MS Visual Studio 2005 C# Forms version - Algo358Se.zip 154 KB Download
Algo358 in Lcc-Win32 Double precision C Console version - Algo358LDa.zip 50.7 KB Download
Algo358 in Lcc-Win32 Single precision C Console version - Algo358LFa.zip 50.4 KB Download
Algo358 in Gcc-MinGW Double precision C Console version - Algo358GDa.zip 24.0 KB Download
Algo358 in Gcc-MinGW Single precision C Console version - Algo358GFa.zip 23.8 KB Download

See: LCC-Win32: A free compiler system for Windows Operating Systems by Jacob Navia.

Return to Matrix and Polynomial Computations

BBallx - Baseball Probability written in 8 different languages, Version 2.03

Computes the probability that the 1st place team will beat the 2nd place team for the division title, assuming each has a 50-50 chance of winning any given future game. Uses a bivariate binomial distribution as a model.

For the programs the inputs are:

GL1 = Games Left to play, 1st place team
GL2 = Games Left to play, 2nd place team
GE = Games to play each other
GA = Games ahead = 0, 0.5, ...

The outputs are:

MNT1 = Magic Number to tie for 1st place team
MNW1 = Magic Number to win for 1st place team
MNT2 = Magic Number to tie for 2nd place team
MNW2 = Magic Number to win for 2nd place team
P = Probability that 1st place team beats 2nd place team
Q = Probability that 2nd place team beats 1st place team
1/Q = 1 / Probability that 2nd place team beats 1st place team
Odds = P/Q : 1 (=1/Q - 1 : 1)

The source and object files are:

BBallP.Pas, BBallP.Exe : Pascal version
BBallC.C, BBallC.Exe : C version
BBallCpp.Cpp, BBallCpp.Exe : C++ version
BBallCpW.Cpp, BBallCpW.Exe : C++ for Windows version
BBallQ.BAS, BBallQ.Exe : QBASIC version
BBallB.BAS, BBallB.Exe : GWBASIC version
BBallF.FOR, BBallF.Exe : FORTRAN version
BBallA.Pkg, BBallA.Exe : ADA version

BBallx - BBALL203.ZIP 263 KB Download

Return to Baseball Pennant Race Odds

BBallVB - Baseball Probability, Visual Basic Windows Version 3.0

Computes the probability that the 1st place team will beat the 2nd place team for the division title, assuming each has a 50-50 chance of winning any given future game. Uses a bivariate binomial distribution as a model.

All Visual BASIC 6.0 source files are included.

BBallVB - BBALLVB3.ZIP 19 KB Download

Return to Baseball Pennant Race Odds

BBallCS - Baseball probability in Visual C# .net, Version 3.1

Computes the probability that the 1st place team will beat the 2nd place team for the division title, assuming each has a 50-50 chance of winning any given future game. Uses a bivariate binomial distribution as a model.

All C# source files are included.

BBallCS self-extracting install file - BBallCS31e.exe 311 KB Download
BBallCS zip archive install file - BBallCS31e.zip 292 KB Download
BBallCS self-extracting install file - BBallCS31e.exe 311 KB Download from Simtel
BBallCS self-extracting install file - BBallCS31e.exe 311 KB

Return to Baseball Pennant Race Odds

CRYP - A data encryption system, DOS and C# Versions

AUTHOR: Harry J. Smith

Keywords: Smith, DOS, C#, Decryption, Encrypt, Decrypt, Encode, Decode, Code, Protect, Scramble, Security
Type: Freeware

CRYP is a pseudo-infinite key data encryption system. A very fast and secure method of encrypting data files. Includes all source files for C, C# and Pascal versions of the program.

The algorithm for the Data Encryption Standard (DES) runs too slow on most computers, but simpler methods have not provided secure encryption. CRYP solves this problem by being both fast and secure. DES, though normally considered a very secure form of encryption, has a very complicated algorithm and runs very slow when implemented on a computer. CRYP attempts to be even more secure than DES by using a larger and more random key, and at the same time is reasonably fast.

DOS Versions - CRYP zip archive install file - CRYP60.ZIP 104 KB Download

C# Console Version - CrypC self-extracting install file - CrypC70b.exe 927 KB Download
C# Console Version - CrypC zip archive install file - CrypC70b.zip 1.70 MB Download
C# Console Version - CrypC self-extracting install file - CrypC70b.exe 927 KB Download from Simtel
C# Console Version - CrypC self-extracting install file - CrypC70b.exe 927 KB

C# Frames Version - CrypF self-extracting install file - CrypF70a.exe 1.23 MB Download
C# Frames Version - CrypF zip archive install file - CrypF70a.zip 2.09 MB Download
C# Frames Version - CrypF self-extracting install file - CrypF70a.exe 1.23 MB

Return to Data Encryption

Easter Dating Programs

These programs can compute Easter dating as follows:

• Dates of Western and Orthodox Easter, ordered by year
• Dates of Western Easter, ordered by date
• Frequency of Dates of Western Easter over 7600 years
• Frequency of Dates of Western Easter, over 5,700,000 years
• Dates of Orthodox Easter, ordered by date, given in the Gregorian Calendar
• Dates of Orthodox Easter, ordered by date, given in the Julian Calendar
• The C# version is more flexable and can even plot the results

All QuickBASIC source files are included in the DOS versions.
All C# source files are included in the C# versions.

DOS - Easter3.zip 55,887 Bytes Download

C# - EasterCS self-extracting install file - EasterCS21a.exe 0.98 MB Download
C# - EasterCS zip archive install file - EasterCS21a.zip 0.98 MB Download
C# - EasterCS self-extracting install file - EasterCS21a.exe 0.98 MB Download from Simtel
C# - EasterCS self-extracting install file - EasterCS21a.exe 0.98 MB

Return to Easter Dating Programs

Eigen - Computes Eigenvalues and Eigenvectors of a square complex matrix in C

These programs compute the Eigenvalues and Eigenvectors of a square complex matrix using singular value decomposition:

The source and object files are included.

Eigen in MS Visual Studio 2005 Double precision C++ Console version - EigenCDa.zip 67.3 KB Download
Eigen in MS Visual Studio 2005 Single precision C++ Console version - EigenCFa.zip 66.2 KB Download
Eigen in Lcc-Win32 Double precision C Console version - EigenLDa.zip 72.9 KB Download
Eigen in Lcc-Win32 Single precision C Console version - EigenLFa.zip 72.4 KB Download
Eigen in Gcc-MinGW Double precision C Console version - EigenGDa.zip 40.3 KB Download
Eigen in Gcc-MinGW Single precision C Console version - EigenGFa.zip 39.7 KB Download

See: LCC-Win32: A free compiler system for Windows Operating Systems by Jacob Navia.

Return to Matrix and Polynomial Computations

FlyAKite - A kite-flying program in C#

FlyAKite is a kite-flying program with the following features:

• Allows for flight data files input, edit, and update
• Displays flight data
• Can save all displayed data to a log file
• Allows for entering integration parameters
• Computes wind factors for flight data file
• Uses differential equations to solve for position and tension vectors as a function of arc length
• Uses Runge-Kutta method for integration of ordinary differential equations
• Plots string trajectory/profile on hires screen
• Plots analytical continuation of the string trajectory
• Allows for printer output of help file
• And more...

All C# source files are included.

May need to install .NET Framework Redistributable Package to run C# programs. Get it from Microsoft here.

FlyAKite self-extracting install file - FlyAKite20c.exe 889 KB Download
FlyAKite zip archive install file - FlyAKite20c.zip 953 KB Download
FlyAKite self-extracting install file - FlyAKite20c.exe 889 KB Download from Simtel
FlyAKite self-extracting install file - FlyAKite20c.exe 889 KB

Return to FlyAKite Program

Goldbach - Goldbach's Conjecture program files, C# Versions

This is a program for Windows that investigates Goldbach's Conjecture. Goldbach's Conjecture in Euler's form is:
Every even integer 2n >= 4 is the sum of two primes.

But for large n there appears to be many decompositions guaranteed.

This program computes terms for The On-Line Encyclopedia of Integer Sequences maintained by N. J. A. Sloane.
See: http://www.research.att.com/~njas/sequences/

The sequence generates is:
A135733 1,6,34,64,76,94,166,199,244,244,316,346,496,496,556,556,556,706,706,
724,724,859,1024,1024,1024,1024,1126,1336,1336,1468,1468,1468,1489,
1489,1489,1546,1609,1609,1636,1648,1816,1877,1877,2011,2029,2206,2224,...

For every integer m > a(n), 2m can be decomposed into at least n unordered sums of two primes. Goldbach's conjecture is equivalent to the case when n = 1, a(1) = 1, but for large n there appears to be many decompositions guaranteed. This sequence relies on a heuristic calculation and there is no proof that it is correct.

See: http://mathworld.wolfram.com/GoldbachConjecture.html

C# - Goldbach self-extracting install file - Goldbach31c.exe 361 KB Download
C# - Goldbach zip archive install file - Goldbach31c.zip 323 KB Download
C# - Latest results and restart files - GoldbachRes.zip 55.3 KB Download

Return to Goldbach's Conjecture

Joseph - The Flavius Josephus Permutation Problems, DOS and C# Versions

The General Problem: There is an ordered set of n objects arranged in a circle with object i (1 <= i <= n) in position i. All n objects are selected and removed in a certain order and placed in a new circle with the new position number k beings the order of selection. Object f is selected first. After each selection, m minus 1 of the remaining objects following the one removed are skipped and the next object is then selected. We are interested in the nature of the permutation generated by this process, its fixed elements, and in particular the original position L of the last object selected. Note that m and f can be as low as 1 and can be larger than n.

All Turbo Pascal source files are included in the DOS versions.
All C# source files are included in the C# versions.

DOS - JOSEPH - JOSEPH11.ZIP 156 KB Download

C# - JosephusCS self-extracting install file - JosephusCS21a.exe 0.97 MB Download
C# - JosephusCS zip archive install file - JosephusCS21a.zip 0.97 MB Download
C# - JosephusCS self-extracting install file - JosephusCS21a.exe 0.97 MB Download from Simtel
C# - JosephusCS self-extracting install file - JosephusCS21a.exe 0.97 MB

Return to Josephus Permutation Problems

JugglerW & JugglerC - Computes largest known Juggler number, Windows Versions

Juggler Sequence defined in Dr. Clifford A. Pickover's book "Computers and the Imagination." This book has scores of educational and recreational experiments that can be done on a personal computer.

At the end of Appendix C in this book you will find:

". . . An award of 50 dollars is offered by the publisher for a printout of the largest Juggler number computed by readers. The award will be given on or about September, 1993, and the sequence will also be published in the Juggernaut. Currently, the largest juggler number computed is a 45,391-digit giant for the starting number 30817. It was computed by Harry J. Smith using his own software package to perform multiple precision integer arithmetic. His package is written in the object-oriented programming language Turbo Pascal 5.5 by Borland International, Inc. His juggler package is a subset of his super-precision calculator software which computes transcendental functions to thousands of decimal places. Write him to obtain the software: Harry J. Smith, 19628 Via Monte Drive, Saratoga, CA 95070. . . ."

Juggler Sequence also defined in Nov 1990 issue of Algorithm in PERSONAL PROGRAMS by Clifford A. Pickover.

Pickover's definition of a juggler sequence:

    input positive integer, x
    repeat
      if x is even
        then x <-- [x^(1/2)]
        else x <-- [x^(3/2)]
    until x=1

All Borland C++ source files are included in JugglerW.
All C# source files are included in JugglerC.

Borland C++ Version - JugglerW zip archive install file - JUGGLE31.ZIP 268 KB Download

C# Console Version - JugglerC self-extracting install file - JugglerC41b.exe 526 KB Download
C# Console Version - JugglerC zip archive install file - JugglerC41b.zip 507 KB Download

PARI/GP Version - Jug2 zip archive - Jug2.zip 1.13 KB Download

also see:
Sequences A143742 on the Web!
Sequences A143743 on the Web!
Sequences A143744 on the Web!
Sequences A143745 on the Web! >>> b-file for A143745

Return to Juggler Numbers

Left-Tru - Computes all left-truncatable primes, Version 1.00

Left-Tru is a UBASIC DOS program to compute, sort, and output to a file all left-truncatable primes. There are 4260 of them.

A left-truncatable prime is a prime number (without the digit zero) that when you remove any of its left most decimal digit, it still represents a prime number (or no number at all if you remove all of the digits). 5167 is a left-truncatable because 5167, 167, 67, and 7 are all prime.

The output includes:

    I  LTP
    1  2
    2  3
    3  5
    . . .
    4258  95918918997653319693967
    4259  96686312646216567629137
    4260  357686312646216567629137

LEFT-TRU.UB - LEFT-TRU.ZIP 6.02 KB Download
LEFT-TRU.OUT - LEFT-OUT.ZIP 41.0 KB Download

Go to The On-Line Encyclopedia of Integer Sequences! sequences A132394 on the Web! >>> View PARI Program for this

also see:
Sequences A020994 on the Web! >>> View PARI Program for this
Sequences A024770 on the Web! >>> View PARI Program for this
Sequences A024785 on the Web! >>> View PARI Program for this
Sequences A033664 on the Web! >>> View PARI Program for this
Sequences A144714 on the Web! >>> View PARI Program for this

Return to Number Theory, Algorithms, and Real Functions

Perfect - Compute a perfect number from an input number q, Windows Version 1.00

Perfect is a MS Windows program to compute a perfect number from q, the exponent in a Mersenne prime M(q) = 2^q - 1. When q = 859433 the 517430-digit number is computed and stored on disk in about 5 minutes on a 33 MHz i486 machine.

A number is called perfect if it is equal to the sum of its divisors.
Six is perfect: 6 = 1 + 2 + 3.
28 is perfect: 28 = 1 + 2 + 4 + 7 + 14.

M(n) = 2^n - 1 is called a Mersenne number.
If M(q) = is prime then it is called a Mersenne prime and q will be prime also.
If q makes a Mersenne prime then P(q) = 2^(q-1) * (2^q - 1) is a Perfect number.

All Borland C++ source files are included.

Perfect - PERFECT1.ZIP 428 KB Download

Return to Perfect Numbers and Mersenne Primes

PiQP - Uses digit extraction scheme to produce hex digits of pi

This program employs the recently discovered digit extraction scheme to produce hex digits of pi. This code is valid up to ic = 2^24 on systems with IEEE arithmetic. Developed by Simon Plouffe, Peter Borwein and David Bailey in FORTRAN, converted to C++ using Borland C++ Version 4.0 by Harry J. Smith

PiQP - PiQP.zip 40.4 KB Download

Return to Computing Pi

PiW - Compute Pi to a million or so decimal places, Versions 1.31 and 1.32 for MS Windows

PiW is a program to compute pi to a million or so decimal places on an IBM compatible PC using Microsoft Windows for memory management. It is written in Borland C++ for Windows. With 16 megabytes of RAM it can compute pi to 524,200 decimal places. With 32 megabytes of RAM it can compute pi to 1,048,500 decimal places. All source code and documentation is included

PiW - piw131.zip 192 KB Download
PiW - PiW132.zip 223 KB Download
PiW - piw131.zip 192 KB Download from Simtel

Return to Computing Pi

PrimeFA - Multi-precision prime factor algorithm, Version 2.50 for DOS

Prime factors of Integers <= 5001 decimal digits (using 80387 coprocessor)
Some may take forever (over 300,000,000 years)

PrimeFA is a Multi-precision prime factor algorithm.
Developed in Turbo Pascal 5.0 and converted to 6.0
For factoring into primes, see Knuth, Vol. 2, Page 348
All source files are included.

PrimeFA - PRIMEF25.ZIP 74 KB Download

Return to Calculator Programs

PrimeSR - Andrica's Conjecture program files, Visual Basic and C# Versions

These are programs for Windows that investigates Andrica's Conjecture. Andrica's conjecture states that, for p_n the nth prime number, the inequality Af(n) = sqrt(p_n+1) - sqrt(p_n) < 1 for all n > 0.

PrimeSRvb is a Visual Basic version of the program (Version 3.6.23).
For Execution - PrimeSRvbRun36.zip 30 KB Download
For Development - PrimeSRvbDev36.zip 16 KB Download
QuickBASIC source files - PrimeSR.QB.zip 15 KB Download

C# - PrimeSRcs self-extracting install file - PrimeSRcs31b.exe 363 KB Download
C# - PrimeSRcs zip archive install file - PrimeSRcs31b.zip 324 KB Download
C# - Latest results and restart files - PrimeSRcsRes.zip 2.49 MB Download

Go to The On-Line Encyclopedia of Integer Sequences! sequences A084974 - A084977 on the Web!

Return to Andrica's Conjecture

RomanNum - Converts between Roman Numerals and Arabic Numbers, QuickBASIC and C++ Versions

These are programs for Windows that converts between Roman Numerals and Arabic Numbers. Source and executable files are included.

QuickBASIC - RomanNumBa.zip 25.2 KB Download

C++ - RomanNumCa.zip 45.8 KB Download

Return to Number Theory, Algorithms, and Real Functions

RPNMx - Reverse Polish Notation Multiple-precision calculators, Version 3.1 for DOS

The RPNM series of Calculators is a group of calculator programs that were produced by Harry Smith of Saratoga CA. These calculators are unusual in that they not only provide very extended precision arithmetic (numbers with several thousand digits), but they also permit the user to define the precision for the calculator (up to the limit of your particular system's memory). The ability to set the calculator's precision is desirable to control the speed of the calculations.

The calculators also utilize Reverse Polish Notation (RPN), thus the name of the series is RPNMx, for RPN Multiple precision; and x is used to distinguish between the different individual calculators of the series. There are currently three different calculators in the RPNMx series:

RPNMI - Integer
RPNMF - Floating point
RPNMS - Scientific

RPNMx - RPNM31.ZIP 195 KB Download
RPNMx - RPNM31.ZIP 195 KB Download from Simtel

Return to Calculator Programs

Super_PI For Windows (calculation of pi up to 33.55 million digits)

In August 1995, the calculation of pi up to 4,294,960,000 decimal digits was succeeded by using a supercomputer at the University of Tokyo. The program was written by D.Takahashi and he collaborated with Dr. Y.Kanada at the computer center, the University of Tokyo. This record should be the current world record. ( Details is shown in the windows help. ) This record-breaking program was ported to personal computer environment such as Windows NT and Windows 95. In order to calculate 33.55 million digits, it takes within 3 days with Pentium 90MHz, 40MB main memory and 340MB available storage. The software is free and the circulation of program is also free!

The current record is 1,241,100,000,000 Decimal Digits by Yasumasa Kanada & 9 man team in 2002/09

Super_PI - super_pi.zip 71.4 KB Download

Download Super_Pi from - ftp://pi.super-computing.org/windows/super_pi.zip

Go to - Super_PI ftp server

Return to Computing Pi

VPCalcDos - Variable Precision floating decimal calculator, Version 2.40 for DOS

VPCalcDos is a calculator program with the following features:

• Variable precision to thousands of decimal places
• Transcendental functions
• Hyperbolic functions
• Greatest Common Divisor function
• Boolean functions
• Random number generator
• Algebraic notation (not reverse polish)
• If-then-else statement
• Goto statement
• Can run VPCalc code from file
• Hot Help from F1 key
• Written in Object-Oriented Turbo Pascal 5.5/6.0
• Recommended by Dr. Clifford A. Pickover's in his books COMPUTERS AND THE IMAGINATION page 380, and MAZES FOR THE MIND pages 388 and 412.

VPCalcDos - vpcalc24b.zip 143 KB Download
VPCalcDos - vpcalc24.zip 138 KB Download from Simtel (old version)
VPCalcDos - vpcalc24b.zip 143 KB Download from Simtel

Return to Calculator Programs

XICalc - Extra Precision Integer Calculator, C# Version

XICalc is a freeware 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
• and more ... . All C# source files and documentation included

C# - XICalc self-extracting install file - XICalc32t.exe 1.16 MB Download
C# - XICalc zip archive install file - XICalc32t.zip 1.24 MB Download
C# - XICalc self-extracting install file - XICalc32t.exe 1.16 MB Download from Simtel
C# - XICalc self-extracting install file - XICalc32t.exe 1.16 MB

Return to Calculator Programs
Return Number Theory, Algorithms, and Real Functions

XPCalc - Extra Precision Floating-Point Calculator, C# Version

XPCalc is a freeware calculator program with the following features:

• Extra precision to millions of decimal places
• Uses Fast Hartley Transform to speed-up long multiplies
• Separate input and output notation, base 2 to base 36
• Efficient Transcendental functions
• Hyperbolic functions
• Greatest Common Divisor function
• Modulo arithmetic options
• Bernoulli numbers, Euler numbers, Euler's constant
• Boolean functions, Gamma and Psi functions
• Random number generator
• Can compute Pi to 67.1 million decimal digits
• Algebraic notation (not reverse polish)
• If-then-else statement
• Goto statement
• Can run XPCalc code from files
• Hot Help from F1 key
• Written in Microsoft Visual C# .NET 2005 for Windows
• Recommended by Dr. Clifford A. Pickover's in his books COMPUTERS AND THE IMAGINATION page 380, and MAZES FOR THE MIND pages 388 and 412.
• and more ... . All C# source files and documentation included

C# - XPCalc self-extracting install file - XPCalc32t.exe 2.38 MB Download
C# - XPCalc zip archive install file - XPCalc32t.zip 2.73 MB Download
C# - XPCalc self-extracting install file - XPCalc32t.exe 2.38 MB Download from Simtel
C# - XPCalc self-extracting install file - XPCalc32t.exe 2.38 MB

Return to Computing Pi
Return to Calculator Programs
Return Number Theory, Algorithms, and Real Functions

XCCalc - Extra Precision Floating-Point Complex Calculator, C# Version

XCCalc is a freeware calculator program with the following features:

• Can calculate with complex numbers like z = x + i*y
• Extra precision complex numbers to millions of decimal places
• Uses Fast Hartley Transform to speed-up long multiplies
• Separate input and output notation, base 2 to base 36
• Efficient Transcendental functions
• Hyperbolic functions
• Greatest Common Divisor function
• Modulo arithmetic options
• Bernoulli numbers, Euler numbers, Euler's constant
• Boolean functions, Gamma and Psi functions
• Random number generator
• Can compute Pi to 67.1 million decimal digits
• Algebraic notation (not reverse polish)
• If-then-else statement
• Goto statement
• Can run XCCalc code from files
• Hot Help from F1 key
• Written in Microsoft Visual C# .NET 2005 for Windows
• and more ... . All C# source files and documentation included

C# - XCCalc self-extracting install file - XCCalc32t.exe 2.38 MB Download
C# - XCCalc zip archive install file - XCCalc32t.zip 2.61 MB Download
C# - XCCalc self-extracting install file - XCCalc32t.exe 2.38 MB Download from Simtel
C# - XCCalc self-extracting install file - XCCalc32t.exe 2.38 MB

Return to Calculator Programs
Return to Complex Computations

XJCalc - Extra Precision Integer Matrix Calculator, C# Version

XJCalc is a freeware calculator program with the following features:

• Can calculate with integer matrices and integer scalars
• 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 XJCalc code from files
• Hot Help from F1 key
• Written in Microsoft Visual C# .NET 2005 for Windows
• and more ... . All C# source files and documentation included

C# - XJCalc self-extracting install file - XJCalc32t.exe 1.21 MB Download
C# - XJCalc zip archive install file - XJCalc32t.zip 1.33 MB Download
C# - XJCalc self-extracting install file - XJCalc32t.exe 1.21 MB Download from Simtel
C# - XJCalc self-extracting install file - XJCalc32t.exe 1.21 MB

Return to Calculator Programs

XMCalc - Extra Precision Floating-Point Matrix Calculator, C# Version

XMCalc is a freeware calculator program with the following features:

• Can calculate with real matrices, real scalars and quaternions
• Extra precision complex numbers to millions of decimal places
• Uses Fast Hartley Transform to speed-up long multiplies
• Separate input and output notation, base 2 to base 36
• Efficient Transcendental functions
• Hyperbolic functions
• Greatest Common Divisor function
• Modulo arithmetic options
• Bernoulli numbers, Euler numbers, Euler's constant
• Boolean functions, Gamma and Psi functions
• Random number generator
• Can compute Pi to 67.1 million decimal digits
• Algebraic notation (not reverse polish)
• If-then-else statement
• Goto statement
• Can run XMCalc code from files
• Hot Help from F1 key
• Written in Microsoft Visual C# .NET 2005 for Windows
• and more ... . All C# source files and documentation included

C# - XMCalc self-extracting install file - XMCalc32t.exe 2.42 MB Download
C# - XMCalc zip archive install file - XMCalc32t.zip 2.66 MB Download
C# - XMCalc self-extracting install file - XMCalc32t.exe 2.42 MB Download from Simtel
C# - XMCalc self-extracting install file - XMCalc32t.exe 2.42 MB

Return to Calculator Programs
Return to Matrix and Polynomial Computations

XZCalc - Extra Precision Complex Matrix Calculator, C# Version

XZCalc is a freeware calculator program with the following features:

• Can calculate with quaternions, complex matrices and scalars
• Extra precision complex numbers to millions of decimal places
• Uses Fast Hartley Transform to speed-up long multiplies
• Separate input and output notation, base 2 to base 36
• Efficient Transcendental functions
• Hyperbolic functions
• Greatest Common Divisor function
• Modulo arithmetic options
• Bernoulli numbers, Euler numbers, Euler's constant
• Boolean functions, Gamma and Psi functions
• Random number generator
• Can compute Pi to 67.1 million decimal digits
• Algebraic notation (not reverse polish)
• If-then-else statement
• Goto statement
• Can run XZCalc code from files
• Hot Help from F1 key
• Written in Microsoft Visual C# .NET 2005 for Windows
• and more ... . All C# source files and documentation included

C# - XZCalc self-extracting install file - XZCalc32t.exe 2.52 MB Download
C# - XZCalc zip archive install file - XZCalc32t.zip 2.83 MB Download
C# - XZCalc self-extracting install file - XZCalc32t.exe 2.52 MB Download from Simtel
C# - XZCalc self-extracting install file - XZCalc32t.exe 2.52 MB

Return to Calculator Programs
Return to Matrix and Polynomial Computations

XYPlotCS - A program to test plotting in C#

This programs can do X-Y plots in a Windows Form:

• Plots sine and cosine curves to test plotting
• Plots sin(x) and cos(x) vs. x and sin(x) vs. cos(x)
• Allows for changing start and stop values for X
• Can display an About form

All C# source files are included.

XYPlotCS20b.zip 89,319 Bytes Download

Return to Harry's Home Page

This page hosted by
Get your own Free Home Page