We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Online ordering will be unavailable from 17:00 GMT on Friday, April 25 until 17:00 GMT on Sunday, April 27 due to maintenance. We apologise for the inconvenience.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The general utility of the ‘pigeon hole principle’ (that if n + 1 pigeons are placed in n boxes one of the boxes contains more than one pigeon!) is neatly illustrated by the problem of showing that:
If seven darts land on a dartboard in any configuration whatsoever, there will always be two darts which are not more than a distance of one radius apart.
A persistent problem of the mathematics teacher is the motivation of students especially those not particularly interested in numerical work. In this paper we present a notational device for analysing relationships based on binary notation and show its application to the problem of incest. The authors developed this theory in the course of their study of the rabbinic law on this subject and present this application here, though it could be applied to any legal system. It is hoped that the use of this approach may be useful to introduce mathematical modes of thought to previously uninterested pupils.
In this article several combinatorial problems are posed for the partitioning of certain plane figures. The solutions are obtained by means of Euler’s formula for plane graphs or networks, V - E + R = 1, where V is the number of vertices, E is the number of edges, and R is the number of bounded regions of the figure. Being unified by the common thread of Euler’s formula, the sequence of problems forms an interesting unit on solving related problems.
At the time of writing, second class stamps cost 12p and first class 17p. To minimise the amount of change in my pocket I have a preference for buying these stamps in ratios that cost a whole number of pounds.
The impossibility of a prime number formula seems to have entered the mathematical mythology. As I am continually challenged nonetheless to produce such formulae I thought I would invent some elementary ones. To put them in context I’ll first discuss some classic, and some quite recent, results.
How refreshing to read C. D. Collinson’s [1] article in the March 1986 Gazette on the importance of stressing approximations in teaching mechanics. Once students get over their initial scepticism that mechanics has anything to do with the real world, I too find an enthusiastic response from classes invited to contribute their ideas on the sort of approximations and assumptions which have to be made to model a physical situation. Approximations and assumptions are fundamental to the art of mathematical modelling in mechanics and cause more difficulties to students than is often realised; class discussions reveal that many of the problems which students have with mechanics are related to approximations, and such discussions can also bring out some unsuspected fundamental misconceptions. One such misconception, related to approximations, is discussed here and the proposed method of clarification includes developing a little more Collinson’s use of “the linear approximation”.
Graphical Interference can be attractive and it can be disturbing. We might want to live with it or we might want to avoid it, and in this article we see that elementary geometry suffices to analyse the phenomenon so that we can control it as we wish.