mat 2025 Q26X(v)

mat · Uk 4 marks Combinations & Selection Geometric Combinatorics

For $n \geq 2$, an $n$-loop is a sequence of $n$ distinct points with each point connected to the next in sequence with a straight line segment, and with the last connected to the first with a straight line segment. For which values of $n \geq 4$ does the new diagram described in part (iv) contain at least one $n$-loop? Justify your answer.

For $n \geq 2$, an $n$-loop is a sequence of $n$ distinct points with each point connected to the next in sequence with a straight line segment, and with the last connected to the first with a straight line segment.
For which values of $n \geq 4$ does the new diagram described in part (iv) contain at least one $n$-loop? Justify your answer.

Paper Questions

Q26X(i) Q26X(ii) Q26X(iii) Q26X(iv) Q26X(v) Q26Y(i)(a) Q26Y(i)(b) Q26Y(ii) Q26Y(iii) Q26Y(iv) Q26Y(v) Q26Y(vi) Q27X(i) Q27X(ii) Q27X(iii) Q27X(iv) Q27X(v) Q27Y(i) Q27Y(ii) Q27Y(iii) Q27Y(iv) Q27Y(v) Q27Y(vi)