It seems rather surprising that any given polynomial p(x) with nonnegative integer coefficients can be determined by just the two values p(1) and p(a), where a is any integer greater than p(1). This result has become known as the "perplexing polynomial puzzle." Here, we address the natural question of what might be required to determine a…

In this article, we explore the game based on the following problem from the 1st Mathematical Olympiad of Central America and the Caribbean, held in Costa Rica in 1999: Player A turns on the calculator, presses a digit key and then presses the + key. A second later, player B presses a digit key in the same row or column of the last digit key…

Presented are exercises that demonstrate the application of standard concepts in the design of algorithms for plotting certain fractals. The exercises can be used in any course that explains the concepts of bounded or unbounded planar sets and may serve as an application in a course on complex analysis. (KR)