Hi, everyone! I have a exciting puzzle here:
"A conjurer invites a audience on stage. Then the conjurer goes to the tormentor and his partner then asks the audience to write a series of numbers on a board. He(the partner) erases 2 adjacent numbers in that series. Then, the conjurer come back to the stage and try to guess which numbers are erased.
Find the least length of the series of numbers to the conjurer always guesses correctly?"
Let's discuss about this puzzle. I haven't solved it yet.