[r-t] Plain Bob leadheads

[Martin Bright]

On Sat, 20 Feb 2021 at 17:18, Philip Saddleton <cantab at saddleton.org.uk>
wrote:

> On Fri, 2021-02-19 at 15:33 +0100, Martin Bright wrote:
> > Proof:  It's enough to prove it in the case h = (2 4 6 .. n n-1 ... 5
> > 3) in cycle notation.
>
> Is it? It depends whether 'Plain Bob Lead Heads' means all of them.
> It's not true for methods with a 1-lead course, but what if n-1 is not
> prime?


I was assuming “Plain Bob lead heads” meant a course of n-1 leads.  You’re
right that this is the point at which it doesn’t work in other cases.

Martin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://bellringers.org/pipermail/ringing-theory/attachments/20210220/e3d68f55/attachment.html>