Let and be sequences such that and
for . I want to show that there is no common terms when . In other words, there are no such that .
I encountered this problem when tried to make an olympiad-like problem. So I am not sure it is true, but I have checked it with computer for . (Since I am not a good coder, I can't make sure that it does not have an error such as overflow. Sorry...)
Is there any strategy to solve these kind of problems? If there is, and if you gave me just a hint or a related concept