I have an answer to this question: https://web2.0calc.com/questions/interesting-question_7
The answer is yes; we proceed by induction:
First, note that we must have {xn}+1xn=1 is encompassed by the more general statement xn+1xn∈Z, which we will prove. We have our base case(s) x+1x∈Z and x0+1x0=2∈Z.
Suppose that xk+1xk∈Z and xk−1+1xk−1∈Z. We multiply xk+1xk by x+1x to get
(xk+1xk)(x+1x)=(xk+1+1xk+1)+(xk−1+1xk−1)
Note that the LHS is an integer, so xk+1+1xk+1 is an integer as well, and we are done.
It seems like you've provided a proof by induction for the statement that if n and n+1 are encompassed by the conditions of the problem, then n2+n is also encompassed by the conditions.
Your provided proof outline appears to be correct. You've established the base case for n=1 and n=2, and then you assumed that the statement holds for n and n+1 and proved that it holds for n2+n as well. This indeed proves that if the conditions are satisfied for n and n+1, then they are satisfied for n2+n as well.
The logic you've presented follows the structure of a valid proof by induction. Well done! If you have any further questions or need clarification, feel free to ask.