A short introduction Cookie policy

We Prove To You:
      All Our Puzzles Are Interesting!

Let S be the set of uninteresting puzzles on our site:

Assume that S is not empty:
This means that there are some uninteresting puzzles on our site.
Then there also exists one least interesting puzzle.
Let P (member of S) be this least interesting puzzle:
Then we would be very interested to know which puzzle P is.
This makes P a very interesting puzzle!
However, we assumed that P was uninteresting (member of S).
This leads to a contradiction!
This means that S can only be empty!

Conclusion: all puzzles on our site are interesting!

Another proof: our awards and visitors' reactions.

back to the main puzzle page
Copyright © 1996-2020. RJE-productions. All rights reserved. No part of this website may be published, in any form or by any means, without the prior permission of the authors.
This website uses cookies. By further use of this website, or by clicking on 'Continue', you give permission for the use of cookies. If you want more information, look at our cookie policy.