Abstract
This short note starts with some personal words to Jaco de Bakker. They are followed by two problems in recreational mathematics about the length of reduction paths, consisting of partitions of some natural number n. One of these problems came up in an attempt to prove the famous conjecture P = NP. Solutions are given in the Appendix.
Original language | English |
---|---|
Title of host publication | Centrum voor Wiskunde en Informatica (2002) |
Publisher | University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science |
Pages | 175-178 |
Number of pages | 4 |
Publication status | Published - 2002 |