updated January 12, 2021

user: webuser log off

News
Mathematics
Computing
Technology
Education

[2006-07-11]


[2006-07-11]

High-Precision Arithmetic - Calculation of Euler's Number e to Arbitrary Number of Significant Digits

Following is an implementation in C++ of a high-precision arithmetic programme for the calculation of Euler's number to an arbirary number of significant digits. The programme can be run in parallel on any number of networked compute nodes that can be logged on to with a single account sharing the same home drive (e.g., an NFS share) across all compute nodes. This programme does not require parallel computing libraries such as MPI, nor is it dependent on OpenMP-aware compilers.

Save the link in the left pane as a .tar.bz2 (UNIX tar bzip2 archive) file, decompress using `tar xfj` and make using GNU or Intel C++ compilers. See more info commented in the source files....display full article text



[2006-07-10]


[2006-07-10]

Generalised "Tower of Hanoi" Problem

The following programme implements three methods of solving the "generalised" Tower of Hanoi problem. This problem, like the classical one, consists in finding the optimal sequence of moves for transfering a number of disks between two posts, the only difference in the generalised setting is that the number of posts can be arbitrary.

Save the link in the left pane as a .tar.bz2 (UNIX tar bzip2 archive) file, decompress using `tar xfj` and make using GNU or Intel C++ compilers. See more info commented in the source files....display full article text



BACK TO TOP OF THE ARTICLE LIST...

(C) 2006-2021 Musa Maharramov PRIVACY NOTICE AND CONTACT DETAILS