|
|
 |
"Forensics" test |
|
The "forensics" algorithm was invented by Mike Sebastian to quickly provide a comparison of the accuracy of scientific calculators.
It is a matter of applying the following calculation and observing the result obtained:
arcsin(arccos(arctan(tan(cos(sin(9))))))
(See "Calculator Forensics" by Mike Sebastian)
But... the precision of the calculation (number of decimal places after the decimal point) will influence the final result...
|
|
|
 |
Factorial test |
|
Even for calculators with a "factorial" function, programs have been written to be able to compare these calculators with others.
|
|
|
 |
Stirling's formula |
|
The formula of Stirling allows to approximate the factorial of a number.
|
|
|
 |
"Fibonacci" test |
|
Finding the Fibonacci number of rank n.
|
|
|
 |
Binet's formula |
|
The formula of Binet provides the n-th term of the Fibonacci sequence.
|
|
|
 |
The circle |
|
Which program could apply to all programmable calculators ?
|
|
|
 |
Greatest Common Divisor |
|
One of the classic small programs of calculator programming...
|
|
|
 |
Birthday paradox |
|
The Birthday Paradox calculates the percentage chance of finding 2 people with the same birthday (not necessarily born in the same year) in a group of n people.
|
|
|
 |
Ramanujan's formula |
|
The Ramanujan formula allows to calculate the factorial of a number.
|
|
|
 |
PI Approximations |
|
Different methods can be used to calculate approximations of PI...
|
|
|
