Flashcards
2021-10-14
For a journey where you get back to the beginning (a “tour”), what must be true about every move made??
It must have a corresponding opposite; i.e. a forward must have a backward and an up must have a down.
If every move has to have an opposite for a tour, why are $n \times n$ where $n$ is odd not possible??
There must be an odd total number of moves $n^2$ and it’s impossible for an odd number to come in pairs.
When thinking about traversal questions like this one, what is it good to consider??
If moves must come in pairs, or there is some relation between current moves and future ones.
Backlinks
Metadata
date: 2021-10-14 18:43
summary: how can you go round an (n x n) square?
tags:
- '@?public'
- '@?mat'
- '@?notes'
- '@?maths'
title: MAT - Paper 2009 - Q5
