Abstract
We consider the comic task of obtaining the number 100 from a six-digit bus ticket number by placing parentheses and symbols for arithmetic operations between some digits. The solution algorithm for a fixed number is reduced to enumerating all binary trees having exactly six terminal nodes with the signs of operations in internal nodes. For six-digit numbers that do not contain duplicate digits and the digit 0, the problem has a solution for all numbers except the only number 746189. It is impossible to obtain a hundred from this strange number 746189.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
