Yesterday, from the assumption that is divisible by , we deduced the equations

and

which hold in the group . So what do these tell us about the order of ? Well, first of all, the second equation tells us that the order of must be a divisor of , and the only divisors of are other powers of . So the order of must be for some .

Now suppose the order of is , so . But then if we square both sides we get . Squaring again gives , and so on. So once we hit , we are stuck there: raising to all bigger powers of will also yield .

But now look at the first equation: . Remember that the order of has to be a power of . From this equation we can see that the order can’t be . Could it be a smaller power of two? In fact, no, it can’t, by the argument in the previous paragraph: once you hit a power of two that yields , all the higher powers also have to yield . So if raised to any smaller power of were the identity, then would also have to be the identity—but it isn’t.

The inescapable conclusion is that the only possibility for the order of is exactly .

So, how does that help? *Hint*: think about the order of the group … the triumphant conclusion tomorrow!

##
About Brent

Assistant Professor of Computer Science at Hendrix College. Functional programmer, mathematician, teacher, pianist, follower of Jesus.

Pingback: MaBloWriMo 23: contradiction! | The Math Less Traveled