A problem from a mathematical olympiad

142 Views Asked by At

John chose $100$ distinct positive integers and wrote all the $4950$ pairwise sums. How many of them could be exact powers of $3$?

I tried to look at it in $\mod 3$ and $\mod 9$. When there are $4$ numbers the answer is $3$. I have an example for $99$ and no other ideas.