Abstract
This chapter doesn’t revolve around brave civil servants or the Big Easy. Or for that matter, any other group sent out to collect snails and for whom these little creepers turn out to be a tad too fast. No, no, quite the opposite; in this chapter, we’d like to demonstrate that these creatures are actually not that slow and can, under certain circumstances, challenge a racehorse. We need only to make one change to the location where a snail is typically found: It sits on a rubber band that is pulled by a racehorse.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Herrmann, N. (2012). The Snail–Racehorse Problem. In: The Beauty of Everyday Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22104-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-22104-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22103-3
Online ISBN: 978-3-642-22104-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)