Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Proof of impossibility  





2 References  





3 See also  














Three cups problem






Македонски
Українська


 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


The standard, unsolvable, arrangement of the three cups. Here, cups A and C are upright and B is upside down.
The solvable version of the problem. Here, cups A and C are upside down, and cup B is upright.

The three cups problem, also known as the three cup challenge and other variants, is a mathematical puzzle that, in its most common form, cannot be solved.

In the beginning position of the problem, one cup is upside-down and the other two are right-side up. The objective is to turn all cups right-side up in no more than six moves, turning over exactly two cups at each move.

The solvable (but trivial) version of this puzzle begins with one cup right-side up and two cups upside-down. To solve the puzzle in a single move, turn up the two cups that are upside down — after which all three cups are facing up. As a magic trick, a magician can perform the solvable version in a convoluted way, and then ask an audience member to solve the unsolvable version.[1]

Proof of impossibility[edit]

To see that the problem is insolvable (when starting with just one cup upside down), it suffices to concentrate on the number of cups the wrong way up. Denoting this number by , the goal of the problem is to change from 1 to 0, i.e. by . The problem is insolvable because any move changes by an even number. Since a move inverts two cups and each inversion changes by (if the cup was the right way up) or (otherwise), a move changes by the sum of two odd numbers, which is even, completing the proof.

Another way of looking is that, at the start, 2 cups are in the "right" orientation and 1 is "wrong". Changing 1 right cup and 1 wrong cup, the situation remains the same. Changing 2 right cups results in a situation with 3 wrong cups, after which the next move restores the original status of 1 wrong cup. Thus, any number of moves results in a situation either with 3 wrongs or with 1 wrong, and never with 0 wrongs.

More generally, this argument shows that for any number of cups, it is impossible to reduce to 0 if it is initially odd. On the other hand, if is even, inverting cups two at a time will eventually result in equaling 0.

References[edit]

  1. ^ Lane, Mike (2012). Close-Up Magic. The Rosen Publishing Group, Inc. ISBN 9781615335152.

See also[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=Three_cups_problem&oldid=1228954630"

Categories: 
Magic tricks
Unsolvable puzzles
Hidden categories: 
Articles needing additional references from May 2024
All articles needing additional references
 



This page was last edited on 14 June 2024, at 02:39 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki