olymmath

GULF 2017 Problem 2

    One country consists of islands A1,A2,⋯ ,ANA_1,A_2,\cdots,A_N ,The ministry of transport decided to build some bridges such that anyone will can travel by car from any of the islands A1,A2,⋯ ,ANA_1,A_2,\cdots,A_N to any another island by one or more of these bridges. For technical reasons the only bridges that can be built is between AiA_i and Ai+1A_{i+1} where i=1,2,⋯ ,N−1i = 1,2,\cdots,N-1 , and between AiA_i and ANA_N where i<Ni<N .

    We say that a plan to build some bridges is good if it is satisfies the above conditions , but when we remove any bridge it will not satisfy this conditions. We assume that there is aNa_N of good plans. Observe that a1=1a_1 = 1 (The only good plan is to not build any bridge) , and a2=1a_2 = 1 (We build one bridge).

    1-Prove that a3=3a_3 = 3 2-Draw at least 55 different good plans in the case that N=4N=4 and the islands are the vertices of a square 3-Compute a4a_4 4-Compute a6a_6 5-Prove that there is a positive integer ii such that 14381438 divides aia_i

    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 gulf/2017/p2 · Tag 9TN0K54M7K · Edit this page on GitHub · Keys: j next, k previous