olymmath

DE-BUNDESWETTBEWERB 2010 Problem 6

  • Round 2

The sequence of numbers a1,a2,a3,...a_1, a_2, a_3, ... is defined recursively by a1=1,an+1=⌊a1+a2+...+an⌋a_1 = 1, a_{n + 1} = \lfloor \sqrt{a_1+a_2+...+a_n} \rfloor for n≥1n \ge 1 . Find all numbers that appear more than twice at this sequence.

Dataset text AI-MO AoPS. Quoted with source.

Official text: Bundeswettbewerb Mathematik 2010 official paper, page 1.

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 de-bundeswettbewerb/2010/p6 · Tag 756PGN3TA1 · Edit this page on GitHub · Keys: j next, k previous