MathDB
nice BWM sequence problem

Source: Bundeswettbewerb 1985, stage 1, problem 3

May 18, 2004
inductionalgebra solvedalgebra

Problem Statement

Starting with the sequence F1=(1,2,3,4,)F_1 = (1,2,3,4, \ldots) of the natural numbers further sequences are generated as follows: Fn+1F_{n+1} is created from FnF_n by the following rule: the order of elements remains unchanged, the elements from FnF_n which are divisible by nn are increased by 1 and the other elements from FnF_n remain unchanged. Example: F2=(2,3,4,5)F_2 = (2,3,4,5 \ldots) and F3=(3,3,5,5,)F_3 = (3,3,5,5, \ldots). Determine all natural numbers nn such that exactly the first n1n-1 elements of FnF_n take the value n.n.