In ancient India, a boy named Bhagat travels to the Rajah's city, hoping to ensure his family's prosperity by winning a place at court as a singer. Bhagat carries his family's entire fortune--a single coin and a chain of seven golden rings--to pay for his lodging. But when the innkeeper demands one ring per night, and every link snipped costs one coin, how can Bhagat both break the chain and avoid overpaying? His inventive solution points the way to an unexpected triumph, and offers readers a friendly lesson in binary numbers--the root of all computing.