Arrangements, sorting, packing, partitions, critical path analysis, networks, graphs, ...
2 posts • Page 1 of 1
Hello everyone. So (full disclosure) my class's discrete structures teacher gave the class a riddle- find a list that contains a different number of prefixes than suffixes. Unfortunately, nobody is able to think of an example. It seems intuitive that every list of size n contains exactly n prefixes and n suffixes (or n + 1 if we include the empty set), and I cannot think of a single list that this isn't true for. Any ideas?