You should be able to solve this...

No.14396630 ViewReplyOriginalReport
(...but let's be real you're all dumb as shit)

Start with a set of at least two positive integers (repetition allowed). At each step remove two integers and replace them with their gcd and lcm. Prove that for any set of integers and any sequence of steps the set of numbers eventually stops changing.