olymmath

SIMON-MARAIS 2020 B4

  • Paper B

The following problem is open in the sense that no solution is currently known to part (b). A proof of part (a) will be awarded 3 points.

Let n≥2n \geq 2 be an integer, and let PnP_n be a regular polygon with n2−n+1n^2 - n + 1 vertices. We say that nn is taut if it is possible to choose nn of the vertices of PnP_n such that the pairwise distances between the chosen vertices are all distinct.

(a) Show that if n−1n - 1 is prime then nn is taut.

(b) Which integers n≥2n \geq 2 are taut?

Official text Simon Marais Mathematics Competition 2020 official paper, page 2. Quoted with source.

A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator simon-marais/2020/b4 · Tag YES9X6N1FE · Edit this page on GitHub · Keys: j next, k previous