Lesson plan
Pyjama problem
In mathematics, the pyjama problem asks whether the plane can be covered by a finite number of rotated copies of a repeating pattern of stripes ("pyjama stripes"), no matter how thin the stripes are. The problem was posed in 2006 by Alex Iosevich, Mihail Kolountzakis, and Máté Matolcsi. It was answered in the affirmative by Freddie Manners in 2015, using an analogy with Furstenberg’s ×2, ×3 Theorem.
Article summary
In mathematics, the pyjama problem asks whether the plane can be covered by a finite number of rotated copies of a repeating pattern of stripes ("pyjama stripes"), no matter how thin the stripes are. The problem was posed in 2006 by Alex Iosevich, Mihail Kolountzakis, and Máté Matolcsi. It was answered in the affirmative by Freddie Manners in 2015, using an analogy with Furstenberg’s ×2, ×3 Theorem.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.