Consider the sequence a(n) defined by the following conditions: a(1)=1a(n+1)=a(n)+[a(n)],n=1,2,3,...
Prove that the sequence contains an infinite number of perfect squares. (Note: [x] means the integer part of x, that is the greatest integer not greater than x.)(A Andjans) algebranumber theoryrecurrence relationfloor functionPerfect Square