This problem explores the way that mathematical statements link together logically.
In the interactivity below, there are sixteen statements. Assuming that $n$ and $m$ are positive integers, can you sort them into eight pairs of statements?
In four of the pairs, the implication only works in one direction, whereas in the other four pairs, each statement implies the other.
If you want to work on this away from the computer, you can print out the statements.
Some cards can be linked in more than one way, for example the following statements are both true:
However there is only one way to arrange all 16 cards so that all 8 statements are simultaneously true. Can you show that there is only one way to do this?
What happens to the statement involving $n^3>5n$ if $n$ is not necessarily positive? Are any of the other statements affected if $n$ and $m$ are not necessarily positive?