Swiss-German English Dictionary App

Our main project is the Swiss-German English Dictionary app which is available on the Apple App Store and on Google Play. It is a comprehensive dictionary for English to Swiss-German and vice versa with audio for all entries.

Download on the App Store Get it on Google Play

Schweizerdeutsch Wörterbuch App

Ebenso gibt es ein Schweizerdeutsch Hochdeutsch Wörterbuch auf dem Apple App Store und auf Google Play. Dies ist ebenfalls ein umfangreiches Wörterbuch für Hochdeutsch - Schweizerdeutsch um umgekehrt wobei alle Einträge vertont sind.

Download on the App Store Get it on Google Play

iPhone and iPad Apps

On this site you find also information- and help pages for various other iPhone and iPad apps such as BetterBrain, iDungeon, iAltairHD or the Tinnitus Music Player.

Download on the App Store

AltairZ80 Simulator

There are download pages for the AltairZ80 simulator which works on Windows, Macintosh, Linux and Zaurus. Also there is a rich collection of operating systems including CP/M, programming languages such as Basic, C, Pascal, and application programs (e.g. WordStar and MultiPlan) ready to run on the simulator.

XYZ GeoBench

Download the XYZ GeoBench for Macintosh including Object Pascal source code. The GeoBench is an interactive system featuring algorithm animation for geometric computation.

Other Interests

You can find pictures and information about our travels on Verena's home page. If you are interested in Swiss German (Schweizerdeutsch) have a look at www.schweizerdeutsch.info.

And if you are looking for a beautiful village in Wallis you should visit Oberwald.

Prime Proof

Proof of Peter Schorn: Assume there exist only m prime numbers.

Let n = m + 1. For two numbers i and j with 1 ≤ i < jn, then

gcd[ (n!) i + 1, (n!) j + 1 ] = 1.

Indeed, j = i + d, with 1 ≤ d < n, so

gcd[ (n!) i + 1, (n!) j + 1 ] = gcd[ (n!) i + 1, (n!) d ] = 1.

Therefore the n integers (n!) i + 1 (for i = 1, 2, …, n) are pairwise relatively prime. If pi is a prime dividing (n!) i + 1, then p1, p2, …, pn are distinct primes with n = m + 1, which is a contradiction. [Paulo Ribenboim, The New Book of Prime Number Records, p. 5, Springer-Verlag 1996, 3rd edition].



The DBLP Computer Science Bibliography


This website is intended for use by humans. Therefore the content of this site may not be used for any machine learning (ML) or similar purposes without written consent. Such use requires the explicit consent by Peter Schorn. See also AI.TXT (Spawning) and tdmrep.json (TDM Reservation Protocol (TDMRep)).

Valid XHTML 1.0 Transitional