In [1] and [2] we demonstrated how Pascal-like triangles arose from the probabilities associated with the various outcomes of a particular game (see Definition 1 below). It was also shown that they could be considered as generalisations of Pascal's triangle. In this article we show how Fibonacci-like sequences arise from our Pascal-like triangles, and demonstrate the existence of simple relationships between these Fibonacci-like sequences and the Fibonacci sequence itself. In addition we will investigate a generalisation of the binomial coefficients that appears when considering an extended version of the game. We start by describing this game.

[This is part of a lecture delivered at the Annual Conference of the Association on 31st March 1967. It contains an elementary teaching approach to matrices.]

Let us look at this diagram and consider what it might depict. It might be a map of airline routes between airports in three countries; with two airports, x 1 and x 2, in the first country, three airports y 1, y 2 and y 3, in the second country, and two, z 1 and z 2, in the third. The numbers beside the lines in the diagram might indicate the number of alternative flights (perhaps planes departing at different times) along the routes.

The growing importance of the elements of group theory in sixth form teaching has been recognised by a number of recent publications, but a very simple presentation of the theory of groups by means of free variable axioms which was introduced by Lorenzen more than twenty-five years ago, and which is particularly well suited for elementary teaching, does not appear to be as well known as it deserves to be.

Lorenzen defines a group in terms of division x/y, instead of multiplication, a device which obviates the need to postulate the existence of a neutral element and an inverse.

I recently stumbled on an identity (Theorem 2) that related two types of permutations. It looked like one of those serendipitous pieces of mathematics that led to a simple enumerative result; mostly when this happens it leads joyously to an enumerative proof that was ‘blindingly’ obvious. Except in this case, it wasn’t, I don’t think.

Morley's theorem states that the points of intersection of adjacent trisectors of the angles of any triangle are the vertices of an equilateral triangle, known as Morley's triangle. See Figure 1.

Concise proofs of the theorem are given in recent papers [1, 2]. A good picture of important previous work can be obtained by looking at [3, p. 1999], and examining references cited there.