olymmath

OIM 2017 Problem 3

    Consider the configurations of integers a1,1a_{1,1} a2,1a2,2a_{2,1} a_{2,2} a3,1a3,2a3,3a_{3,1} a_{3,2} a_{3,3} ………\dots \dots \dots a2017,1a2017,2a2017,3…a2017,2017a_{2017,1} a_{2017,2} a_{2017,3} \dots a_{2017,2017} Where ai,j=ai+1,j+ai+1,j+1a_{i,j} = a_{i+1,j} + a_{i+1,j+1} for all i,ji,j such that 1≤j≤i≤20161 \leq j \leq i \leq 2016 . Determine the maximum amount of odd integers that such configuration can contain.

    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 ibero/2017/p3 · Tag 7GWK0CGSBT · Edit this page on GitHub · Keys: j next, k previous