What is Tpp?
Tpp is a small silly little program for playing with primenumbers. You can use Tpp
to find random primes, test certain numbers, generate primes, benchmark
your machine and toast your bread.
What is a primenumber?
A primenumber is a number which can only be divided by itself or 1. F.ex 21 divided by 7 is 3, so
therefore it isn't a prime, 13 can only be divided by 13 or 1, so therefore it is a prime.
How silly is Tpp?
Very.
Can Tpp help me hack other people's accounts?
Not very likely, but if you find out how please let me know :)
Why doesn't Tpp run any faster on SMP system?
That's because Tpp does not use threads. Version 3.0 will have support for this though.
What are hyper- and palindrome primenumbers?
If you add up every digit in a primenumber and the result is a primenumber too, you've got a
hyperprime. F.ex 313 is a prime, and 3 + 1 + 3 = 7, which is also a prime.
If you reverse the digits in a primenumber and get a new prime, it's a palindromeprime. F.ex
30529 is a prime, and 92503 is a prime.
How do I use Tpp as a benchmarking tool?
Use the -B option when benchmarking. Tpp then finds every prime between 1 and 1 000 000 and finds
every hyper- and palindromeprime out of those.
F.ex time ./Tpp -B > /dev/null.
If you want your result listed (current list) send me the following data:
CPU model (such as Intel Pentium II 400MHz or Sun UltraSPARC II 296MHz)
RAM (whether your machine has got 32MB or 4GB RAM doesn't usually affect the result, but it
looks nice on the list :)
Operating system
Compiler (such as gcc, Sun's or DEC's own compilers)
Compiler options (usually defined on the Makefile)
And ofcourse, your result.
|