Sequence Puzzle
Let a1,a2,a3,…. be the sequence of positive integers, such that each integer occurs exactly once. Prove that there exists 1<m<n , such that a1+an=2am
Please confirm you want to block this member.
You will no longer be able to:
Please note: This action will also remove this member from your connections and send a report to the site admin. Please allow a few minutes for this process to complete.