This is the first article (in a series of three) dedicated to the many variants and variations of the so-called Freudenthal problem. The Freudenthal problem is a mathematical puzzle in which the reader deduces two secret integers from several rounds of communication between two persons. One person knows the sum of the two secret integers, while the other person knows the product. The current article surveys some of the most basic variants of the Freudenthal problem.
|Journal||Bulletin of the European Association for Theoretical Computer Science, EATCS|
|Publication status||Published - 2006|