1. **Define the pair (x,y):**
We start by choosing x such that x≥2. We then define y as:
y=xn+1−xn−1
This ensures that 1<x<y for any integer n>1.
2. **Calculate y+xn:**
y+xn=(xn+1−xn−1)+xn=xn+1−1
3. **Calculate x+yn:**
x+yn=x+(xn+1−xn−1)n
We need to show that xn+1−1 divides x+(xn+1−xn−1)n.
4. **Simplify (xn+1−xn−1)n:**
Let z=xn+1−xn−1. Then:
x+zn=x+(xn+1−xn−1)n
We need to show that xn+1−1 divides x+zn.
5. **Expand zn:**
zn=(xn+1−xn−1)n
Using the binomial theorem, we expand zn:
zn=k=0∑n(kn)(xn+1−xn)n−k(−1)k
Notice that each term in the expansion of zn is a multiple of xn+1−xn except for the constant term.
6. Simplify the expression:
x+zn=x+k=0∑n(kn)(xn+1−xn)n−k(−1)k
Since xn+1−xn is a factor in each term of the sum except for the constant term, we can write:
x+zn=x+(xn+1−xn−1)n=x+(xn+1−1−xn)n
7. Show divisibility:
We need to show that xn+1−1 divides x+(xn+1−1−xn)n. Notice that:
x+(xn+1−1−xn)n=x+(xn+1−1−xn)n
Since xn+1−1 is a factor of xn+1−1−xn, it follows that xn+1−1 divides x+(xn+1−1−xn)n.
8. Conclusion:
Therefore, for any integer n>1, there exist infinitely many pairs (x,y) of integers 1<x<y such that xn+y∣x+yn.
■