olymmath

SE-SKOLORNAS 2008 Problem 4

    A convex nn -side polygon has angles v1,v2,…,vnv_1,v_2,\dots,v_n (in degrees), where all vkv_k ( k=1,2,…,nk = 1,2,\dots,n ) are positive integers divisible by 3636 . (a) Determine the largest nn for which this is possible. (b) Show that if n>5n>5 , two of the sides of the nn -polygon must be parallel.

    Dataset text AI-MO AoPS. Quoted with source.

    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 se-skolornas/2008/p4 · Tag VRZGRG6YV0 · Edit this page on GitHub · Keys: j next, k previous