olymmath

OMCPLP 2012 Problem 2

  • Day 1

Maria has a board of size n×nn \times n , initially with all the houses painted white. Maria decides to paint black some houses on the board, forming a mosaic, as shown in the figure below, as follows: she paints black all the houses from the edge of the board, and then leaves white the houses that have not yet been painted. Then she paints the houses on the edge of the next remaining board again black, and so on. a) Determine a value of nn so that the number of black houses equals 200200 . b) Determine the smallest value of nn so that the number of black houses is greater than 20122012 .

Attachments:

CPLP 12 p3.png

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 lusophon/2012/p2 · Tag 6923A1J3EB · Edit this page on GitHub · Keys: j next, k previous