# The story of Blanche Descartes

@article{Smith2003TheSO, title={The story of Blanche Descartes}, author={Cedric A. B. Smith and Stephen Abbott}, journal={The Mathematical Gazette}, year={2003}, volume={87}, pages={23 - 33} }

Recently a poem, written by Blanche Descartes in the 1930s, was republished in the Gazette, with the additional attribution ‘communicated via Cedric A. B. Smith’. Cedric had reported ‘it was written after Blanche heard that Hector Pétard was about to be married. She composed the verse as a wedding present. Hector is still active mathematically, though I suspect that he may be in his mid nineties’. We felt that readers might be interested to know something about the mysterious Blanche Descartes… Expand

#### 2 Citations

The Fascinating World of Graph Theory

- Computer Science
- 2015

An eye-opening journey into the world of graphs, this book offers exciting problem-solving possibilities for mathematics and beyond. Expand

#### References

SHOWING 1-10 OF 12 REFERENCES

Some remarks on almost periodic transformations

- Mathematics
- 1945

1. Recurrent and almost periodic transformations. Notations. Let ƒ be a continuous mapping (not necessarily a homeomorphism) of a topological space X in itself (that is, f(X)QX). We say that ƒ is… Expand

The Dissection of Rectangles Into Squares

- Mathematics
- 1940

We consider the problem of dividing a rectangle into a finite number of non-overlapping squares, no two of which are equal. A dissection of a rectangle R into a finite number n of non-overlapping… Expand

The number of ways of grading examination candidates

- Psychology
- The Mathematical Gazette
- 2003

Candidates are graded by their examination results in some such way as 1st B; 2nd equal A, D; 4th equal C, E; and so on. In how many ways gn can n candidates be graded? This problem was solved by… Expand

On Colouring the Nodes of a Network

- Mathematics
- 1941

Let N be a network (or linear graph) such that at each node not more than n lines meet (where n > 2), and no line has both ends at the same node. Suppose also that no connected component of N is an… Expand