olymmath

HMMT 2002 U63

  • Guts
  • Answer

Our third and final item comes to us from Germany, I mean Geometry. It is known that a regular nn-gon can be constructed with straightedge and compass if nn is a prime that is 1 plus a power of 2 . It is also possible to construct a 2n2 n-gon whenever an nn-gon is constructible, or a p1p2⋯pmp_{1} p_{2} \cdots p_{m}-gon where the pip_{i} 's are distinct primes of the above form. What is really interesting is that these conditions, together with the fact that we can construct a square, is that they give us all constructible regular nn-gons. What is the largest nn less than 4,300,000,0004,300,000,000 such that a regular nn-gon is constructible?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

4294967296

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 hmmt/2002/u63 · Tag MG1JHHAVYK · Edit this page on GitHub · Keys: j next, k previous