Four kids and their sidekick, Petey the parrot, run a sometimes thriving lemonade stand whose patrons include all kinds of wacky neighbors—even a juggler. They create a bar graph to track the rise and fall of their lemonade sales. Illustrator Tricia Tusa has imbued the story with her delightful sense of humor and has made understanding bar graphs a breeze.
Learn to graph while following the growth of T.J., an orphaned Siberian tiger cub who is hand-raised at the Denver Zoo. T.J. is a Siberian tiger cub born at the Denver Zoo. One day he stops eating. The zoo staff tries to tempt him with treats, but he refuses them all. The staff doesn't give up, and finally their love and persistence pay off. T.J. grows up to be a huge, healthy tiger. The delightful pictures of T.J. and the heartwarming story of his life will charm young readers as they learn the basic math skills of graphing in Tiger Math by Ann Whitehead Nagda and Cindy Bickel. Those who like storybooks can read just the right-hand pages of this book. But those who want to know more can use the graphs on the left-hand pages to see exactly how T.J. grew.
NEW YORK TIMES bestselling author Greg Tang takes on the times tables, teaching kids innovative ways to multiply numbers and derive answers WITHOUT memorization. Four is very fast to do when you multiply by 2.Here's a little good advice --please just always double twice!BEST OF TIMES gives kids an intuitive understanding of multiplication, encouraging them to arrive at answers on their own rather than memorizing the times tables. A child who can multiply by two, for instance, can multiply by four and even eight! Likewise, times six builds on times two and times three.With his common-sense approach, Greg Tang encourages kids to solve problems creatively, building both their skills and their confidence.
Tally McNally is an alley cat who loves to tally! He keeps track of all sorts of contests—who wins the most races, who is the tallest, who can climb the most trees, and more. When the results are counted up, Tally is always the winner. One rainy day, Tally competes to become the “wettest cat.” But he goes too far and gets into a jam. Will his friends—who lose to him tally after tally—find a way to save him?
There are many distinct pleasures associated with computer programming. Craftsmanship has its quiet rewards, the satisfaction that comes from building a useful object and making it work. Excitement arrives with the flash of insight that cracks a previously intractable problem. The spiritual quest for elegance can turn the hacker into an artist. There are pleasures in parsimony, in squeezing the last drop of performance out of clever algorithms and tight coding. The games, puzzles, and challenges of problems from international programming competitions are a great way to experience these pleasures while improving your algorithmic and coding skills. This book contains over 100 problems that have appeared in previous programming contests, along with discussions of the theory and ideas necessary to attack them. Instant online grading for all of these problems is available from two WWW robot judging sites. Combining this book with a judge gives an exciting new way to challenge and improve your programming skills. This book can be used for self-study, for teaching innovative courses in algorithms and programming, and in training for international competition. The problems in this book have been selected from over 1,000 programming problems at the Universidad de Valladolid online judge. The judge has ruled on well over one million submissions from 27,000 registered users around the world to date. We have taken only the best of the best, the most fun, exciting, and interesting problems available.
The O'Malleys are off to the beach! But it's a long, hot, boring drive. What can Eric, Bridget, and Nell do to keep busy? Play tally games, of course -- counting up all the gray cars or green T-shirts they see. Whoever has the most marks at the end wins the game. Eric wins the first game. Bridget wins the second. It seems like poor Nell will never win a game! But Nell has the luck of the Irish on her side, and a surprise in store for her big brother and sister.
What's your favorite part of the school day? Come along to a warm, friendly world of reading and writing, singing and painting, and all-around fun that will make you want to yell, "I love school!"
Reports of the death of reading are greatly exaggerated Do you worry that you've lost patience for anything longer than a tweet? If so, you're not alone. Digital-age pundits warn that as our appetite for books dwindles, so too do the virtues in which printed, bound objects once trained us: the willpower to focus on a sustained argument, the curiosity to look beyond the day's news, the willingness to be alone. The shelves of the world's great libraries, though, tell a more complicated story. Examining the wear and tear on the books that they contain, English professor Leah Price finds scant evidence that a golden age of reading ever existed. From the dawn of mass literacy to the invention of the paperback, most readers already skimmed and multitasked. Print-era doctors even forbade the very same silent absorption now recommended as a cure for electronic addictions. The evidence that books are dying proves even scarcer. In encounters with librarians, booksellers and activists who are reinventing old ways of reading, Price offers fresh hope to bibliophiles and literature lovers alike. Winner of the Phi Beta Kappa Christian Gauss Award, 2020
This unique approach to combinatorics is centered around unconventional, essay-type combinatorial examples, followed by a number of carefully selected, challenging problems and extensive discussions of their solutions. Topics encompass permutations and combinations, binomial coefficients and their applications, bijections, inclusions and exclusions, and generating functions. Each chapter features fully-worked problems, including many from Olympiads and other competitions, as well as a number of problems original to the authors; at the end of each chapter are further exercises to reinforce understanding, encourage creativity, and build a repertory of problem-solving techniques. The authors' previous text, "102 Combinatorial Problems," makes a fine companion volume to the present work, which is ideal for Olympiad participants and coaches, advanced high school students, undergraduates, and college instructors. The book's unusual problems and examples will interest seasoned mathematicians as well. "A Path to Combinatorics for Undergraduates" is a lively introduction not only to combinatorics, but to mathematical ingenuity, rigor, and the joy of solving puzzles.
