The story of Blanche Descartes

  title={The story of Blanche Descartes},
  author={Cedric A. B. Smith and Stephen Abbott},
  journal={The Mathematical Gazette},
  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… 
2 Citations
“A Young Man’s Game”: Youth, Gender, Play, and Power in the Personae of Mid-Twentieth-Century Global Mathematics
  • M. Barany
  • Gender, Embodiment, and the History of the Scholarly Persona
  • 2021
Eminent English mathematician Godfrey Harold Hardy had neither the first nor the last word on what sort of person could be a mathematician and to whom the discipline belonged, but he certainly had
The Fascinating World of Graph Theory
An eye-opening journey into the world of graphs, this book offers exciting problem-solving possibilities for mathematics and beyond.


Some remarks on almost periodic transformations
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
The Dissection of Rectangles Into Squares
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
The number of ways of grading examination candidates
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
On Colouring the Nodes of a Network
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
Hymne to Hymen*
Graph Theory
1433. Gamma Function