Reduction steps in partitions

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

95 Downloads (Pure)

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 languageEnglish
Title of host publicationCentrum voor Wiskunde en Informatica (2002)
PublisherUniversity of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science
Pages175-178
Number of pages4
Publication statusPublished - 2002

Fingerprint

Dive into the research topics of 'Reduction steps in partitions'. Together they form a unique fingerprint.

Cite this